An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 30th IEEE symposium on Foundations of computer science
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Simpler and faster biconnectivity augmentation
Journal of Algorithms
Efficient Parallel Algorithms on Distance-Hereditary Graphs
ICPP '97 Proceedings of the international Conference on Parallel Processing
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Simpler and Faster Vertex-Connectivity Augmentation Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
Journal of Parallel and Distributed Computing
Compiling Functional Parllelism on a Family of Distributed Memory Architectures
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
The bridge-connectivity augmentation problem with a partition constraint
Theoretical Computer Science
| Hi-index | 0.00 |