Constructing a perfect matching is in random NC
Combinatorica
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Constructing a maximal independent set in parallel
SIAM Journal on Discrete Mathematics
Expanding graphs and the average-case analysis of algorithms for matchings and related problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Handbook of theoretical computer science (vol. A)
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Self-routing superconcentrators
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Interior-point methods in parallel computation
Interior-point methods in parallel computation
Coarse grained parallel algorithms for graph matching
Parallel Computing
| Hi-index | 0.00 |