Irit Dinur

Most-cited papers

Revealing information while preserving privacy
Irit Dinur, Kobbi Nissim
2003ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems1,282 citations
Semantic Scholar
On the hardness of approximating minimum vertex cover
Irit Dinur, S. Safra
2005734 citations Open access
Semantic Scholar
Analytical approach to parallel repetition
Irit Dinur, David Steurer
2013Symposium on the Theory of Computing589 citations
Semantic Scholar
Good Quantum LDPC Codes with Linear Time Decoders
Irit Dinur, Min-Hsiu Hsieh, Ting Lin, T. Vidick
2022Symposium on the Theory of Computing224 citations Open access
Semantic Scholar
A new multilayered PCP and the hardness of hypergraph vertex cover
Irit Dinur, V. Guruswami, Subhash Khot, O. Regev
2003Symposium on the Theory of Computing223 citations Open access
Semantic Scholar
Assignment testers: towards a combinatorial proof of the PCP-theorem
Irit Dinur, Omer Reingold
200445th Annual IEEE Symposium on Foundations of Computer Science206 citations
Semantic Scholar
Conditional hardness for approximate coloring
Irit Dinur, Elchanan Mossel, O. Regev
2005Symposium on the Theory of Computing195 citations Open access
Semantic Scholar
High Dimensional Expanders Imply Agreement Expanders
Irit Dinur, T. Kaufman
2017IEEE Annual Symposium on Foundations of Computer Science136 citations
Semantic Scholar
Locally testable codes with constant rate, distance, and locality
Irit Dinur, Shai Evra, R. Livne, A. Lubotzky +1 more
2021Electron. Colloquium Comput. Complex.134 citations Open access
Semantic Scholar
Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover
Irit Dinur
2016Electron. Colloquium Comput. Complex.115 citations
Semantic Scholar
Towards a proof of the 2-to-1 games conjecture?
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer +1 more
2018Electron. Colloquium Comput. Complex.107 citations
Semantic Scholar
Graph Products, Fourier Analysis and Spectral Techniques
N. Alon, Irit Dinur, Ehud Friedgut, Benny Sudakov
200499 citations
Semantic Scholar
A Characterization of Multiclass Learnability
Nataly Brukhim, Dan Carmon, Irit Dinur, S. Moran +1 more
2022IEEE Annual Symposium on Foundations of Computer Science96 citations Open access
Semantic Scholar
The PCP theorem by gap amplification
Irit Dinur
2007Journal of the ACM95 citations
Semantic Scholar
On the Fourier tails of bounded functions over the discrete cube
Irit Dinur, Ehud Friedgut, Guy Kindler, R. O'Donnell
2006Symposium on the Theory of Computing90 citations
Semantic Scholar
Intersecting Families are Essentially Contained in Juntas
Irit Dinur, Ehud Friedgut
2009Combinatorics, probability & computing78 citations Open access
Semantic Scholar
On non-optimally expanding sets in Grassmann graphs
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer +1 more
2018Israel Journal of Mathematics71 citations
Semantic Scholar
Composition of Low-Error 2-Query PCPs Using Decodable PCPs
Irit Dinur, P. Harsha
20092009 50th Annual IEEE Symposium on Foundations of Computer Science71 citations Open access
Semantic Scholar
On the hardness of approximating label-cover
Irit Dinur, S. Safra
2004Information Processing Letters68 citations
Semantic Scholar
A parallel repetition theorem for entangled projection games
Irit Dinur, David Steurer, T. Vidick
2013Computational Complexity67 citations
Semantic Scholar
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity
Irit Dinur, Or Meir
2016Computational Complexity51 citations Open access
Semantic Scholar
Agreement Testing Theorems on Layered Set Systems
Yotam Dikstein, Irit Dinur
2019IEEE Annual Symposium on Foundations of Computer Science46 citations
Semantic Scholar
List Decoding with Double Samplers
Irit Dinur, P. Harsha, T. Kaufman, I. Navon +1 more
2018Electron. Colloquium Comput. Complex.46 citations Open access
Semantic Scholar
Boolean Function Analysis on High-Dimensional Expanders
Yotam Dikstein, Irit Dinur, Yuval Filmus, P. Harsha
2018Combinatorica43 citations Open access
Semantic Scholar
Derandomized Parallel Repetition via Structured PCPs
Irit Dinur, Or Meir
2010Computational Complexity42 citations Open access
Semantic Scholar
Independent Sets in Graph Powers are Almost Contained in Juntas
Irit Dinur, Ehud Friedgut, O. Regev
200842 citations Open access
Semantic Scholar
Direct Sum Testing
R. David, Irit Dinur, Elazar Goldenberg, Guy Kindler +1 more
2015SIAM journal on computing (Print)41 citations
Semantic Scholar
Locally Testing Direct Product in the Low Error Range
Irit Dinur, Elazar Goldenberg
20082008 49th Annual IEEE Symposium on Foundations of Computer Science40 citations
Semantic Scholar
Direct Product Testing
Irit Dinur, David Steurer
2014Cybersecurity and Cyberforensics Conference39 citations
Semantic Scholar
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
Irit Dinur, Pasin Manurangsi
2018Information Technology Convergence and Services36 citations
Semantic Scholar
PCPs via the low-degree long code and hardness for constrained hypergraph coloring
Irit Dinur, V. Guruswami
2015Israel Journal of Mathematics31 citations
Semantic Scholar
Hardness of Finding Independent Sets in Almost q-Colorable Graphs
Irit Dinur, Subhash Khot, Will Perkins, M. Safra
2010IEEE Annual Symposium on Foundations of Computer Science25 citations
Semantic Scholar
Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes
Irit Dinur, Ting-Chun Lin, T. Vidick
2024IEEE Annual Symposium on Foundations of Computer Science24 citations
Semantic Scholar
Decodability of group homomorphisms beyond the johnson bound
Irit Dinur, Elena Grigorescu, Swastik Kopparty, M. Sudan
2008Electron. Colloquium Comput. Complex.24 citations
Semantic Scholar
Coboundary and cosystolic expansion without dependence on dimension or degree
Yotam Dikstein, Irit Dinur
2023Electron. Colloquium Comput. Complex.23 citations Open access
Semantic Scholar
Explicit SoS lower bounds from high-dimensional expanders
Irit Dinur, Yuval Filmus, P. Harsha, Madhur Tulsiani
2020Information Technology Convergence and Services23 citations Open access
Semantic Scholar
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition
Irit Dinur, P. Harsha, Guy Kindler
2015Symposium on the Theory of Computing23 citations Open access
Semantic Scholar
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
Irit Dinur, Igor Shinkar
2010International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques23 citations
Semantic Scholar
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]
Irit Dinur, Yuval Filmus, P. Harsha
2019ACM-SIAM Symposium on Discrete Algorithms22 citations Open access
Semantic Scholar
Locally testable codes via high-dimensional expanders
Yotam Dikstein, Irit Dinur, P. Harsha, Noga Ron-Zewi
2020Electron. Colloquium Comput. Complex.20 citations
Semantic Scholar
Exponentially Small Soundness for the Direct Product Z-test
Irit Dinur, I. Navon
2017Electron. Colloquium Comput. Complex.20 citations
Semantic Scholar
Multiplayer parallel repetition for expander games
Irit Dinur, P. Harsha, Rakesh Venkat, Henry S. Yuen
2016Electron. Colloquium Comput. Complex.20 citations
Semantic Scholar
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
Yotam Dikstein, Irit Dinur, Alexander Lubotzky
2024IEEE Annual Symposium on Foundations of Computer Science19 citations Open access
Semantic Scholar
New Codes on High Dimensional Expanders
Irit Dinur, Siqi Liu, R. Zhang
2023Electron. Colloquium Comput. Complex.18 citations Open access
Semantic Scholar
Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
Irit Dinur, Ting-Chun Lin, T. Vidick
2024arXiv.org16 citations
Semantic Scholar
Cube vs. Cube Low Degree Test
Amey Bhangale, Irit Dinur, I. Navon
2016Electron. Colloquium Comput. Complex.16 citations
Semantic Scholar
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability
Irit Dinur, Eldar Fischer, Guy Kindler, R. Raz +1 more
2011Computational Complexity15 citations Open access
Semantic Scholar
Bipartite Unique Neighbour Expanders via Ramanujan Graphs
Ron Asherov, Irit Dinur
2023Entropy14 citations Open access
Semantic Scholar
Swap Cosystolic Expansion
Yotam Dikstein, Irit Dinur
2023Electron. Colloquium Comput. Complex.14 citations Open access
Semantic Scholar
Near coverings and cosystolic expansion
Irit Dinur, R. Meshulam
2022Archiv der Mathematik12 citations
Semantic Scholar