Random Walks with "Back Buttons"

Madhu Sudan

Associate Professor, EECS Department

Massachusetts Institute of Technology

Dr. Madhu Sudan is an Associate Professor in the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. He recieved his Bachelor's degree from the Indian Institute of Technology at New Delhi in 1987 and his Ph.D. from the University of California at Berkeley in 1992. He was a Research Staff Member at IBM's Thomas J. Watson Research Center in Yorktown Heights, NY from 1992 to 1997 and has been at his current position since then. Dr. Madhu Sudan is a recipient of ACM's Doctoral Dissertation Award, the NSF Career Award and the Alfred P. Sloan Foundation Fellowship. Dr. Madhu Sudan's research interests include computational complexity theory, algorithms and coding theory. He is currently a member of the editorial boards of the SIAM Journal on Computing, the SIAM Journal on Discrete Mathematics, and Information and Computation. He is best known for his works on the complexity of finding near-optimal solutions to combinatorial optimization problems, and on the construction of algorithms for error-correction in algebraic error-correcting codes.