Madhu Sudan
MadhuSudan
2003–2004
Massachusetts Institute of Technology
Computer Science
Randomness and Computation

Madhu Sudan is a professor of computer science at MIT. He is interested in computational complexity, the area of mathematics that studies mathematical functions in terms of the number of elementary steps it takes to “compute” them using a computer. His most recent work focuses on the computational complexity of recovering from errors during communication.

At Radcliffe, Sudan intends to investigate local error-correction processes. When transmitting large amounts of data, traditional error-correction methods tend to view the data holistically and perform large, global checks to verify the integrity of the data. A new stream of work suggests, however, that simpler, much more local processes may also be capable of detecting and correcting errors.

Sudan received his bachelor’s degree in technology from the Indian Institute of Technology at New Delhi, India, in 1987 and his PhD in computer science from the University of California at Berkeley in 1992. He is a leading researcher in the mathematical aspects of computer science and has served on the program committees of most major conferences in this area. He is also on the editorial boards of several major journals. He was the chair of the program committee for the Conference on Computational Complexity 2001 and is the program chair of the symposium on Foundations of Computer Science 2003. He has received many awards, including the Nevanlinna Award in 2002 for outstanding contributions to mathematical aspects of computing and information sciences.

This information is accurate as of the fellowship year indicated for each fellow.