The following pages link to Madhu Sudan (Q6480588):
Displaying 1 item.
- (Q202085) (redirect page) (← links)
- Kakeya-type sets in finite vector spaces (Q644691) (← links)
- Queuing with future information (Q744387) (← links)
- An improved lower bound on the size of Kakeya sets over finite fields (Q841571) (← links)
- Probabilistic verification of proofs (Q1126840) (← links)
- Highly resilient correctors for polynomials (Q1199875) (← links)
- On-line algorithms for locating checkpoints (Q1312186) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- (Q1386375) (redirect page) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Communication with contextual uncertainty (Q1616619) (← links)
- Random walks with ``back buttons'' (Q1872455) (← links)
- Efficient checking of polynomials and proofs and the hardness of approximation problems (Q1906841) (← links)
- 2-transitivity is insufficient for local testability (Q1947041) (← links)
- Computational indistinguishability: A sample hierarchy (Q1961376) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- A fuzzy vault scheme (Q2491270) (← links)
- Improved low-degree testing and its applications (Q2494418) (← links)
- The Approximability of Constraint Satisfaction Problems (Q2706139) (← links)
- Learning Polynomials with Queries: The Highly Noisy Case (Q2706184) (← links)
- Complexity Classifications of Boolean Constraint Satisfaction Problems (Q2723175) (← links)
- (Q2753940) (← links)
- (Q2762515) (← links)
- The minimum latency problem (Q2817608) (← links)
- Improved non-approximability results (Q2817610) (← links)
- Chinese remaindering with errors (Q2819549) (← links)
- Pseudorandom generators without the XOR Lemma (extended abstract) (Q2819586) (← links)
- Optimal Testing of Multivariate Polynomials over Small Prime Fields (Q2840981) (← links)
- Absolutely Sound Testing of Lifted Codes (Q2851893) (← links)
- (Q2941633) (← links)
- Adversarial queuing theory (Q2947002) (← links)
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem (Q2968165) (← links)
- List decoding group homomorphisms between supersolvable groups (Q2969659) (← links)
- New affine-invariant codes from lifting (Q2986899) (← links)
- Communication with Imperfectly Shared Randomness (Q2989037) (← links)
- (Q3002831) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- From Logarithmic Advice to Single-Bit Advice (Q3088181) (← links)
- Quick and Dirty Refereeing? (Q3101374) (← links)
- (Q3128902) (← links)
- Priority encoding transmission (Q3129461) (← links)
- Linearity testing in characteristic two (Q3129465) (← links)
- Hardness of Approximate Hypergraph Coloring (Q3149889) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- Private information retrieval (Q3158526) (← links)
- A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes (Q3167433) (← links)
- (Q3191595) (← links)
- List decoding algorithms for certain concatenated codes (Q3191984) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Locally testable codes and PCPs of almost-linear length (Q3546312) (← links)
- (Q3549692) (← links)
- (Q3549711) (← links)
- (Q3549724) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (Q3581280) (← links)
- Reconstructing curves in three (and higher) dimensional space from noisy data (Q3581291) (← links)
- Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
- Local Decoding and Testing for Homomorphisms (Q3595384) (← links)
- Robust Local Testability of Tensor Products of LDPC Codes (Q3595411) (← links)
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment (Q3612554) (← links)
- Short PCPs with Polylog Query Complexity (Q3624377) (← links)
- Succinct Representation of Codes with Applications to Testing (Q3638901) (← links)
- Approximate graph coloring by semidefinite programming (Q3841651) (← links)
- Guaranteeing Fair Service to Persistent Dependent Tasks (Q4210089) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- A Geometric Approach to Betweenness (Q4210221) (← links)
- (Q4228491) (← links)
- (Q4230322) (← links)
- (Q4230375) (← links)
- (Q4231909) (← links)
- (Q4252714) (← links)
- (Q4252727) (← links)
- (Q4252728) (← links)
- (Q4258568) (← links)
- (Q4370031) (← links)
- Efficient routing in optical networks (Q4371693) (← links)
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results (Q4388899) (← links)
- (Q4474234) (← links)
- Chinese remaindering with errors (Q4501745) (← links)
- Improved decoding of Reed-Solomon and algebraic-geometry codes (Q4503371) (← links)
- Gadgets, Approximation, and Linear Programming (Q4507337) (← links)
- (Q4526965) (← links)
- (Q4527016) (← links)
- (Q4536409) (← links)
- On representations of algebraic-geometry codes (Q4544598) (← links)
- Communication With Imperfectly Shared Randomness (Q4566528) (← links)
- Communication Complexity of Permutation-Invariant Functions (Q4575718) (← links)
- (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space (Q4575855) (← links)
- (Q4638068) (← links)
- (Q4650575) (← links)
- Combinatorial bounds for list decoding (Q4674491) (← links)
- Hardness of approximating the minimum distance of a linear code (Q4679877) (← links)
- (Q4763385) (← links)
- (Q4828940) (← links)
- (Q4828964) (← links)
- Robust Characterizations of Polynomials with Applications to Program Testing (Q4877517) (← links)
- (Q4886054) (← links)
- Succinct Representation of Codes with Applications to Testing (Q4915191) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Testing Linear-Invariant Non-linear Properties: A Short Report (Q4933376) (← links)
- Optimal Testing of Reed-Muller Codes (Q4933377) (← links)
- (Q4941830) (← links)
- Guessing secrets efficiently via list decoding (Q4962681) (← links)
- (Q4993289) (← links)
- (Q5002755) (← links)
- (Q5009529) (← links)
- General Strong Polarization (Q5066948) (← links)
- (Q5090416) (← links)
- Approximating minimum feedback sets and multi-cuts in directed graphs (Q5101402) (← links)
- The Power of Shared Randomness in Uncertain Communication (Q5111380) (← links)
- Local decoding and testing of polynomials over grids (Q5136928) (← links)
- Optimality of Correlated Sampling Strategies (Q5140847) (← links)
- Round Complexity of Common Randomness Generation: The Amortized Setting (Q5146837) (← links)
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers (Q5171174) (← links)
- Communication for Generating Correlation: A Unifying Survey (Q5211580) (← links)
- Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation (Q5236296) (← links)
- Optimal error rates for interactive coding I (Q5259615) (← links)
- Optimal Error Correction for Computationally Bounded Noise (Q5281219) (← links)
- Algebraic algorithms and coding theory (Q5301642) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313032) (← links)
- Limitations on Testable Affine-Invariant Codes in the High-Rate Regime (Q5363048) (← links)
- Streaming Lower Bounds for Approximating MAX-CUT (Q5363106) (← links)
- Approximating matching size from random streams (Q5384016) (← links)
- Testing Linear-Invariant Non-Linear Properties (Q5389972) (← links)
- Locally Testable Codes Require Redundant Testers (Q5390594) (← links)
- Distributed Computing (Q5395155) (← links)
- A theory of goal-oriented communication (Q5395680) (← links)
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers (Q5408768) (← links)
- Harmonic broadcasting is bandwidth-optimal assuming constant bit rate (Q5471087) (← links)
- Robust locally testable codes and products of codes (Q5486320) (← links)
- Optimal Testing of Multivariate Polynomials over Small Prime Fields (Q5494991) (← links)
- Delays and the Capacity of Continuous-Time Channels (Q5495040) (← links)
- Theory of Cryptography (Q5711641) (← links)
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455) (← links)
- Deterministic compression with uncertain priors (Q5891037) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- Deterministic compression with uncertain priors (Q5892455) (← links)
- Derandomization of auctions (Q5892485) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900935) (← links)
- Derandomization of auctions (Q5901102) (← links)
- Limits of local algorithms over sparse random graphs (Q5920116) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Linear-consistency testing. (Q5946056) (← links)
- Small PCPs with low query complexity (Q5946703) (← links)
- Streaming approximation resistance of every ordering CSP (Q6070377) (← links)
- (Q6090914) (← links)
- Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance (Q6195705) (← links)
- Synchronization Strings: List Decoding for Insertions and Deletions (Q6298170) (← links)
- Algorithmic Polarization for Hidden Markov Models (Q6307661) (← links)
- Polar Codes with exponentially small error at finite block length (Q6307975) (← links)
