A simplex variant solving an m×d linear program in O(min(m2,d2)) expected number of pivot steps

Combinatorial complexity of the central curve

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

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

Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)

Improved Smoothed Analysis of the Shadow Vertex Simplex Method

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Local search: simple, successful, but sometimes sluggish

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming

George Dantzig's impact on the theory of computation

Discrete Optimization