Madhu Sudan
Top View
- About the Authors of LNCS Volume 6650
- Ronitt Rubinfeld
- Robust Pcps of Proximity and Shorter Pcps by Prahladh Harsha Bachelor of Technology (Computer Science and Engineering), Indian Institute of Technology, Madras, India
- Lec. 7: Low Degree Testing (Part I) Lecturer: Prahladh Harsha Scribe: Nutan Limaye
- Pseudorandom Generators Without the XOR Lemma
- G¨Odel Prize 2016
- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
- Fuzzy Message Detection
- Small Pcps with Low Query Complexity by Prahladh Harsha Bachelor of Technology (Computer Science and Engineering), Indian Institute of Technology, Madras, India
- 2017 Gödel Prize
- Efficient Indexing of Necklaces and Irreducible Polynomials Over Finite
- Introduction
- Secure Arithmetic Computation with No Honest Majority
- Scalable Algorithms for Data and Network Analysis
- Computational Complexity Conference
- On Locally Decodable Codes in Resource Bounded Channels
- Streaming Approximation Resistance of Every Ordering CSP
- Program of the Thirty-Second Annual ACM Symposium on Theory of Computing