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
Fast and reliable parallel hashing
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Tight bounds for the chaining problem
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh 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
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
An O(log log n) time algorithm to compute the kernel of a polygon
Nordic Journal of Computing
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
Hi-index | 0.00 |