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
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 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.
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.
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.
Proof verification and the hardness of approximation problems.
Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan.
Electronic Colloquium on Computational Complexity (1998)
Private information retrieval
B. Chor;O. Goldreich;E. Kushilevitz;M. Sudan.
foundations of computer science (1995)
Private information retrieval
Benny Chor;Eyal Kushilevitz;Oded Goldreich;Madhu Sudan.
Journal of the ACM (1998)
A Fuzzy Vault Scheme
Ari Juels;Madhu Sudan.
Designs, Codes and Cryptography (2006)
Improved decoding of Reed-Solomon and algebraic-geometry codes
V. Guruswami;M. Sudan.
IEEE Transactions on Information Theory (1999)
Improved decoding of Reed-Solomon and algebraic-geometric codes.
Venkatesan Guruswami;Madhu Sudan.
Electronic Colloquium on Computational Complexity (1998)
Priority encoding transmission
A. Albanese;J. Blomer;J. Edmonds;M. Luby.
IEEE Transactions on Information Theory (1996)
Proof verification and hardness of approximation problems
S. Arora;C. Lund;R. Motwani;M. Sudan.
foundations of computer science (1992)
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Madhu Sudan.
Journal of Complexity (1997)
Robust Characterizations of Polynomials withApplications to Program Testing
Ronitt Rubinfeld;Madhu Sudan.
SIAM Journal on Computing (1996)
If you think any of the details on this page are incorrect, let us know.
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:
University of California, Berkeley
Weizmann Institute of Science
University of Pennsylvania
Technion – Israel Institute of Technology
Bocconi University
MIT
Harvard University
Stanford University
Google (United States)
Royal Institute of Technology
Technion – Israel Institute of Technology
University of Florida
University of Valencia
Tohoku University
Stanford University
Maine Medical Center
University of California, San Francisco
MIT
Åbo Akademi University
University of Liverpool
McGill University
University of Manchester
University of Melbourne
University College London
University College London
Virginia Tech