More time-work tradeoffs for parallel graph algorithms
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On finding minimal 2-connected subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast hashing on a PRAM—designing by expectation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Time-work tradeoffs for parallel graph algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Implementing the multiprefix operation on parallel and vector computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 30th IEEE symposium on Foundations of computer science
Time-work tradeoffs for parallel algorithms
Journal of the ACM (JACM)
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
Efficient parallel algorithms for some integer problems
CSC '91 Proceedings of the 19th annual conference on Computer Science
Improved fast interger sorting in linear space
Information and Computation
Parallel Self-Index Integer Sorting
The Journal of Supercomputing
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Approximating Huffman Codes in Parallel
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximating Huffman codes in parallel
Journal of Discrete Algorithms
| Hi-index | 0.00 |