Irit Dinur

Boaz Barak, Irit Dinur: Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword. Computational Complexity 22(2): 215-217 (2013)

Irit Dinur, Elazar Goldenberg: Clustering in the Boolean Hypercube in a List Decoding Regime. Electronic Colloquium on Computational Complexity (ECCC) 20: 31 (2013)

Irit Dinur, Gillat Kol: Covering CSPs. Electronic Colloquium on Computational Complexity (ECCC) 19: 88 (2012)

Irit Dinur, Or Meir: Derandomized Parallel Repetition via Structured PCPs. Computational Complexity 20(2): 207-327 (2011)

Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Computational Complexity 20(3): 413-504 (2011)

Irit Dinur, Tali Kaufman: Dense Locally Testable Codes Cannot Have Constant Rate and Distance. APPROX-RANDOM 2011: 507-518

Irit Dinur, Tali Kaufman: Dense locally testable codes cannot have constant rate and distance. Electronic Colloquium on Computational Complexity (ECCC) 18: 55 (2011)

Irit Dinur, Igor Shinkar: On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors. APPROX-RANDOM 2010: 138-151

Irit Dinur, Elazar Goldenberg: The Structure of Winning Strategies in Parallel Repetition Games. APPROX-RANDOM 2010: 518-530

Irit Dinur, Or Meir: Derandomized Parallel Repetition of Structured PCPs. IEEE Conference on Computational Complexity 2010: 16-27

Irit Dinur, Subhash Khot, Will Perkins, Muli Safra: Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS 2010: 212-221

Irit Dinur, Prahladh Harsha: Composition of Low-Error 2-Query PCPs Using Decodable PCPs. Property Testing 2010: 280-288

Irit Dinur, Or Meir: Derandomized Parallel Repetition of Structured PCPs. CoRR abs/1002.1606 (2010)

Irit Dinur, Tali Kaufman: Dense locally testable codes cannot have constant rate and distance. CoRR abs/1012.2738 (2010)

Irit Dinur, Or Meir: Derandomized Parallel Repetition via Structured PCPs. Electronic Colloquium on Computational Complexity (ECCC) 17: 107 (2010)

Irit Dinur, Ehud Friedgut: Intersecting Families are Essentially Contained in Juntas. Combinatorics, Probability & Computing 18(1-2): 107-122 (2009)

Irit Dinur, Elchanan Mossel, Oded Regev: Conditional Hardness for Approximate Coloring. SIAM J. Comput. 39(3): 843-873 (2009)

Irit Dinur, Prahladh Harsha: Composition of Low-Error 2-Query PCPs Using Decodable PCPs. FOCS 2009: 472-481

Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim (Eds.): 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. Lecture Notes in Computer Science 5687, Springer 2009, isbn 978-3-642-03684-2

Irit Dinur, Prahladh Harsha: Composition of low-error 2-query PCPs using decodable PCPs. Electronic Colloquium on Computational Complexity (ECCC) 16: 42 (2009)

Irit Dinur, Éva Tardos: Special Issue on Foundations of Computer Science. SIAM J. Comput. 37(6) (2008)

Irit Dinur: PCPs with small soundness error. SIGACT News 39(3): 41-57 (2008)

Irit Dinur, Elazar Goldenberg: Locally Testing Direct Product in the Low Error Range. FOCS 2008: 613-622

Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Decodability of group homomorphisms beyond the johnson bound. STOC 2008: 275-284

Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Decodability of Group Homomorphisms beyond the Johnson Bound. Electronic Colloquium on Computational Complexity (ECCC) 15(020) (2008)

Irit Dinur: The PCP theorem by gap amplification. J. ACM 54(3): 12 (2007)

Irit Dinur, Ehud Friedgut: Proof of an Intersection Theorem via Graph Homomorphisms. Electr. J. Comb. 13(1) (2006)

Irit Dinur, Omer Reingold: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. 36(4): 975-1024 (2006)

Irit Dinur, Madhu Sudan, Avi Wigderson: Robust Local Testability of Tensor Products of LDPC Codes. APPROX-RANDOM 2006: 304-315

Irit Dinur: The PCP theorem by gap amplification. STOC 2006: 241-250

Irit Dinur, Elchanan Mossel, Oded Regev: Conditional hardness for approximate coloring. STOC 2006: 344-353

Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell: On the fourier tails of bounded functions over the discrete cube. STOC 2006: 437-446

Irit Dinur, Madhu Sudan, Avi Wigderson: Robust Local Testability of Tensor Products of LDPC Codes. Electronic Colloquium on Computational Complexity (ECCC) 13(118) (2006)

Irit Dinur, Oded Regev, Clifford D. Smyth: The Hardness of 3-Uniform Hypergraph Coloring. Combinatorica 25(5): 519-535 (2005)

Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. 34(5): 1129-1146 (2005)

Irit Dinur, Elchanan Mossel, Oded Regev: Conditional Hardness for Approximate Coloring. CoRR abs/cs/0504062 (2005)

Irit Dinur, Elchanan Mossel, Oded Regev: Conditional Hardness for Approximate Coloring. Electronic Colloquium on Computational Complexity (ECCC)(039) (2005)

Irit Dinur: The PCP theorem by gap amplification. Electronic Colloquium on Computational Complexity (ECCC)(046) (2005)

Irit Dinur, Shmuel Safra: On the hardness of approximating label-cover. Inf. Process. Lett. 89(5): 247-254 (2004)

Irit Dinur, Omer Reingold: Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS 2004: 155-164

Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra: Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Combinatorica 23(2): 205-243 (2003)

Irit Dinur, Kobbi Nissim: Revealing information while preserving privacy. PODS 2003: 202-210

Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A new multilayered PCP and the hardness of hypergraph vertex cover. STOC 2003: 595-601

Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. CoRR cs.CC/0304026 (2003)

Irit Dinur: Approximating SVP_infinity to within almost-polynomial factors is NP-hard. Theor. Comput. Sci. 285(1): 55-71 (2002)

Irit Dinur, Oded Regev, Clifford D. Smyth: The Hardness of 3 - Uniform Hypergraph Coloring. FOCS 2002: 33-

Irit Dinur, Shmuel Safra: The importance of being biased. STOC 2002: 33-42

Irit Dinur, Venkatesan Guruswami, Subhash Khot: Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon). Electronic Colloquium on Computational Complexity (ECCC)(027) (2002)

Irit Dinur, Shmuel Safra: The Importance of Being Biased. Electronic Colloquium on Computational Complexity (ECCC)(104) (2001)

Irit Dinur: Approximating SVP_infty to within Almost-Polynomial Factors Is NP-Hard. CIAC 2000: 263-276

Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40

Irit Dinur, Shmuel Safra: On the Hardness of Approximating Label Cover. Electronic Colloquium on Computational Complexity (ECCC) 6(15) (1999)

Irit Dinur: Approximating SVP_infty to within Almost-Polynomial Factors is NP-hard. Electronic Colloquium on Computational Complexity (ECCC) 6(16) (1999)

Irit Dinur, Guy Kindler, Shmuel Safra: Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. FOCS 1998: 99-111

Irit Dinur, Guy Kindler, Shmuel Safra: Approximating CVP to Within Almost Polynomial Factor is NP-Hard. Electronic Colloquium on Computational Complexity (ECCC) 5(48) (1998)

Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. Electronic Colloquium on Computational Complexity (ECCC) 5(66) (1998)