Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
- 1 October 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (5) , 1036-1050
- https://doi.org/10.1137/s0097539793250330
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Sublinear-Time Parallel Algorithms for Matching and Related ProblemsJournal of Algorithms, 1993
- Random pseudo-polynomial algorithms for exact matroid problemsJournal of Algorithms, 1992
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related ProblemsSIAM Journal on Computing, 1992
- On the power of parity polynomial timeTheory of Computing Systems, 1990
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite FieldsSIAM Journal on Computing, 1990
- On the power of two-point based samplingJournal of Complexity, 1989
- A las vegas rnc algorithm for maximum matchingCombinatorica, 1986
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976