维普中文期刊产品整合服务
13篇 您的检索式:作者名="Stockmeyer L"
    题名 作者 年代 出处 被引量
1The equivalence problem for regular expressions with squaring requires exponential time显示文摘MEYER A R STOCKMEYER L J 1972Proceedings of the 13th Annual Symposium on Switching and Automata Theoy1972,,:1
2Some simplified NP complete graph problems 显示文摘Garey M R Johnson D S Stockmeyer L 1976Theoretical Computer Science1976,1,3:1
3Some simplified NP-complete graph problems显示文摘Garey M R Johnson D S Stockmeyer L 1976Theoretical Computer Science1976,1,3:1
4A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers显示文摘HO C T STOCKMEYER L 2004IEEE Trans on Computers2004,53,4:1
5Some simplified NP-complete graph problems显示文摘Garey M R Johnson D S Stockmeyer L 1976Theoretical Computer Science1976,,:1
6Consensus in the presence of partial synchrony 显示文摘Dwork C Lynch N Stockmeyer L 1988Journal of the ACM1988,35,2:1
7Solving NP-hard problems on graphs that are almost trees and an application to facility location problems显示文摘Gurevich Y Stockmeyer L Vishkin U 1984Journal of the ACM1984,31,3:1
8A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers显示文摘Ho C Stockmeyer L 2004IEEE Transactions on Computers2004,54,:1
9A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers显示文摘Ho C T Stockmeyer L 2004IEEE Transactions on Computers2004,53,4:1
10Some simplified NP-complete graph problems显示文摘Garey M Johnson D Stockmeyer L 1976Theoretical Computer Science1976,1,1:1
11Optimal orientations of cells in Slicing Floorplan designs显示文摘STOCKMEYER L 1983Information and Control1983,57,23:1
12Alternation显示文摘Chandra A Kozen D Stockmeyer L 1981J ACM1981,28,1:1
13Some simplied NP-complete graph problems显示文摘Garey M R Johnson D S Stockmeyer L 1976Theor Comput Sci1976,,1:1
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费