| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alan Guo, Madhu Sudan |
Some closure features of locally testable affine-invariant properties.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan |
Sparse affine-invariant linear codes are locally testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Madhu Sudan, Noga Zewi |
A new upper bound on the query complexity for testing generalized Reed-Muller codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Brendan Juba, Madhu Sudan |
A theory of goal-oriented communication. |
J. ACM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Ron-Zewi, Madhu Sudan |
A new upper bound on the query complexity for testing generalized Reed-Muller codes |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
On Sums of Locally Testable Affine Invariant Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Madhu Sudan |
Testing Linear Properties: Some general themes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elad Haramaty, Amir Shpilka, Madhu Sudan |
Optimal testing of multivariate polynomials over small prime fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan |
Derandomization of auctions. |
Games and Economic Behavior |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie |
Testing Linear-Invariant Non-Linear Properties. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhu Sudan |
Patterns hidden from simple algorithms: technical perspective. |
Commun. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Madhu Sudan |
Delays and the Capacity of Continuous-time Channels |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Madhu Sudan |
Guest column: testing linear properties: some general theme. |
SIGACT News |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Madhu Sudan, Luca Trevisan |
From Logarithmic Advice to Single-Bit Advice. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Brendan Juba, Madhu Sudan |
A theory of goal-oriented communication. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
On Sums of Locally Testable Affine Invariant Properties. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Limits on the Rate of Locally Testable Affine-Invariant Codes. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Juba, Adam Tauman Kalai, Sanjeev Khanna, Madhu Sudan |
Compression without a common prior: an information-theoretic justification for ambiguity in language. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Victor Chen, Madhu Sudan, Ning Xie |
Property Testing via Set-Theoretic Operations. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Brendan Juba, Madhu Sudan |
Efficient Semantic Communication via Compatible Beliefs. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Khanna, Madhu Sudan |
Delays and the Capacity of Continuous-Time Channels. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Haramaty, Amir Shpilka, Madhu Sudan |
Optimal Testing of Multivariate Polynomials over Small Prime Fields. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
Symmetric LDPC Codes are not Necessarily Locally Testable. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhu Sudan |
Physical limits of Communication (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
Symmetric LDPC codes are not necessarily locally testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Limits on the rate of locally testable affine-invariant codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Victor Chen, Madhu Sudan, Ning Xie |
Property Testing via Set-Theoretic Operations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Madhu Sudan |
Invariance in Property Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie |
Testing linear-invariant non-linear properties: A short report. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Brendan Juba, Madhu Sudan |
Efficient Semantic Communication via Compatible Beliefs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Victor Chen, Madhu Sudan, Ning Xie |
Property Testing via Set-Theoretic Operations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson |
Optimal Error Correction for Computationally Bounded Noise. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhu Sudan |
Invariance in Property Testing. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie |
Testing Linear-Invariant Non-linear Properties: A Short Report. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kalai, Michael Mitzenmacher, Madhu Sudan |
Tight asymptotic bounds for the deletion channel with small deletion probabilities. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
Succinct Representation of Codes with Applications to Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal testing of Reed-Muller codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Brendan Juba, Madhu Sudan |
A Theory of Goal-Oriented Communication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Madhu Sudan |
Probabilistically checkable proofs. |
Commun. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman |
Optimal Testing of Reed-Muller Codes |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
Succinct Representation of Codes with Applications to Testing |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie |
Testing Linear-Invariant Non-Linear Properties. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
Succinct Representation of Codes with Applications to Testing. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
affine/cyclic invariance, single orbit, Locally testable codes |
| 1 | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Polynomial method, Randomness, Extractors |
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
2-Transitivity is Insufficient for Local Testability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Brendan Juba, Madhu Sudan |
Universal Semantic Communication II: A Theory of Goal-Oriented Communication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie |
Testing Linear-Invariant Non-Linear Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Decodability of Group Homomorphisms beyond the Johnson Bound. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Short PCPs with Polylog Query Complexity. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhu Sudan |
Algebraic algorithms and coding theory. |
ISSAC |
2008 |
DBLP DOI BibTeX RDF |
algebraic algorithms, error correcting codes |
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
2-Transitivity Is Insufficient for Local Testability. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
error correcting codes, property testing, sublinear time algorithms |
| 1 | Brendan Juba, Madhu Sudan |
Universal semantic communication I. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
computational complexity, interaction, linguistics |
| 1 | Tali Kaufman, Madhu Sudan |
Algebraic property testing: the role of invariance. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
error-correcting codes, locally testable codes, sublinear time algorithms |
| 1 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Decodability of group homomorphisms beyond the johnson bound. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
hadamard codes, list decoding, sublinear time algorithms |
| 1 | Brendan Juba, Madhu Sudan |
Universal Semantic Communication I. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Madhu Sudan |
Algebraic Property Testing: The Role of Invariance. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Madhu Sudan |
Sparse Random Linear Codes are Locally Decodable and Testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan |
Guessing secrets efficiently via list decoding. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
?-biased spaces, 20 questions, k-universal sets, error-correcting codes, decoding algorithms |
| 1 | Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee |
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
hash functions, combiners, collision resistance, hardness amplification |
| 1 | Tali Kaufman, Madhu Sudan |
Sparse Random Linear Codes are Locally Decodable and Testable. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Madhu Sudan, Avi Wigderson |
Robust Local Testability of Tensor Products of LDPC Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lars Engebretsen, Madhu Sudan |
Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust locally testable codes and products of codes. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Madhu Sudan |
Locally testable codes and PCPs of almost-linear length. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, derandomization, probabilistically checkable proofs, Proof verification |
| 1 | Oded Goldreich, Madhu Sudan |
Special Issue on Randomness and Complexity. |
SIAM J. Comput. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ari Juels, Madhu Sudan |
A Fuzzy Vault Scheme. |
Des. Codes Cryptography |
2006 |
DBLP DOI BibTeX RDF |
error-correting codes, authentication, cryptography |
| 1 | Madhu Sudan |
Modelling Errors and Recovery for Communication. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Local Decoding and Testing for Homomorphisms. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Madhu Sudan, Avi Wigderson |
Robust Local Testability of Tensor Products of LDPC Codes. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan |
Distributed Computing with Imperfect Randomness. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson |
Optimal Error Correction Against Computationally Bounded Noise. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Short PCPs Verifiable in Polylogarithmic Time. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Simple PCPs with poly-log rate and query complexity. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
PCPP, probabilistically checkable proofs, PCP, locally testable codes |
| 1 | Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan |
Derandomization of auctions. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
auctions, mechanism design, derandomization |
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust Locally Testable Codes and Products of Codes |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Simple PCPs with Poly-log Rate and Query Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Madhu Sudan, Luca Trevisan |
From logarithmic advice to single-bit advice |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust Locally Testable Codes and Products of Codes |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust Locally Testable Codes and Products of Codes. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust pcps of proximity, shorter pcps and applications to coding. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, PCP, locally decodable codes, locally testable codes |
| 1 | Eli Ben-Sasson, Oded Goldreich, Madhu Sudan |
Bounds on 2-Query Codeword Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Arora, Madhu Sudan |
Improved Low-Degree Testing and its Applications. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 68Q10, 68Q17 |
| 1 | Ilya Dumer, Daniele Micciancio, Madhu Sudan |
Hardness of approximating the minimum distance of a linear code. |
IEEE Transactions on Information Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Madhu Sudan |
Bounds on 2-Query Codeword Testing. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing |
| 1 | Don Coppersmith, Madhu Sudan |
Reconstructing curves in three (and higher) dimensional space from noisy data. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
algebraic codes, maximum distance separable codes, error-correction, decoding algorithm, random errors |
| 1 | Oded Goldreich, Madhu Sudan |
Locally Testable Codes and PCPs of Almost-Linear Length |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ari Juels, Madhu Sudan |
A Fuzzy Vault Scheme. |
IACR Cryptology ePrint Archive |
2002 |
DBLP BibTeX RDF |
|
| 1 | Madhu Sudan |
Foreword. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Madhu Sudan |
Hardness of Approximate Hypergraph Coloring. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Madhu Sudan, David Zuckerman |
Combinatorial bounds for list decoding. |
IEEE Transactions on Information Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Engebretsen, Madhu Sudan |
Harmonic broadcasting is optimal. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")