Madhu Sudan
From Wikipedia, the free encyclopedia
University of California, Berkeley (PhD)
- Gödel Prize (2001)
- Nevanlinna Prize (2002)
- Infosys Prize (2014)
- IEEE Richard W. Hamming Medal (2022)
Madhu Sudan | |
|---|---|
 Sudan at Oberwolfach in 2015 | |
| Born | 12 September 1966 |
| Education | IIT Delhi (BTech) University of California, Berkeley (PhD) |
| Awards |
|
| Scientific career | |
| Thesis | Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (1992) |
| Doctoral advisor | Umesh Vazirani |
| Doctoral students | Venkatesan Guruswami Benjamin Rossman Ryan O'Donnell |
Madhu Sudan (born 12 September 1966)[1] 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.
He received his bachelor's degree in computer science from IIT Delhi in 1987[1] and his doctoral degree in computer science at the University of California, Berkeley in 1992.[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. He was a research staff member at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York from 1992 to 1997 and became a researcher at the Massachusetts Institute of Technology (MIT) after that.[1] From 2009 to 2015 he was a permanent researcher at Microsoft Research New England before joining the Harvard University faculty in 2015.[3]
