The worst-case running time of the random simplex algorithm is exponential in the height

One line and &egr;

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

The random facet simplex algorithm on combinatorial cubes

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization

One line and n points

Random Structures & Algorithms

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