Constant-time parallel integer sorting
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
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An efficient parallel algorithm for the single function coarsest partition problem
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
Symmetry breaking for suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Parallel Algorithms for Relational Coarsest Partition Problems
IEEE Transactions on Parallel and Distributed Systems
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth 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
Improved fast interger sorting in linear space
Information and Computation
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
Approximating Huffman Codes in Parallel
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Parallel algorithms for separable permutations
Discrete Applied Mathematics
Approximating Huffman codes in parallel
Journal of Discrete Algorithms
Parallel algorithms for separable permutations
Discrete Applied Mathematics
An efficient parallel algorithm for building the separating tree
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |