[1][2] The dissertation he wrote at the University of California, Berkeley is titled Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems.

The prize recognizes outstanding work in the mathematical aspects of computer science.

Sudan was honored for his work in advancing the theory of probabilistically checkable proofs—a way to recast a mathematical proof in computer language for additional checks on its validity—and developing error-correcting codes.

[1] For the same work, he received the ACM's Distinguished Doctoral Dissertation Award in 1993 and the Gödel Prize in 2001 and was an Invited Speaker of the ICM in 1998.

[10] Sudan has made important contributions to several areas of theoretical computer science, including probabilistically checkable proofs, non-approximability of optimization problems, list decoding, and error-correcting codes.