John Templeton Foundation

 
Home Approach Program Committee Other Participants
   
Other Participants  
 

The Fujitsu Professor of Computer Science at the Massachusetts Institute of Technology, Madhu Sudan is internationally recognized for his contributions to error-correcting codes and for foundational work in using probabilistic methods to verify proofs of mathematical statements. He was born in India and graduated from the Indian Institute of Technology in New Delhi. After earning a Ph.D. in computer science from the University of California at Berkeley in 1992 (and winning two awards for his doctoral dissertation), he worked as a staff scientist in mathematics at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York. Dr. Sudan joined the MIT faculty as an associate professor of electrical engineering and computer science in 1997, was appointed professor in 2003, and named to his present chair last year. He is currently the research director for theoretical computer science at MIT’s Computer Science and Artificial Intelligence Laboratory. Winner of the 2002 Nevanlinna Prize of the International Mathematical Union, he also has been the recipient of an Alfred P. Sloan Research Fellowship, a National Science Foundation Career Award, an IEEE Information Theory Paper Award, the 2001 Gödel Prize, distinguished alumnus awards from Berkeley and the Indian Institute of Technology, a Radcliffe Fellowship, and a Guggenheim Fellowship. Dr. Sudan has delivered invited lectures throughout North America and Europe, as well as in Israel, India, China, Japan, and Australia. Guest editor of a special issue of the Journal of Computer and System Sciences devoted to papers from the 2001 IEEE Conference on Computational Complexity, he formerly served on the editorial boards of Information and Computation, the SIAM Journal of Discrete Mathematics, and the IEEE Transactions on Information Theory and is currently editor-in-chief of Foundations and Trends in Theoretical Computer Science and a member of the editorial boards of the Journal of the ACM and the SIAM Journal on Computing. He is the author or co-author of more than one hundred papers published in scientific journals and conference proceedings and of two books, Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (1996) and, most recently, (with Nadia Creignou and Sanjeev Khanna) Complexity Classifications of Boolean Constraint Satisfaction Problems, which was published by SIAM Press in 2001.