Madhu Sudan, Ph.D.

Madhu Sudan is known for his work in computational complexity theory. He has made fundamental contributions in the areas of probabilistically checkable proofs, nonapproximability of optimization problems and computational aspects of error-correcting codes. More recently, he initiated the study of universal semantic communication.