H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 60 Citations 22,702 153 World Ranking 1516 National Ranking 844
Mathematics H-index 63 Citations 24,085 150 World Ranking 204 National Ranking 108

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Algebra
  • Combinatorics

Madhu Sudan mainly focuses on Combinatorics, Discrete mathematics, PCP theorem, Approximation algorithm and Polynomial. His Combinatorics research is multidisciplinary, incorporating perspectives in Computational complexity theory and Linear code. His Discrete mathematics study frequently links to related topics such as Function.

His work carried out in the field of PCP theorem brings together such families of science as Locally decodable code, Property testing and Coding. Madhu Sudan interconnects Asymptotic computational complexity, Travelling salesman problem, Distance matrix, Linear programming and Scheduling in the investigation of issues within Approximation algorithm. The study incorporates disciplines such as Fraction, Error detection and correction and Coding theory in addition to Polynomial.

His most cited work include:

  • Private information retrieval (1387 citations)
  • Proof verification and the hardness of approximation problems (1121 citations)
  • Private information retrieval (949 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Discrete mathematics, Combinatorics, Polynomial, Theoretical computer science and Function. Madhu Sudan works mostly in the field of Discrete mathematics, limiting it down to topics relating to Upper and lower bounds and, in certain cases, Communication complexity, as a part of the same area of interest. His Combinatorics study integrates concerns from other disciplines, such as Randomness, Code word and Linear code.

His work deals with themes such as Hamming code and Concatenated error correction code, which intersect with Linear code. His biological study spans a wide range of topics, including Randomized algorithm and Constant. His Function research is multidisciplinary, incorporating elements of Simple, Bounded function and Boolean function.

He most often published in these fields:

  • Discrete mathematics (51.69%)
  • Combinatorics (41.81%)
  • Polynomial (14.41%)

What were the highlights of his more recent work (between 2014-2021)?

  • Discrete mathematics (51.69%)
  • Combinatorics (41.81%)
  • Randomness (11.02%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Discrete mathematics, Combinatorics, Randomness, Communication complexity and Polynomial. Madhu Sudan applies his multidisciplinary studies on Discrete mathematics and Alice and Bob in his research. Madhu Sudan studies Binary logarithm which is a part of Combinatorics.

His Randomness research incorporates elements of Probability distribution, Theoretical computer science, Information theory, Graph theory and Algorithm. His study explores the link between Communication complexity and topics such as Upper and lower bounds that cross with problems in Johnson bound, Multiplicity, Rational function and Cartesian product. His Polynomial research incorporates themes from Field, Decoding methods and Code.

Between 2014 and 2021, his most popular works were:

  • Streaming lower bounds for approximating MAX-CUT (30 citations)
  • Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time (18 citations)
  • General strong polarization (17 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Algebra
  • Programming language

Madhu Sudan focuses on Combinatorics, Discrete mathematics, Randomness, Communication complexity and Theoretical computer science. The Combinatorics study combines topics in areas such as Element, Polynomial and Rounding. Madhu Sudan is interested in Bipartite graph, which is a field of Discrete mathematics.

His Randomness research includes themes of Probability distribution, Total variation, Approximation algorithm, Finite set and Sampling. His research integrates issues of Communication source, Upper and lower bounds, Prior probability and Distribution in his study of Communication complexity. He combines subjects such as Reed–Muller code, Expander code, Information theory, Entropy and Polynomial code with his study of Theoretical computer science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Proof verification and the hardness of approximation problems

Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan.
Journal of the ACM (1998)

2729 Citations

Private information retrieval

B. Chor;O. Goldreich;E. Kushilevitz;M. Sudan.
foundations of computer science (1995)

2494 Citations

Private information retrieval

Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan.
Journal of the ACM (1998)

2040 Citations

Improved decoding of Reed-Solomon and algebraic-geometry codes

V. Guruswami;M. Sudan.
IEEE Transactions on Information Theory (1999)

1495 Citations

Improved decoding of Reed-Solomon and algebraic-geometric codes

Venkatesan Guruswami;Madhu Sudan.
foundations of computer science (1998)

1441 Citations

A fuzzy vault scheme

Ari Juels;Madhu Sudan.
international symposium on information theory (2002)

1193 Citations

Proof verification and hardness of approximation problems

S. Arora;C. Lund;R. Motwani;M. Sudan.
foundations of computer science (1992)

1026 Citations

Priority encoding transmission

A. Albanese;J. Blomer;J. Edmonds;M. Luby.
IEEE Transactions on Information Theory (1996)

959 Citations

Decoding of Reed Solomon Codes beyond the Error-Correction Bound

Madhu Sudan.
Journal of Complexity (1997)

902 Citations

Robust Characterizations of Polynomials withApplications to Program Testing

Ronitt Rubinfeld;Madhu Sudan.
SIAM Journal on Computing (1996)

893 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Madhu Sudan

Venkatesan Guruswami

Venkatesan Guruswami

Carnegie Mellon University

Publications: 155

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 91

Dana Ron

Dana Ron

Tel Aviv University

Publications: 75

Subhash Khot

Subhash Khot

New York University

Publications: 69

Noga Alon

Noga Alon

Tel Aviv University

Publications: 69

Yuval Ishai

Yuval Ishai

Technion – Israel Institute of Technology

Publications: 67

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 65

Luca Trevisan

Luca Trevisan

Bocconi University

Publications: 64

Ronitt Rubinfeld

Ronitt Rubinfeld

MIT

Publications: 52

Salil P. Vadhan

Salil P. Vadhan

Harvard University

Publications: 48

Avi Wigderson

Avi Wigderson

Institute for Advanced Study

Publications: 45

Johan Håstad

Johan Håstad

Royal Institute of Technology

Publications: 44

Uriel Feige

Uriel Feige

Weizmann Institute of Science

Publications: 43

Ryan O'Donnell

Ryan O'Donnell

Carnegie Mellon University

Publications: 43

Sennur Ulukus

Sennur Ulukus

University of Maryland, College Park

Publications: 43

Something went wrong. Please try again later.