APA (7th ed.) Citation

Spielman, D. A. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM.

Chicago Style (17th ed.) Citation

Spielman, Daniel A. "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time." Journal of the ACM .

MLA (9th ed.) Citation

Spielman, Daniel A. "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time." Journal of the ACM, .

Warning: These citations may not always be 100% accurate.