- Decodability of Group Homomorphisms beyond the Johnson Bound
- Simple PCPs with Poly-log Rate and Query Complexity Eli Ben-Sasson
- Derandomization of Auctions Gagan Aggarwal
- Locally Testable Codes and PCPs of Almost-Linear Length ODED GOLDREICH
- On Syntactic versus Computational Views of Approximability SANJEEV KHANNA RAJEEV MOTWANI MADHU SUDANy UMESH VAZIRANIz
- EXTENSIONS TO THE METHOD OF MULTIPLICITIES, WITH APPLICATIONS TO KAKEYA SETS AND MERGERS
- 2-Transitivity is Insufficient for Local Testability Elena Grigorescu
- Adversarial Queueing Theory Allan Borodin
- Efficient Semantic Communication via Compatible Brendan Juba1
- Improved low-degree testing and its applications Sanjeev Arora
- Harmonic Broadcasting Is Optimal Lars Engebretsen
- Reconstructing Algebraic Functions from Mixed Data Sigal Ar Richard J. Liptony Ronitt Rubinfeldz Madhu Sudanx
- Combinatorial Bounds for List Decoding Venkatesan Guruswami
- Algebraic Property Testing: The Role of Invariance
- Hardness of Approximating the Minimum Distance of a Linear Code Daniele Micciancio
- On Dinur's Proof of the PCP Theorem Jaikumar Radhakrishnan
- SIAM J. COMPUT. c 2008 Society for Industrial and Applied Mathematics Vol. 38, No. 2, pp. 551607
- Sparse Random Linear Codes are Locally Decodable and Testable Tali Kaufman
- A GEOMETRIC APPROACH TO BETWEENNESS BENNY CHORy AND MADHU SUDANz
- Delays and the Capacity of Continuous-time Channels Sanjeev Khanna
- Testing Linear Properties: Some general themes Madhu Sudan
- Compression without a common prior: an information-theoretic justification for ambiguity in
- Symmetric LDPC codes are not necessarily locally testable Eli Ben-Sasson
- Property Testing via Set-Theoretic Operations Victor Chen
- Efficient Semantic Communication via Compatible Beliefs Brendan Juba
- The P vs. NP problem Madhu Sudan
- Optimal testing of Reed-Muller codes Arnab Bhattacharyya
- A Theory of Goal-Oriented Communication Oded Goldreich Brendan Juba Madhu Sudan
- Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Zeev Dvir Swastik Kopparty Shubhangi Saraf Madhu Sudan
- Locally Testable Codes Require Redundant Eli Ben-Sasson
- Probabilistically checkable proofs Madhu Sudan
- Testing Linear-Invariant Non-Linear Properties Arnab Bhattacharyya
- Universal Semantic Communication II: A Theory of Goal-Oriented Communication
- Improved lower bound on the size of Kakeya sets over finite fields Shubhangi Saraf
- Princeton Companion to Mathematics Proof 1 Reliable Transmission of
- Algebraic Property Testing: The Role of Invariance
- Universal Semantic Communication I Brendan Juba
- Towards Universal Semantic Communication (Version 0 -Very Preliminary)
- Probabilistically Checkable Proofs: A Primer Madhu Sudan
- TBD manuscript No. (will be inserted by the editor)
- Short PCPs Verifiable in Polylogarithmic Time Eli Ben-Sasson
- Optimal Error Correction for Computationally Bounded Noise
- Robust Locally Testable Codes and Products of Codes Eli Ben-Sasson
- Robust Locally Testable Codes and Products of Eli Ben-Sasson1
- Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
- Randomness-efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets
- Reconstructing Curves in Three (and Higher) Dimensional Space from Noisy Data
- Locally Testable Codes and PCPs of Almost-Linear Length Oded Goldreich
- A Fuzzy Vault Scheme and Madhu Sudan2
- SIGACT News Complexity Theory Column 34 Lane A. Hemaspaandra
- SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan
- The Approximability of Constraint Satisfaction Sanjeev Khannay Madhu Sudanz Luca Trevisanx David P. Williamson{
- Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami
- GURUSWAMI, H ASTAD, SUDAN, AND ZUCKERMAN 1 Combinatorial Bounds for List Decoding
- Random Walks with "Back Buttons" Ronald Fagin
- Hardness of Approximating the Minimum Distance of a Linear Code
- Linear Consistency Testing Yonatan Aumann
- Chinese Remaindering with Errors Oded Goldreich
- Pseudorandom generators without the XOR Lemma Madhu Sudan
- Pseudorandom generators without the XOR Lemma [Extended Abstract]
- Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes Venkatesan Guruswami Madhu Sudan
- Computational Indistinguishability: A Sample Hierarchy Oded Goldreich
- Constraint Satisfaction: The Approximability of Minimization Problems
- Maximum Likelihood Decoding of Reed Solomon Codes Madhu Sudan
- Private Information Retrieval Oded Goldreich
- Private Information Retrieval Benny Chor. Oded Goldreichy. Eyal Kushilevitzz. Madhu Sudanx.
- LEARNING POLYNOMIALS WITH QUERIES: THE HIGHLY NOISY CASE
- FREE BITS, PCPS AND NON-APPROXIMABILITY TOWARDS TIGHT RESULTS
- Some Improvements to Total Degree Tests KATALIN FRIEDL
- Motion Planning on a Graph (Extended Abstract)
- Priority Encoding Transmission Andres Albanese Johannes Blomery Je Edmondsz Michael Lubyx
- On Syntactic versus Computational Views of Approximability SANJEEV KHANNA
- Proof Verification and Hardness of Approximation Problems Sanjeev Arora
- Self-Testing/Correcting for Polynomials and for Approximate Functions Peter Gemmell Richard Lipton y Ronitt Rubinfeld z
- Online Algorithms for Locating Checkpoints Marshall Bern
- Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami
- Probabilistically Checkable Proofs with Low Amortized Query Complexity Madhu Sudan Luca Trevisany
- Limits on the rate of locally testable affine-invariant codes Eli Ben-Sasson
- On Representations of Algebraic-Geometric Codes for List Decoding
- Appears in Proceedings of STOC 94. Motion Planning on a Graph
- Universal Semantic Communication I Brendan Juba
- Learning polynomials with queries: The highly noisy case ODED GOLDREICH RONITT RUBINFELDy MADHU SUDANz
- Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes
- Bounds on 2-Query Codeword Testing Eli Ben-Sasson1
- Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
- The Minimum Latency Problem Avrim Blum
- Small PCPs with Low Query Complexity Prahladh Harsha and Madhu Sudan
- Highly resilient correctors for polynomials Peter Gemmell
- Chinese Remaindering with Errors Oded Goldreichy Dana Ronz Madhu Sudanx
- Optimal Testing of Reed-Muller Codes Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
- Guessing Secrets Efficiently via List Decoding Venkatesan Guruswami
- List decoding: algorithms and applications Madhu Sudan
- Succinct Representation of Codes with Applications to Testing
- Decoding of Reed Solomon codes beyond the error-correction bound
- Distributed Computing with Imperfect Shafi Goldwasser , Madhu Sudan, and Vinod Vaikuntanathan
- Self-Testing Polynomial Functions Efficiently and over Rational Domains Ronitt Rubinfeld Madhu Sudan
- On Representations of Algebraic-Geometric Codes Venkatesan Guruswami Madhu Sudan
- Online Algorithms for Locating Checkpoints Marshall Bern
- Decodability of Group Homomorphisms beyond the Johnson Bound
- SIGACT News Complexity Theory Column 25 Lane A. Hemaspaandra
- Harmonic Broadcasting Is Bandwidth-Optimal Assuming Constant Bit Rate
- Random Walks with "Back Buttons" (Extended Abstract)
- Improved low-degree testing and its applications Sanjeev Arora
- E cient Routing and Scheduling Algorithms for Optical Networks
- A Geometric Approach to Betweenness ? Benny Chor?? and Madhu Sudan???
- Sparse Random Linear Codes are Locally Decodable and Testable Tali Kaufman
- Tight Asymptotic Bounds for the Deletion Channel with Small Deletion Probabilities
- Doc. Math. J. DMV 1 Probabilistic Verification of Proofs
- Property Testing via Set-Theoretic Operations Victor Chen1
- Connectivity Properties of Matroids Milena Mihail
- From logarithmic advice to single-bit advice Oded Goldreich
- Locally Testable Codes Require Redundant Testers Eli Ben-Sasson
- List Decoding Algorithms for certain Concatenated Codes Venkatesan Guruswami Madhu Sudan
- Approximate Graph Coloring by Semidefinite Programming DAVID KARGER
- Improved Non-Approximability Results Mihir Bellare
- Proof Verification and the Hardness of Approximation Problems
- RECONSTRUCTING ALGEBRAIC FUNCTIONS FROM MIXED DATA
- 2-Transitivity is Insufficient for Local Testability Elena Grigorescu
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- A statistical perspective on data mining Jonathan Hosking, Edwin Pednault and Madhu Sudan
- Approximate Graph Coloring by Semide nite Programming David Karger Rajeev Motwani y Madhu Sudan z
- Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
- Decoding Concatenated Codes using Soft Information Venkatesan Guruswami
- Coding Theory: Tutorial & Survey Madhu Sudan
- List Decoding Algorithms for Certain Concatenated Codes Venkatesan Guruswami
- "Soft-decision" Decoding of Chinese Remainder Codes Venkatesan Guruswami
- Derandomization of Auctions Gagan Aggarwal
- Testing linear-invariant non-linear properties: A short report
- Optimal Error Correction Against Computationally Bounded Noise
- Motion Planning on a Graph Christos H. Papadimitriou
- Linear Consistency Testing Yonatan Aumann , Johan Hastad , Michael O. Rabin , and Madhu Sudan
- Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs
- Reflections on "Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes"
- Free Bits and Non-Approximability (Extended Abstract)
- Short PCPs Verifiable in Polylogarithmic Time Eli Ben-Sasson
- Patterns hidden from simple algorithms Madhu Sudan
- IAS/Park City Mathematics Series Volume 00, 0000
- The Optimization Complexity of Constraint Satisfaction Problems Sanjeev Khanna Madhu Sudany
- A tight characterization of NP with 3 query PCPs Venkatesan Guruswami
- Succinct Representation of Codes with Applications to Testing Elena Grigorescu
- Talk given at workshop on Algebraic Methods in Complexity Theory On the role of algebra in the efficient verification of proofs
- Linearity Testing in Characteristic Two M. BELLARE D. COPPERSMITH y
- Local Decoding and Testing for Homomorphisms
- Ideal Error-correcting codes: Unifying Algebraic and Number-theoretic Algorithms
- Symmetric LDPC codes are not necessarily locally Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, and Madhu Sudan
- Optimal testing of multivariate polynomials over small prime fields Elad Haramaty
- Physical limits of Communication Madhu Sudan1
- Limits on the rate of locally testable affine-invariant codes
- Limits on the rate of locally testable affine-invariant codes Eli Ben-Sasson
- Delays and the Capacity of Continuous-time Channels Sanjeev Khanna
- On Sums of Locally Testable Affine Invariant Eli Ben-Sasson