论文信息 - Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking - 字舞流文

Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking

Richard Cole | Uzi Vishkin | R. Cole | U. Vishkin

[1] Richard Cole,et al. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[2] Richard M. Karp,et al. The complexity of parallel computation , 1986 .

[3] Larry Rudolph,et al. Efficient Parallel Algorithms for Graph Models , 1986, International Conference on Parallel Processing.

[4] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[5] Friedhelm Meyer auf der Heide,et al. One, two, three . . . infinity: lower bounds for parallel computation , 1985, STOC '85.

[6] Friedhelm Meyer auf der Heide,et al. The complexity of parallel sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7] Uzi Vishkin,et al. On Efficient Parallel Strong Orientation , 1985, Inf. Process. Lett..

[8] Uzi Vishkin,et al. Randomized speed-ups in parallel computation , 2015, STOC '84.

[9] Uzi Vishkin,et al. An optimal parallel connectivity algorithm , 1984, Discret. Appl. Math..

[10] Francis Y. L. Chin,et al. OPTIMAL PARALLEL ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM. , 1981 .

[11] M. Fischer,et al. Parallel Prefix Computation , 1980, J. ACM.

[12] James Christopher Wyllie,et al. The Complexity of Parallel Computations , 1979 .

[13] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .