DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Sanjeev Arora
Sanjeev Arora
The Multiplicative Weights Update Method: a Meta Algorithm and Applications
Issue 07
January 2011 Prizes and Awards
On Differentially Private Graph Sparsification and Applications
Proof Verification and Hardness of Approximation Problems
Martin Dyer, Mark Jerrum, Marek Karpinski (Editors): Design And
Quantum Proof Systems for Iterated Exponential Time, and Beyond∗
Some Estimated Likelihoods for Computational Complexity
EATCS General Assembly 2013
SIGACT Viability
ERIC W. ALLENDER Department of Computer Science
On the Work of Madhu Sudan Von Avi Wigderson
Front Matter
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes ?
Rajeev Motwani
SANJEEV ARORA Curriculum Vitae, November 2010. Born in January
Lecture Notes on Computational Complexity
Probabilistic Checking of Proofs and Hardness of Approximation Problems
Top View
Probabilistic Checking of Proofs: a New Characterization of NP
Novel Frameworks for Mining Heterogeneous and Dynamic
Probabilistically Checkable Proofs and Hardness of Approximation
On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner 107
Mathematics and Computation
References for the “Algorithmic High Dimensional Geometry” Lectures at the Big Data Boot Camp, Simons Institute, Berkeley
Lec. 7: Low Degree Testing (Part I) Lecturer: Prahladh Harsha Scribe: Nutan Limaye
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
Approximation Schemes for NP-Hard Geometric Optimization Problems: a Survey
Proof Verification and the Hardness of Approximation Problems
Moses Charikar
Towards a Study of Low-Complexity Graphs*
Curriculum Vitae
IAS Annual Report 2019-20
PCP Theorem, Hardness of Approximation, And
John Von Neumann
To Tackle Profound Questions in Computer Science 20 August 2008