Name Madhu Sudan Role Computer scientist | Doctoral advisor Umesh Vazirani | |
 | ||
Born September 12, 1966 (age 57)
Chennai, India ( 1966-09-12 ) Alma mater IIT Delhi
University of California, Berkeley Thesis Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (1992) Doctoral students Mikhail Alekhnovitch
Victor Chen
Yevgeniy Dodis
Elena Grigorescu
Alan Guo
Venkatesan Guruswami
Prahladh Harsha
Brendan Juba
Swastik Kopparty
April Lehman
Eric Lehman
Ryan O'Donnell
Benjamin Rossman
Shubhangi Saraf
Adam Smith
Sergey Yekhanin Notable awards Nevanlinna Prize (2002)
Godel Prize
Infosys Prize (2014) Books Complexity Classifications of Boolean Constraint Satisfaction Problems Education University of California, Berkeley (1992), Indian Institute of Technology Delhi (1987) Awards Nevanlinna Prize, Godel Prize, Guggenheim Fellowship for Natural Sciences, US & Canada Similar People Venkatesan Guruswami, Sanjeev Arora, Mario Szegedy, Rajeev Motwani, Shafi Goldwasser | ||
Notable students Venkatesan Guruswami | ||
Interview with infosys prize 2014 winner madhu sudan
Madhu Sudan (born September 12, 1966) is an Indian-American computer scientist. He has been a Gordon McKay Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences since 2015.
Contents
- Interview with infosys prize 2014 winner madhu sudan
- The method of multiplicities madhu sudan
- Career
- Research contribution and awards
- References
The method of multiplicities madhu sudan
Career
He received his bachelor's degree in computer science from IIT Delhi in 1987 and his doctoral degree in computer science at the University of California, Berkeley in 1992. He was a research staff member at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York from 1992 to 1997 and moved to MIT after that. From 2009 to 2015 he was a permanent researcher at Microsoft Research New England before joining Harvard University in 2015.
Research contribution and awards
He was awarded the Rolf Nevanlinna Prize at the 24th International Congress of Mathematicians in 2002. 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. For the same work, he received the ACM's Distinguished Doctoral Dissertation Award in 1993 and the Gödel Prize in 2001. He is a Fellow of the ACM (2008). In 2012 he became a fellow of the American Mathematical Society. In 2014 he won the Infosys Prize in the mathematical sciences. In 2017 he was elected to the National Academy of Sciences.
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.