Irit Dinur

发表

Boolean functions on high-dimensional expanders pdf

Yotam Dikstein, Irit Dinur, Yuval Filmus, 2018, ArXiv.

A parallel repetition theorem for entangled projection games

David Steurer, Irit Dinur, Thomas Vidick, 2013, computational complexity.

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

Pasin Manurangsi, Irit Dinur, Irit Dinur, 2018, ITCS.

The PCP theorem by gap amplification

Irit Dinur, Irit Dinur, 2006, STOC.

On the Fourier tails of bounded functions over the discrete cube

Ryan O'Donnell, Guy Kindler, Irit Dinur, 2006, STOC '06.

Testing tensor products pdf

Irit Dinur, Konstantin Golubev, 2019, ArXiv.

The Hardness of 3-Uniform Hypergraph Coloring

Irit Dinur, Oded Regev, Clifford D. Smyth, 2005, Comb..

On non-optimally expanding sets in Grassmann graphs

Guy Kindler, Subhash Khot, Irit Dinur, 2017, Electron. Colloquium Comput. Complex..

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

Irit Dinur, Prahladh Harsha, P. Harsha, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

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

Venkatesan Guruswami, Subhash Khot, Irit Dinur, 2002, Electron. Colloquium Comput. Complex..

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

Irit Dinur, 2000, CIAC.

Towards a proof of the 2-to-1 games conjecture?

Guy Kindler, Subhash Khot, Irit Dinur, 2018, Electron. Colloquium Comput. Complex..

List Decoding with Double Samplers

Amnon Ta-Shma, Irit Dinur, Tali Kaufman, 2018, Electron. Colloquium Comput. Complex..

Assignment testers: towards a combinatorial proof of the PCP-theorem

Omer Reingold, Irit Dinur, O. Reingold, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

The Computational Benefit of Correlated Instances

Shafi Goldwasser, Irit Dinur, Huijia Lin, 2015, ITCS.

Explicit SoS lower bounds from high-dimensional expanders pdf

Madhur Tulsiani, Irit Dinur, Yuval Filmus, 2020, ITCS.

Proceedings of the Annual IEEE Conference on Computational Complexity: Preface

Peter Bro Miltersen, Ronitt Rubinfeld, Luca Trevisan, 2005 .

Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition

Guy Kindler, Irit Dinur, Prahladh Harsha, 2015, STOC.

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

Irit Dinur, Prahladh Harsha, 2010, Property Testing.

Every set in P is strongly testable under a suitable encoding

Oded Goldreich, Irit Dinur, Tom Gur, 2018, Electron. Colloquium Comput. Complex..

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings

Klaus Jansen, José D. P. Rolim, Irit Dinur, 2009, APPROX-RANDOM.

Locally testable codes via high-dimensional expanders pdf

Yotam Dikstein, Irit Dinur, Prahladh Harsha, 2020, Electron. Colloquium Comput. Complex..

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

Venkatesan Guruswami, Irit Dinur, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

The Structure of Winning Strategies in Parallel Repetition Games

Irit Dinur, Elazar Goldenberg, 2010, APPROX-RANDOM.

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

Guy Kindler, Irit Dinur, Shmuel Safra, 2003, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Explicit and structured sum of squares lower bounds from high dimensional expanders

Madhur Tulsiani, Irit Dinur, Yuval Filmus, 2020, Electron. Colloquium Comput. Complex..

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

Omer Reingold, Irit Dinur, 2004, FOCS.

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

Irit Dinur, Igor Shinkar, Irit Dinur, 2010, APPROX-RANDOM.

A new multilayered PCP and the hardness of hypergraph vertex cover

Venkatesan Guruswami, Subhash Khot, Irit Dinur, 2003, STOC '03.

The Hardness of 3-Uniform Hypergraph Coloring

Irit Dinur, Oded Regev, Clifford D. Smyth, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Derandomized Parallel Repetition via Structured PCPs

Or Meir, Irit Dinur, Irit Dinur, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

Analytical approach to parallel repetition

David Steurer, Irit Dinur, David Steurer, 2013, STOC.

Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]

Irit Dinur, Yuval Filmus, Prahladh Harsha, 2019, SODA.

Locally Testing Direct Product in the Low Error Range

Irit Dinur, Elazar Goldenberg, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Robust local testability of tensor products of LDPC codes ?

Avi Wigderson, Madhu Sudan, Irit Dinur, 2006 .

A Parallel Repetition Theorem for Entangled Projection Games

David Steurer, Irit Dinur, Thomas Vidick, 2014, Computational Complexity Conference.

The importance of being biased

Irit Dinur, Shmuel Safra, S. Safra, 2002, STOC '02.

Clustering in the Boolean Hypercube in a List Decoding Regime

Irit Dinur, Elazar Goldenberg, 2013, ICALP.

High Dimensional Expanders Imply Agreement Expanders

Irit Dinur, Tali Kaufman, Irit Dinur, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Decodability of group homomorphisms beyond the johnson bound

Madhu Sudan, Irit Dinur, Elena Grigorescu, 2008, STOC '08.

PCP characterizations of NP: towards a polynomially-small error-probability

Ran Raz, Guy Kindler, Eldar Fischer, 1999, STOC '99.

Cube vs. Cube Low Degree Test

Irit Dinur, Amey Bhangale, Inbal Livni Navon, 2016, Electron. Colloquium Comput. Complex..

Approximating SVPinfinity to within almost-polynomial factors is NP-hard

Irit Dinur, Irit Dinur, 1998, Theor. Comput. Sci..

Special Issue on Foundations of Computer Science

Éva Tardos, Irit Dinur, 2008, SIAM J. Comput..

On the hardness of approximating label-cover

Irit Dinur, Shmuel Safra, S. Safra, 2004, Inf. Process. Lett..

Covering CSPs

Irit Dinur, Gillat Kol, 2013, 2013 IEEE Conference on Computational Complexity.

Conditional hardness for approximate coloring

Elchanan Mossel, Irit Dinur, Oded Regev, 2005, STOC '06.

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

Or Meir, Irit Dinur, 2016, Electron. Colloquium Comput. Complex..

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

Irit Dinur, Irit Dinur, 2016, Electron. Colloquium Comput. Complex..

Agreement tests on graphs and hypergraphs pdf

Irit Dinur, Yuval Filmus, Prahladh Harsha, 2017, Electron. Colloquium Comput. Complex..

Conditional Hardness for Approximate Coloring

Elchanan Mossel, Irit Dinur, Oded Regev, 2009, SIAM J. Comput..

PCP characterizations of NP: towards a polynomially-small error-probability

Ran Raz, Guy Kindler, Eldar Fischer, 1999, STOC '99.

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Venkatesan Guruswami, Subhash Khot, Irit Dinur, 2005, SIAM J. Comput..

Direct Sum Testing

Guy Kindler, Irit Dinur, Igor Shinkar, 2017, SIAM J. Comput..

Dense Locally Testable Codes Cannot Have Constant Rate and Distance

Irit Dinur, Tali Kaufman, Irit Dinur, 2010, APPROX-RANDOM.

Direct Product Testing

David Steurer, Irit Dinur, David Steurer, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

PCPs with small soundness error

Irit Dinur, Irit Dinur, 2008, SIGA.

Derandomized Parallel Repetition of Structured PCPs

Or Meir, Irit Dinur, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

Revealing information while preserving privacy

Irit Dinur, Kobbi Nissim, Kobbi Nissim, 2003, PODS.

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

Guy Kindler, Irit Dinur, Shmuel Safra, 1998, Electron. Colloquium Comput. Complex..

Near Coverings and Cosystolic Expansion - an example of topological property testing

Irit Dinur, Roy Meshulam, Irit Dinur, 2019, Electron. Colloquium Comput. Complex..

Low degree almost Boolean functions are sparse juntas

Irit Dinur, Yuval Filmus, Prahladh Harsha, 2017, Electron. Colloquium Comput. Complex..

Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)

Or Meir, Irit Dinur, Swastik Kopparty, 2019, SIAM J. Comput..

Agreement Testing Theorems on Layered Set Systems

Yotam Dikstein, Irit Dinur, Irit Dinur, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

Proof of an Intersection Theorem via Graph Homomorphisms

Irit Dinur, Ehud Friedgut, 2006, Electron. J. Comb..

Direct Sum Testing

Guy Kindler, Irit Dinur, Igor Shinkar, 2015, SIAM J. Comput..

Direct Sum Testing: The General Case

Irit Dinur, Konstantin Golubev, 2019, APPROX-RANDOM.

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

Irit Dinur, Prahladh Harsha, 2013, SIAM J. Comput..

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

Or Meir, Irit Dinur, Irit Dinur, 2016, computational complexity.

Derandomized Graph Product Results Using the Low Degree Long Code

Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, 2015, STACS.

Intersecting Families are Essentially Contained in Juntas

Irit Dinur, Ehud Friedgut, E. Friedgut, 2009, Combinatorics, Probability and Computing.

Multiplayer parallel repetition for expander games

Irit Dinur, Prahladh Harsha, Rakesh Venkat, 2016, Electron. Colloquium Comput. Complex..

Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword

Irit Dinur, Boaz Barak, 2013, computational complexity.

Exponentially Small Soundness for the Direct Product Z-test

Irit Dinur, Inbal Livni Navon, Irit Dinur, 2017, Electron. Colloquium Comput. Complex..

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Will Perkins, Subhash Khot, Irit Dinur, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

From Local to Robust Testing via Agreement Testing

Irit Dinur, Tali Kaufman, Noga Ron-Zewi, 2018, Electron. Colloquium Comput. Complex..

Boolean function analysis on high-dimensional expanders

Yotam Dikstein, Irit Dinur, Yuval Filmus, 2018, Electron. Colloquium Comput. Complex..

Open questions in parallel repetition of games and PCPs

Irit Dinur, Irit Dinur, 2014 .

Explicit SoS lower bounds from high-dimensional expanders pdf

Madhur Tulsiani, Irit Dinur, Yuval Filmus, 2020, ITCS.

List-Decoding with Double Samplers

Amnon Ta-Shma, Irit Dinur, Prahladh Harsha, 2021, SIAM J. Comput..

Locally testable codes with constant rate, distance, and locality

Ron Livne, Irit Dinur, Alexander Lubotzky, 2021, Electron. Colloquium Comput. Complex..

On non-optimally expanding sets in Grassmann graphs

Guy Kindler, Subhash Khot, Irit Dinur, 2021, Israel Journal of Mathematics.

Locally Testing Direct Products in the High Error Range

Irit Dinur, Elazar Goldenberg, Irit Dinur, 2008 .

Intersecting Families , Independent Sets and Coloring of Certain Graph Products

Irit Dinur, Igor Shinkar, Irit Dinur, 2009 .

Independent Sets in Graph Powers are Almost Contained in Juntas

Irit Dinur, Ehud Friedgut, Oded Regev, 2008 .

PCPs via the low-degree long code and hardness for constrained hypergraph coloring

Venkatesan Guruswami, Irit Dinur, 2015 .