Madhu Sudan
机构: Gordon McKay Professor of Computer Science, Harvard University
主页: harvard.edu
每年引用次数
引用次数
引用: 29,131
H-指数: 70
I10-指数 : 154
出版物: 411
Limits on the Rate of Locally Testable Affine-Invariant Codes
Ben-Sasson Eli , Sudan Madhu
Lecture Notes in Computer Science 6845 412 -423
2011
Limitations of mean-based algorithms for trace reconstruction at small distance
Elena Grigorescu , Madhu Sudant , Minshen Zhu
2021 IEEE International Symposium on Information Theory (ISIT) 2531 -2536
13
2021
Their Applications to Program Testing
Ronitt Pubinfeld , MadhU SUdan
1993
On Representations of Algebraic-Geometric Codes
Venkatesan Guruswami Madhu Sudan
Universal Semantic Communication I.
Madhu Sudan , Brendan Juba
Electronic Colloquium on Computational Complexity 14
55
2007
A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction
Madhu Sudan , David P. Williamson , Sanjeev Khanna
Electronic Colloquium on Computational Complexity 3
2
1996
Robust Characterizations of Polynomials and Their Applications to Program Testing
Madhu Sudan , Ronitt Rubinfeld
Cornell University
20
1993
Compression without a common prior: An information-theoretic justification for ambiguity in language
Adam Tauman Kalai , Madhu Sudan , Brendan Andrew Juba , Sanjeev Khanna
international conference on supercomputing 79 -86
25
2011
Linear Consistency Testing
Madhu Sudan , Johan Håstad , Michael O. Rabin , Yonatan Aumann
randomization and approximation techniques in computer science 109 -120
4
1999
Succinct Representation of Codes with Applications to Testing
Madhu Sudan , Elena Grigorescu , Tali Kaufman-Halman
Joanne Hanley
3
2009
Harmonic broadcasting is bandwidth-optimal assuming constant bit rate
Madhu Sudan , Lars Engebretsen
Networks 47 ( 3) 172 -177
25
2006
Robust locally testable codes and products of codes
Eli Ben-Sasson , Madhu Sudan
Random Structures and Algorithms 28 ( 4) 387 -402
49
2006
Efficient Semantic Communication via Compatible Beliefs
Madhu Sudan , Brendan Andrew Juba
international conference on supercomputing 22 -31
12
2011
Robust Local Testability of Tensor Products of LDPC Codes.
Avi Wigderson , Madhu Sudan , Irit Dinur
Electronic Colloquium on Computational Complexity 13
2006
The P vs. NP problem
Madhu Sudan
5
2010
Patterns hidden from simple algorithms
Madhu Sudan
Sudan via Amy Stout
2011
Physical limits of Communication (Invited Talk).
Madhu Sudan
foundations of software technology and theoretical computer science 13 5
2011
Approximating matching size from random streams
Madhu Sudan , Sanjeev Khanna , Michael Kapralov
symposium on discrete algorithms 734 -751
108
2014
Small PCPs with low query complexity
Madhu Sudan , Prahladh Harsha
Electronic Colloquium on Computational Complexity 7
2000
Communication with Contextual Uncertainty.
Badih Ghazi , Ilan Komargodski , Pravesh K Kothari , Madhu Sudan
Electronic Colloquium on Computational Complexity 22 64
5
2015