A new polynomial-time algorithm for linear programming
Combinatorica
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Constructing a perfect matching is in random NC
Combinatorica
The monotone circuit complexity of Boolean functions
Combinatorica
Matching is as easy as matrix inversion
Combinatorica
A fast parallel algorithm for determining all roots of a polynomial with real roots
SIAM Journal on Computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower Bounds in a Parallel Model without Bit Operations
SIAM Journal on 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
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
A lOwer Bound for Solvability of Polynomial Equations
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The complexity of some problems in parametric linear and combinatorial programming
The complexity of some problems in parametric linear and combinatorial programming
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |