An improved parallel algorithm for maximal matching
Information Processing Letters
Constructing a perfect matching is in random NC
Combinatorica
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A random NC algorithm for depth first search
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
Combinatorica
On the power of two-point based sampling
Journal of Complexity
An efficient algorithm for the minimum capacity cut problem
Mathematical Programming: Series A and B
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity
SIAM Journal on Computing
Cluster analysis for hypertext systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
A linear time 2 + &&egr; approximation algorithm for edge connectivity
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Approximating unweighted connectivity problems in parallel
Information and Computation
| Hi-index | 0.00 |