Ranomized Parallel Computation
作者： John H. Reif , Sanguthevar Rajasekaran
DOI:
关键词:
摘要:
参考文章(71)
Kurt Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching ,(2011)
John H Reif, Sanguthevar Rajasekaran, Derivation of Randomized Algorithms. ,(1985)
John H. Reif, William L. Scherlis, Deriving Efficient Graph Algorithms Lecture Notes in Computer Science. pp. 645- 681 ,(2003) , 10.1007/978-3-540-39910-0_28
Narsingh Deo, Edward M. Reingold, Jurg Nievergelt, Combinatorial Algorithms: Theory and Practice ,(1977)
Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science ,(1974)
Sanguthevar Rajasekaran, Thanasis Tsantilas, An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks Lecture Notes in Computer Science. pp. 226- 241 ,(1987) , 10.1007/3-540-18625-5_53
Sanguthevar Rajasekaran, John H. Reif, Randomized parallel computation fundamentals of computation theory. pp. 364- 376 ,(1988) , 10.1007/978-1-4684-5511-3_11
N. Pippenger, Parallel Communication With Limited Buffers 25th Annual Symposium onFoundations of Computer Science, 1984.. pp. 127- 136 ,(1984) , 10.1109/SFCS.1984.715909
Manfred Kunde, Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers symposium on theoretical aspects of computer science. pp. 408- 419 ,(1987) , 10.1007/BFB0039623
Faith Ellen Fich, Two problems in concrete complexity: cycle detection and parallel prefix computation University of California, Berkeley. ,(1982)