2026 Madhu Sudan: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	73	228	194	129	104	231	31161
Computer Science	73	1547	1500	804	774	246	31814

Madhu Sudan publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Madhu Sudan sits on this spectrum.

42 publications 537+

This scientist: 231 publications — 72nd percentile

72% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Madhu Sudan D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Madhu Sudan sits on this spectrum.

30 D-Index 86+

This scientist: 73 D-Index — 94th percentile

94% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

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

3063
Citations
Private information retrieval

Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan

2521
Citations
A Fuzzy Vault Scheme

Ari Juels;Madhu Sudan

1998
Citations
Improved decoding of Reed-Solomon and algebraic-geometry codes

V. Guruswami;M. Sudan

1576
Citations
Improved decoding of Reed-Solomon and algebraic-geometric codes.

Venkatesan Guruswami;Madhu Sudan

1525
Citations
Priority encoding transmission

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

1151
Citations
Proof verification and hardness of approximation problems

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

1064
Citations
Robust Characterizations of Polynomials withApplications to Program Testing

Ronitt Rubinfeld;Madhu Sudan

1000
Citations
Decoding of Reed Solomon Codes beyond the Error-Correction Bound

Madhu Sudan

1000
Citations
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

Mihir Bellare;Oded Goldreich;Madhu Sudan

821
Citations
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

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

693
Citations
Pseudorandom generators without the XOR lemma

M. Sudan;L. Trevisan;S. Vadhan

609
Citations
Improved low-degree testing and its applications

Sanjeev Arora;Madhu Sudan

579
Citations
On Syntactic versus Computational Views of Approximability

Sanjeev Khanna;Rajeev Motwani;Madhu Sudan;Umesh Vazirani

575
Citations
Approximate graph coloring by semidefinite programming

David Karger;Rajeev Motwani;Madhu Sudan

565
Citations
Complexity classifications of Boolean constraint satisfaction problems

Nadia Creignou;Sanjeev Khanna;Madhu Sudan

559
Citations
Chinese remaindering with errors

O. Goldreich;D. Ron;M. Sudan

469
Citations
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

Guy Even;Joseph Naor;Baruch Schieber;Madhu Sudan

453
Citations
The minimum latency problem

Avrim Blum;Prasad Chalasani;Don Coppersmith;Bill Pulleyblank

426
Citations
A reliable dissemination protocol for interactive collaborative applications

Unknown

384
Citations
Free bits, PCPs and non-approximability-towards tight results

M. Bellare;O. Goldreich;M. Sudan

276
Citations
Pseudorandom Generators without the XOR Lemma (Abstract).

Madhu Sudan;Luca Trevisan;Salil P. Vadhan

6
Citations

Frequent Co-Authors

Venkatesan Guruswami University of California, Berkeley

Oded Goldreich Weizmann Institute of Science

Sanjeev Khanna University of Pennsylvania

Eli Ben-Sasson Technion – Israel Institute of Technology

Luca Trevisan Bocconi University

Ronitt Rubinfeld MIT

Salil P. Vadhan Harvard University

Rajeev Motwani Stanford University

Johan Håstad Royal Institute of Technology

Prabhakar Raghavan Google (United States)

External Links

Wikipedia of Madhu Sudan Personal website of Madhu Sudan Google Scholar page

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

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.