1. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time;Spielman;J ACM (JACM),2004
2. Advances in Discrete and Computational Geometry: Proceedings of the 1996 AMS-IMS-SIAM Joint Summer Research Conference, Discrete and Computational Geometry-Ten Years Later, 1996 July 14-18;Amenta,1998
3. A subexponential randomized simplex algorithm;Kalai,1992