Daniel A. Spielman, Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385-463, 2004. [doi]
@article{SpielmanT04:0,
title = {Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time},
author = {Daniel A. Spielman and Shang-Hua Teng},
year = {2004},
doi = {10.1145/990308.990310},
url = {http://doi.acm.org/10.1145/990308.990310},
tags = {analysis},
researchr = {https://researchr.org/publication/SpielmanT04%3A0},
cites = {0},
citedby = {0},
journal = {Journal of the ACM},
volume = {51},
number = {3},
pages = {385-463},
}