Randomized speed-ups in parallel computation
暂无分享,去创建一个
[1] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..
[4] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[5] Rüdiger Reischuk,et al. A fast probabilistic parallel sorting algorithm , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] James Christopher Wyllie,et al. The Complexity of Parallel Computations , 1979 .
[7] Uzi Vishkin,et al. A complexity theory for unbounded fan-in parallelism , 1982, FOCS 1982.
[8] Uzi Vishkin,et al. Parallel Dictionaries in 2-3 Trees , 1983, ICALP.
[9] Uzi Vishkin,et al. A complexity theory for unbounded fan-in parallelism , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[10] E. Szemerédi,et al. Sorting inc logn parallel steps , 1983 .
[11] Uzi Vishkin,et al. Optimal parallel generation of a computation tree form , 1985, TOPL.
[12] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[13] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[14] Yung H. Tsin,et al. Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..
[15] Uzi Vishkin,et al. On Efficient Parallel Strong Orientation , 1985, Inf. Process. Lett..
[16] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[17] Francis Y. L. Chin,et al. OPTIMAL PARALLEL ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM. , 1981 .
[18] Uzi Vishkin,et al. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.
[19] Uzi Vishkin,et al. An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.
[20] Uzi Vishkin,et al. An optimal parallel connectivity algorithm , 1984, Discret. Appl. Math..
[21] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..