Finding Euler tours in parallel
Journal of Computer and System Sciences
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
SIAM Journal on Computing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Information and Computation
An optimal randomized parallel algorithm for finding connected components in a graph
SIAM Journal on Computing
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
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
Finding triconnected components by local replacement
SIAM Journal on Computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of 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 simpler parallel algorithm for graph connectivity
Journal of Algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
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 log log n) time on the EREW PRAM
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
Random sampling in graph optimization problems
Random sampling in graph optimization problems
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
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
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of acyclic subhypergraph problems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
| Hi-index | 0.00 |