A new polynomial-time algorithm for linear programming
Combinatorica
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
On the topology of algorithms, I
Journal of Complexity
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)
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of 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
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
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
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |