1. Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM 51, 385–463 (2004)
2. Blum, A., Dunagan, J.: Smoothed analysis of the perceptron algorithm for linear programming. In: SODA 2002, pp. 905–914 (2002)
3. Dunagan, J., Spielman, D.A., Teng, S.H.: Smoothed analysis of interior point algorithms: Condition number (2003), Available at http://arxiv.org/abs/cs.DS/0302011
4. Sankar, A., Spielman, D.A., Teng, S.H.: Smoothed analysis of interior point algorithms: Condition number (2005), available at http://arxiv.org/abs/cs.NA/0310022
5. Spielman, T.: Smoothed analysis: Motivation and discrete models. In: WADS: 8th Workshop on Algorithms and Data Structures (2003)