Madhu Sudan is an Associate Director of CSAIL and the Fujitsu Professor in the EECS Department at the MIT. He received a B.Tech. in Computer Science from the Indian Institute of Technology at New Delhi in 1987, and a Ph.D. in Computer Science from the University of California at Berkeley in 1992. Madhu Sudan was a research staff member at the IBM Thomas J. Watson Research Laboratory from 1992 to 1997. He joined the Massachusetts Institute of Technology in 1997.
Madhu Sudan's research interests lie in Algorithms, Complexity, Probabilistic Proof Verification, Combinatorial Optimization, Coding Theory and Algebraic Computation. He has served on the program committees of numerous conferences in theoretical computer science and chaired the program committees of IEEE Conf. on Computational Complexity (2001) and IEEE Symp. on Foundations of CS (2003). He is on the editorial board of the Journal of the ACM, SIAM Journal on Computing, and Information and Computation. He is a recipient of numerous awards including the Nevanlinna Prize (2002) awarded by the International Mathematical Union for outstanding contributions to mathematical aspects of information science. Madhu Sudan was named a Distinguished Alum by the CS Division of the University of California at Berkeley in 2003 and by the Indian Institute of Technology at Delhi in 2004.
- R. Rubinfeld and M. Sudan, "Robust characterizations of polynomials with applications to program testing," SIAM Journal on Computing, 25 (2):252-271, April 1996.
- M. Sudan, "Decoding of Reed Solomon codes beyond the error-correction bound,'' Journal of Complexity, 13 (1): 180-193, March 1997.
- S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, "Proof verification and the hardness of approximation problems,'' Journal of the ACM, 45 (3): 501-555, May 1998.
- V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon codes and algebraic-geometry codes," IEEE Transactions on Information Theory, 45 (6): 1757-1767, September 1999.
- E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan, "Robust PCPs of Proximity, shorter PCPs, and applications to coding", Proc. 36th Annual ACM Symposium on Theory of Computing, pages 1-10, ACM Press, 2004.
- Infosys Science Foundation: Prize for Mathematical Sciences (2014)
- Association for Computing Machinery: Fellow (2013)
- American Academy of Arts and Sciences: Fellow (2010)
- Institute of Electrical and Electronics Engineers: Fellow (2009)
- Association for Computing Machinery: Fellow (2009)
- John Simon Guggenheim Memorial Foundation: Fellow (2005)
- Indian Institute of Technology at New Delhi: Distinguished Alumnus Award (2004)
- University of California Berkeley| CS Division: Distinguished Alumni Award (2003)
- The International Mathematical Union: Rolf Nevanlinna Prize (2002)
- Institute of Electrical and Electronics Engineers: Info Theory Society - Best Paper (2002)
- Godel: Gödel Prize in Theoretical Computer Science (2001)
- National Science Foundation: Career Award (1999)
- Association for Computing Machinery: Doctoral Dissertation Award (1993)