DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Irit Dinur
Irit Dinur
Zig-Zag Product
Program
Calibrating Noise to Sensitivity in Private Data Analysis
A New Point of NP-Hardness for Unique Games
Call for Papers
Exponentially-Hard Gap-CSP and Local PRG Via Local Hardcore Functions
Revisiting Alphabet Reduction in Dinur's
László Lovász Avi Wigderson of Eötvös Loránd University of the Institute for Advanced Study, in Budapest, Hungary and Princeton, USA
Lecture 9: Dinur's Proof of the PCP Theorem 9.1 Hardness Of
The Gödel Prize 2020 - Call for Nominatonn
On Dinur's Proof of the PCP Theorem by Jaikumar
Hardness of Approximation, NP ⊆ PCP[Polylog,Polylog]
Probabilistically Checkable Proofs: a Primer
Dinur's Proof of the PCP Theorem
Composition of Low-Error 2-Query Pcps Using Decodable Pcps∗
Lipics-ITCS-2019-29.Pdf (0.5
High Dimensional Expanders Imply Agreement Expanders
Differentially Private Release and Learning of Threshold Functions
Top View
Agreement Tests on Graphs and Hypergraphs
List Decoding of Direct Sum Codes
REVISITING ALPHABET REDUCTION in DINUR's PCP 1. INTRODUCTION Constraint Satisfaction Problem
Lovász and Wigderson Awarded 2021 Abel Prize
On the Hardness of Approximating Minimum Vertex Cover
ETH-Hardness of Approximating 2-Csps and Directed Steiner Network∗
Program Committee 2018 János Kollár (Princeton University, USA)
On the Proof of the 2-To-2 Games Conjecture
On Dinur's Proof of the PCP Theorem
Lecture 25: Sketch of the PCP Theorem 1 Overview 2
Do Distributed Differentially-Private Protocols Require Oblivious
The Unique Games Conjecture and Some of Its Implications on Inapproximability
Differential Privacy and Noisy Confidentiality Concepts For
Low Degree Almost Boolean Functions Are Sparse Juntas
Locally Testable Codes Via High-Dimensional Expanders∗
Differential Privacy with Imperfect Randomness
Truthful Mechanisms for Agents That Value Privacy
Towards a Combinatorial Proof of the PCP-Theorem∗