World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
73
Citations
31814
World Ranking
1547
National Ranking
803

Mathematics

D-Index
73
Citations
31161
World Ranking
228
National Ranking
128

Research.com Recognitions

  • 2017 - Member of the National Academy of Sciences
  • 2013 - Fellow of the American Mathematical Society
  • 2010 - Fellow of the American Academy of Arts and Sciences
  • 2008 - ACM Fellow For contributions to algorithms and complexity theory.
  • 2005 - Fellow of John Simon Guggenheim Memorial Foundation
  • 2002 - Rolf Nevanlinna Prize
  • 1998 - Fellow of Alfred P. Sloan Foundation

Overview

Madhu Sudan is affiliated with Harvard University in the United States and has contributed extensively to the field of computer science, with a focus on computational theory and mathematics. Their research spans a variety of subfields, including computational theory and mathematics, artificial intelligence, computer networks and communications, electrical and electronic engineering, and molecular biology.

The main topics of Madhu Sudan's work include:

  • Complexity and Algorithms in Graphs
  • Constraint Satisfaction and Optimization
  • Optimization and Search Problems
  • Coding Theory and Cryptography
  • Algorithms and Data Compression
  • Computational Geometry and Mesh Generation
  • Advanced Graph Theory Research

Madhu Sudan has published research in frequent venues such as:

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Journal of Indo Pacific Academy of Forensic Odontology
  • ACM Transactions on Computation Theory

Notable recent papers by Madhu Sudan include:

  • Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance, 2020, arXiv (Cornell University)
  • Ideal-Theoretic Explanation of Capacity-Achieving Decoding, 2023, IEEE Transactions on Information Theory
  • Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance, 2022, IEEE Transactions on Information Theory
  • Point-hyperplane Incidence Geometry and the Log-rank Conjecture, 2022, ACM Transactions on Computation Theory
  • On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction, 2025, IEEE Transactions on Information Theory

The scientist frequently collaborates with multiple coauthors, including:

  • Santhoshini Velusamy
  • Noah Singer
  • Srikanth Srinivasan
  • Prashanth Amireddy
  • Prahladh Harsha

Madhu Sudan has been recognized with several awards over their career. These include being named a Member of the National Academy of Sciences in 2017, a Fellow of the American Mathematical Society in 2013, and a Fellow of the American Academy of Arts and Sciences in 2010. Earlier honors include becoming an ACM Fellow in 2008 for contributions to algorithms and complexity theory, a Fellow of the John Simon Guggenheim Memorial Foundation in 2005, the Rolf Nevanlinna Prize in 2002, and a Fellow of the Alfred P. Sloan Foundation in 1998.

Best Publications

  • Proof verification and the hardness of approximation problems.

    Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan

  • Private information retrieval

    Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan

  • A Fuzzy Vault Scheme

    Ari Juels;Madhu Sudan

  • Improved decoding of Reed-Solomon and algebraic-geometry codes

    V. Guruswami;M. Sudan

  • Improved decoding of Reed-Solomon and algebraic-geometric codes.

    Venkatesan Guruswami;Madhu Sudan

  • Priority encoding transmission

    A. Albanese;J. Blomer;J. Edmonds;M. Luby

  • Proof verification and hardness of approximation problems

    S. Arora;C. Lund;R. Motwani;M. Sudan

  • Robust Characterizations of Polynomials withApplications to Program Testing

    Ronitt Rubinfeld;Madhu Sudan

  • Decoding of Reed Solomon Codes beyond the Error-Correction Bound

    Madhu Sudan

  • Free Bits, PCPs, and Nonapproximability---Towards Tight Results

    Mihir Bellare;Oded Goldreich;Madhu Sudan

  • Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

    Eli Ben-Sasson;Oded Goldreich;Prahladh Harsha;Madhu Sudan

  • Pseudorandom generators without the XOR lemma

    M. Sudan;L. Trevisan;S. Vadhan

  • Improved low-degree testing and its applications

    Sanjeev Arora;Madhu Sudan

  • On Syntactic versus Computational Views of Approximability

    Sanjeev Khanna;Rajeev Motwani;Madhu Sudan;Umesh Vazirani

  • Approximate graph coloring by semidefinite programming

    David Karger;Rajeev Motwani;Madhu Sudan

  • Complexity classifications of Boolean constraint satisfaction problems

    Nadia Creignou;Sanjeev Khanna;Madhu Sudan

  • Chinese remaindering with errors

    O. Goldreich;D. Ron;M. Sudan

  • Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

    Guy Even;Joseph Naor;Baruch Schieber;Madhu Sudan

  • The minimum latency problem

    Avrim Blum;Prasad Chalasani;Don Coppersmith;Bill Pulleyblank

  • A reliable dissemination protocol for interactive collaborative applications

    Unknown

  • Free bits, PCPs and non-approximability-towards tight results

    M. Bellare;O. Goldreich;M. Sudan

  • Pseudorandom Generators without the XOR Lemma (Abstract).

    Madhu Sudan;Luca Trevisan;Salil P. Vadhan

Frequent Co-Authors

Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Sanjeev Khanna
Sanjeev Khanna University of Pennsylvania
Eli Ben-Sasson
Eli Ben-Sasson Technion – Israel Institute of Technology
Luca Trevisan
Luca Trevisan Bocconi University
Salil P. Vadhan
Salil P. Vadhan Harvard University
Rajeev Motwani
Rajeev Motwani Stanford University
Johan Håstad
Johan Håstad Royal Institute of Technology
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in mathematics, exploring related online degrees can open diverse career opportunities. Many professionals combine their math skills with business knowledge, making an MBA a popular choice. If you are concerned about credit transfer, programs listed under online mba transfer credits can be particularly accommodating, allowing you to leverage previous coursework efficiently.

The rise of data-driven roles also invites math graduates to consider a master in data analytics. This degree blends statistical expertise and computational skills, opening doors in industries like finance, tech, and healthcare analytics.

For those looking for a more accessible business degree path, options exist including some of the easiest mba programs. These offer flexible admission standards, helping students from various academic backgrounds gain valuable business acumen without excessive barriers.

Additionally, if flexibility and convenience are priorities, consider the easiest online mba program choices. These programs often accommodate working professionals and provide a balance between rigorous training and manageable coursework.

Best Scientists Citing Madhu Sudan

Trending Scientists

Recently Published Articles