Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A bridging model for parallel computation
Communications of the ACM
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
Randomized parallel algorithms for trapezoidal diagrams
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Supporting the hypercube programming model on mesh architectures: (a fast sorter for iWarp tori)
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Implementing the multiprefix operation on parallel and vector computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth 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
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved fast interger sorting in linear space
Information and Computation
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
A Randomized Sorting Algorithm on the BSP model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Information Processing Letters
Efficient Parallel Hierarchical Clustering Algorithms
IEEE Transactions on Parallel and Distributed Systems
Linear work suffix array construction
Journal of the ACM (JACM)
Reconfigurable hardware solution to parallel prefix computation
The Journal of Supercomputing
Finding strongly connected components in parallel using O(log2n) reachability queries
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Brief announcement: low depth cache-oblivious sorting
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Low depth cache-oblivious algorithms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.02 |