풀커슨상: 두 판 사이의 차이

내용 삭제됨 내용 추가됨
편집 요약 없음
61번째 줄:
| Daniel Spielman, 텅샹화({{zh|s=滕尚华|t=滕尚華|p=Téng Shànghuá}}) || <ref>Daniel A. Spielman and Shang-Hua Teng, "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time", ''Journal of the ACM'' 51: 385–463, 2004.</ref>
|-
| Thomas Callister Hales, Samuel P. Ferguson || <ref>Thomas C. Hales, "A proof of the Kepler conjecture", ''Annals of Mathematics'' 162: 1063–1183, 2005.</ref><ref>Samuel P. Ferguson, "Sphere Packings, V. Pentahedral Prisms", ''Discrete and Computational Geometry'' 36: 167–204, 2006.</ref>
|-
| rowspan=3 |2012 || Sanjeev Arora, Satish Rao, Umesh Vazirani || <ref>Sanjeev Arora, Satish Rao, and Umesh Vazirani, "Expander flows, geometric embeddings and graph partitioning", ''Journal of the ACM'' 56: 1-37, 2009.</ref>