Constant-time parallel integer sorting
暂无分享,去创建一个
[1] Torben Hagerup. Fast Parallel Generation of Random Permutations , 1991, ICALP.
[2] Rajeev Raman,et al. The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting , 1990, FSTTCS.
[3] Uzi Vishkin,et al. Converting high probability into nearly-constant time—with applications to parallel hashing , 1991, STOC '91.
[4] Fanica Gavril. Merging with parallel processors , 1975, CACM.
[5] D. Eppstein,et al. Parallel Algorithmic Techniques for Combinatorial Computation , 1988 .
[6] P. Ragde. The parallel simplicity of compaction and chaining , 1990 .
[7] David Eppstein,et al. Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.
[8] Friedhelm Meyer auf der Heide,et al. Not all keys can be hashed in constant time , 1990, STOC '90.
[9] Krzysztof Diks,et al. Improved Deterministic Parallel Integer Sorting , 1991, Inf. Comput..
[10] Johan Håstad,et al. Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.
[11] Richard Cole,et al. Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..
[12] Torben Hagerup,et al. A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..
[13] Sanguthevar Rajasekaran,et al. Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..
[14] Torben Hagerup,et al. Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM , 1990, SPAA '90.