Theory of linear and integer programming
Theory of linear and integer programming
Constructing a perfect matching is in random NC
Combinatorica
Matching is as easy as matrix inversion
Combinatorica
The complexity of parallel search
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Maximum matchings in general graphs through randomization
Journal of Algorithms
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
An introduction to randomized algorithms
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
.879-approximation algorithms for MAX CUT and MAX 2SAT
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)
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Randomized algorithms
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
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Optimal Search on Some Game Trees
Journal of the ACM (JACM)
Expected time bounds for selection
Communications of the ACM
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Probabilistic Boolean decision trees and the complexity of evaluating game trees
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Approximate graph coloring by semidefinite programming
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |