| Year |
|
Winner |
Winner Work |
| 2010 |
|
Daniel Spielman |
For smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing. |
| 2006 |
|
Jon Kleinberg |
|
| 2002 |
|
Madhu Sudan |
For his work in advancing the theory of probabilistically checkable proofs\u2014a way to recast a mathematical proof in computer language for additional checks on its validity\u2014and developing error-correcting codes. |
| 1998 |
|
Peter Shor |
For his development of Shor's algorithm. |
| 1994 |
|
Avi Wigderson |
For his work on computational complexity. |
| 1990 |
|
Alexander Razborov |
For introducing the approximation method in proving Boolean circuit lower bounds of some essential algorithmic problems. |
| 1986 |
|
Leslie Valiant |
|
| 1982 |
|
Robert Tarjan |
For outstanding contributions to mathematical aspects of information science. |
