DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Madhu Sudan
Madhu Sudan
Four Results of Jon Kleinberg a Talk for St.Petersburg Mathematical Society
Prahladh Harsha
Some Hardness Escalation Results in Computational Complexity Theory Pritish Kamath
Pairwise Independence and Derandomization
David Karger Rajeev Motwani Y Madhu Sudan Z
Avi Wigderson
Lecture Notes in Computer Science 4833 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan Van Leeuwen
Pseudorandom Generators Without the XOR Lemma£
On the Work of Madhu Sudan Von Avi Wigderson
Evasiveness of Graph Properties and Topological Fixed-Point Theorems
Separating Local & Shuffled Differential Privacy Via Histograms
Point-Hyperplane Incidence Geometry and the Log-Rank Conjecture
Probabilistic Checking of Proofs and Hardness of Approximation Problems
Madhu Sudan Receives Nevanlinna Prize, Volume 49, Number 10
Pairwise Independence and Derandomization Full Text Available At
Sponsored by IEEE Computer Society Technical Committee On
STOC ’94 to Qualify for the Early Registration Fee, Your Registration Application Must Be Postmarked by Monday, April 25
Robust Locally Testable Codes and Products of Codes
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
Lecture Notes in Computer Science 1001 Edited by G
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems
John Von Neumann
CV of Prahladh Harsha
Multi-Party Quantum Computation Adam Smith