# Irit Dinur

Professor

Sign in to view more

My research is in Foundations of Computer Science and in Combinatorics, especially Probabilistically Checkable Proofs, hardness of approximation, and most recently high dimensional expanders.

## Papers107 papers

Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests

Direct sum testing - the general case.

Agreement Testing Theorems on Layered Set Systems.

Agreement testing theorems on layered set systems.

Towards a Proof of the 2-to-1 Games Conjecture?

On Non-Optimally Expanding Sets in Grassmann Graphs.

ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network.

Every set in P is strongly testable under a suitable encoding.

Boolean function analysis on high-dimensional expanders.

Boolean functions on high-dimensional expanders.

Boolean Function Analysis on High-Dimensional Expanders.

List Decoding with Double Samplers.

From Local to Robust Testing via Agreement Testing.

Towards a Proof of the 2-to-1 Games Conjecture?

ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network

Multiplayer parallel repetition for expander games.

Cube vs. Cube Low Degree Test.

Exponentially Small Soundness for the Direct Product Z-test.

High dimensional expanders imply agreement expanders.

Agreement tests on graphs and hypergraphs.

Low degree almost Boolean functions are sparse juntas.

High dimensional expanders imply agreement expanders.

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity.

Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover.

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity.

The Computational Benefit of Correlated Instances

A parallel repetition theorem for entangled projection games.

Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition.

Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition

Analytical approach to parallel repetition

A parallel repetition theorem for entangled projection games

Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword.

Composition of Low-Error 2-Query PCPs Using Decodable PCPs

PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring

Clustering in the boolean hypercube in a list decoding regime

Dense locally testable codes cannot have constant rate and distance

PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability

Derandomized Parallel Repetition via Structured PCPs

Derandomized Parallel Repetition via Structured PCPs

On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors

The structure of winning strategies in parallel repetition games

Composition of Low-Error 2-Query PCPs Using Decodable PCPs

Derandomized Parallel Repetition of Structured PCPs

Dense Locally Testable Codes Cannot Have Constant Rate and Distance

Intersecting families are essentially contained in juntas

Conditional hardness for approximate coloring

**83**|EI|Bibtex

**1**|EI|Bibtex

Locally Testing Direct Product in the Low Error Range

Decodability of group homomorphisms beyond the johnson bound

Decodability of group homomorphisms beyond the johnson bound

On the Fourier tails of bounded functions over the discrete cube

Proof of an Intersection Theorem via Graph Homomorphisms

Robust Local Testability of Tensor Products of LDPC Codes

Conditional Hardness for Approximate Coloring

On the fourier tails of bounded functions over the discrete cube

Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem

Independent Sets in Graph Powers are Almost Contained in Juntas

Robust Local Testability of Tensor Products of LDPC Codes

On the hardness of approximating vertex cover

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Lack of aspirin effect: aspirin resistance or resistance to taking aspirin?

Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem

On the hardness of approximating label-cover

Graph Products, Fourier Analysis and Spectral Techniques

A new multilayered PCP and the hardness of hypergraph vertex cover

Revealing information while preserving privacy

Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

**138**|Bibtex

The Hardness of 3 - Uniform Hypergraph Coloring

Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon)

The Importance of Being Biased

Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard

Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard

On the hardness of approximating label-cover

PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability