Constructing a perfect matching is in random NC
Combinatorica
A Las Vegas RNC algorithm for maximum matching
Combinatorica
Matching is as easy as matrix inversion
Combinatorica
Maximum matchings in general graphs through randomization
Journal of Algorithms
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A new approach to maximum matching in general graphs
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Las Vegas RNC algorithms for unary weighted perfect matching and T-join problems
Information Processing Letters
The design and analysis of algorithms
The design and analysis of algorithms
Random Weighted Laplacians, Lovász minimum digraphs and finding minimum separators
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
A Theory of Alternating Paths and Blossoms for Proving Correctness of the $O(\'sqrt{VE})$ General Graph Matching Algorithm
| Hi-index | 0.00 |