Parallel algorithmic techniques for combinatorial computation
Annual review of computer science: vol. 3, 1988
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Optimal and sublogarithmic time randomized parallel sorting algorithms
SIAM Journal on Computing
Faster optimal parallel prefix sums and list ranking
Information and Computation
A guided tour of Chernoff bounds
Information Processing Letters
The parallel simplicity of compaction and chaining
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast parallel generation of random permutations
Proceedings of the 18th international colloquium on Automata, languages and programming
Improved deterministic parallel integer sorting
Information and Computation
Merging with parallel processors
Communications of the ACM
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Hi-index | 0.00 |