Irit Dinur
![Hardness of Approximation, NP ⊆ PCP[Polylog,Polylog]](http://data.docslib.org/img/264x/42c871bd2e8bd039ad26347afec0431a.webp)
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∗