Data structures and network algorithms
Data structures and network algorithms
Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Connected components in O(lg3/2|V|) parallel time for the CREW PRAM (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An introduction to parallel algorithms
An introduction to parallel algorithms
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Random sampling in graph optimization problems
Random sampling in graph optimization problems
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Finding connected components in O(log n loglog n) time on the EREW PRAM
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximate and exact parallel scheduling with applications to list, tree and graph problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
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
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |