Faster Optimal Parallel Prefix Sums and List Ranking
暂无分享,去创建一个
[1] Uzi Vishkin,et al. On Efficient Parallel Strong Orientation , 1985, Inf. Process. Lett..
[2] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[3] Johan Håstad,et al. Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.
[4] Richard Cole,et al. Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[5] John H. Reif,et al. An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[6] James Christopher Wyllie,et al. The Complexity of Parallel Computations , 1979 .
[7] Gary L. Miller,et al. Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[8] J. Reif,et al. Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..
[9] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..
[10] Richard M. Karp,et al. The complexity of parallel computation , 1986 .
[11] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..
[12] Uzi Vishkin,et al. Randomized speed-ups in parallel computation , 2015, STOC '84.
[13] Uzi Vishkin,et al. Randomized Parallel Speedups for List Ranking , 1987, J. Parallel Distributed Comput..
[14] Richard Cole,et al. Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking , 1988, AWOC.
[15] Uzi Vishkin,et al. Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..