Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Data structures and network algorithms
Data structures and network algorithms
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An optimal randomized parallel algorithm for finding connected components in a graph
SIAM Journal on Computing
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
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
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
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
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
A Simpler Minimum Spanning Tree Verification Algorithm
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
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
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Algorithms and theory of computation handbook
| Hi-index | 0.00 |