| 2024 | FOCS | Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. | Yotam Dikstein, Irit Dinur, Alexander Lubotzky |
| 2024 | FOCS | Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes. | Irit Dinur, Ting-Chun Lin, Thomas Vidick |
| 2024 | STOC | Swap Cosystolic Expansion. | Yotam Dikstein, Irit Dinur |
| 2024 | STOC | Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers. | Yotam Dikstein, Irit Dinur |
| 2023 | STOC | Good Quantum LDPC Codes with Linear Time Decoders. | Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick |
| 2022 | FOCS | A Characterization of Multiclass Learnability. | Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff |
| 2022 | STOC | Locally testable codes with constant rate, distance, and locality. | Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes |
| 2019 | FOCS | Agreement Testing Theorems on Layered Set Systems. | Yotam Dikstein, Irit Dinur |
| 2019 | SODA | Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. | Irit Dinur, Yuval Filmus, Prahladh Harsha |
| 2019 | SODA | List Decoding with Double Samplers. | Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma |
| 2018 | STOC | Towards a proof of the 2-to-1 games conjecture? | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2018 | STOC | On non-optimally expanding sets in Grassmann graphs. | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2017 | FOCS | High Dimensional Expanders Imply Agreement Expanders. | Irit Dinur, Tali Kaufman |
| 2015 | STOC | Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. | Irit Dinur, Prahladh Harsha, Guy Kindler |
| 2015 | STACS | Derandomized Graph Product Results Using the Low Degree Long Code. | Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma |
| 2014 | STOC | Analytical approach to parallel repetition. | Irit Dinur, David Steurer |
| 2013 | FOCS | PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring. | Irit Dinur, Venkatesan Guruswami |
| 2013 | ICALP | Clustering in the Boolean Hypercube in a List Decoding Regime. | Irit Dinur, Elazar Goldenberg |
| 2010 | FOCS | Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. | Irit Dinur, Subhash Khot, Will Perkins, Muli Safra |
| 2009 | FOCS | Composition of Low-Error 2-Query PCPs Using Decodable PCPs. | Irit Dinur, Prahladh Harsha |
| 2008 | FOCS | Locally Testing Direct Product in the Low Error Range. | Irit Dinur, Elazar Goldenberg |
| 2008 | STOC | Decodability of group homomorphisms beyond the johnson bound. | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
| 2006 | STOC | The PCP theorem by gap amplification. | Irit Dinur |
| 2006 | STOC | On the fourier tails of bounded functions over the discrete cube. | Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell |
| 2006 | STOC | Conditional hardness for approximate coloring. | Irit Dinur, Elchanan Mossel, Oded Regev |
| 2004 | FOCS | Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. | Irit Dinur, Omer Reingold |
| 2003 | PODS | Revealing information while preserving privacy. | Irit Dinur, Kobbi Nissim |
| 2003 | STOC | A new multilayered PCP and the hardness of hypergraph vertex cover. | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
| 2002 | FOCS | The Hardness of 3 - Uniform Hypergraph Coloring. | Irit Dinur, Oded Regev, Clifford D. Smyth |
| 2002 | STOC | The importance of being biased. | Irit Dinur, Shmuel Safra |
| 2000 | CIAC | Approximating SVP | Irit Dinur |
| 1999 | STOC | PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
| 1998 | FOCS | Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. | Irit Dinur, Guy Kindler, Shmuel Safra |