Constant-time parallel integer sorting
STOC '91 Proceedings of the twenty-third 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
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Delayed path coupling and generating random permutations via distributed stochastic processes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Randomized permutations in a coarse grained parallel environment
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
The Complexity of Distributions
SIAM Journal on Computing
Hi-index | 0.00 |