A new polynomial-time algorithm for linear programming
Combinatorica
Linear programming in O(n × 3d2) time
Information Processing Letters
A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Theory of linear and integer programming
Theory of linear and integer programming
The d-step conjecture and its relatives
Mathematics of Operations Research
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A survey of linear programming in randomized subexponential time
ACM SIGACT News
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
The random facet simplex algorithm on combinatorial cubes
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Discrete Mathematics - Kleitman and combinatorics: a celebration
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Combinatorial Linear Programming: Geometry Can Help
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
A randomized subexponential algorithm for parity games
Nordic Journal of Computing
Random Structures & Algorithms
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Linear programming and unique sink orientations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
Violator spaces: structure and algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
Violator spaces: Structure and algorithms
Discrete Applied Mathematics
Cyclic games and linear programming
Discrete Applied Mathematics
Embedding rivers in polyhedral terrains
Proceedings of the twenty-fifth annual symposium on Computational geometry
Diameter of polyhedra: limits of abstraction
Proceedings of the twenty-fifth annual symposium on Computational geometry
Linear complementarity and p-matrices for stochastic games
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Diameter of Polyhedra: Limits of Abstraction
Mathematics of Operations Research
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
On the complexity of solving Markov decision problems
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Jumping doesn't help in abstract cubes
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Simple stochastic games and p-matrix generalized linear complementarity problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
George Dantzig's impact on the theory of computation
Discrete Optimization
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
| Hi-index | 0.01 |