Irit Dinur

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 85

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

STOC

ITCS

Publications

Ron Asherov, Irit Dinur
Bipartite Unique Neighbour Expanders via Ramanujan Graphs. Entropy 26 (4) (2024)
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Boolean Function Analysis on High-Dimensional Expanders. Comb. 44 (3) (2024)
Yotam Dikstein, Irit Dinur
Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers. STOC (2024)
Yotam Dikstein, Irit Dinur
Swap Cosystolic Expansion. STOC (2024)
Irit Dinur, Ting-Chun Lin, Thomas Vidick
Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes. CoRR (2024)
Yotam Dikstein, Irit Dinur, Alexander Lubotzky
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. Electron. Colloquium Comput. Complex. (2024)
Yotam Dikstein, Irit Dinur, Alexander Lubotzky
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. CoRR (2024)
Irit Dinur, Siqi Liu, Rachel Yun Zhang
New Codes on High Dimensional Expanders. CoRR (2023)
Yotam Dikstein, Irit Dinur
Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers. Electron. Colloquium Comput. Complex. (2023)
Yotam Dikstein, Irit Dinur
Coboundary and cosystolic expansion without dependence on dimension or degree. Electron. Colloquium Comput. Complex. (2023)
Yotam Dikstein, Irit Dinur
Swap cosystolic expansion. Electron. Colloquium Comput. Complex. (2023)
Irit Dinur, Siqi Liu, Rachel Zhang
New Codes on High Dimensional Expanders. Electron. Colloquium Comput. Complex. (2023)
Yotam Dikstein, Irit Dinur, Shiri Sivan
The linear time encoding scheme fails to encode. CoRR (2023)
Yotam Dikstein, Irit Dinur
Coboundary and cosystolic expansion without dependence on dimension or degree. CoRR (2023)
Yotam Dikstein, Irit Dinur
Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers. CoRR (2023)
Ron Asherov, Irit Dinur
Bipartite unique-neighbour expanders via Ramanujan graphs. CoRR (2023)
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick
Good Quantum LDPC Codes with Linear Time Decoders. STOC (2023)
Yotam Dikstein, Irit Dinur
Swap cosystolic expansion. CoRR (2023)
Irit Dinur
Expanders in Higher Dimensions (Invited Talk). FSTTCS (2022)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. Theory Comput. 18 (2022)
Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff
A Characterization of Multiclass Learnability. CoRR (2022)
Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff
A Characterization of Multiclass Learnability. FOCS (2022)
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
Good Locally Testable Codes. CoRR (2022)
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
Locally testable codes with constant rate, distance, and locality. STOC (2022)
Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff
A Characterization of Multiclass Learnability. Electron. Colloquium Comput. Complex. (2022)
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
Locally Testable Codes with constant rate, distance, and locality. Electron. Colloquium Comput. Complex. 28 (2021)
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
Locally Testable Codes with constant rate, distance, and locality. CoRR (2021)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List-Decoding with Double Samplers. SIAM J. Comput. 50 (2) (2021)
Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Explicit SoS Lower Bounds from High-Dimensional Expanders. ITCS (2021)
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. 27 (2020)
Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Explicit SoS lower bounds from high-dimensional expanders. CoRR (2020)
Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Explicit and structured sum of squares lower bounds from high dimensional expanders. Electron. Colloquium Comput. Complex. 27 (2020)
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
Locally testable codes via high-dimensional expanders. CoRR (2020)
Yotam Dikstein, Irit Dinur
Agreement testing theorems on layered set systems. CoRR (2019)
Irit Dinur, Konstantin Golubev
Direct sum testing - the general case. Electron. Colloquium Comput. Complex. 26 (2019)
Irit Dinur, Roy Meshulam
Near Coverings and Cosystolic Expansion - an example of topological property testing. Electron. Colloquium Comput. Complex. 26 (2019)
Yotam Dikstein, Irit Dinur
Agreement Testing Theorems on Layered Set Systems. FOCS (2019)
Irit Dinur, Or Meir, Swastik Kopparty
Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). SIAM J. Comput. 48 (2) (2019)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List Decoding with Double Samplers. SODA (2019)
Irit Dinur, Konstantin Golubev
Testing tensor products. CoRR (2019)
Irit Dinur, Oded Goldreich, Tom Gur
Every Set in P Is Strongly Testable Under a Suitable Encoding. ITCS (2019)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. ITCS (2019)
Irit Dinur, Konstantin Golubev
Direct Sum Testing: The General Case. APPROX-RANDOM (2019)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. SODA (2019)
Yotam Dikstein, Irit Dinur
Agreement testing theorems on layered set systems. Electron. Colloquium Comput. Complex. 26 (2019)
Irit Dinur, Pasin Manurangsi
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. CoRR (2018)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List Decoding with Double Samplers. CoRR (2018)
Irit Dinur, Pasin Manurangsi
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. Electron. Colloquium Comput. Complex. 25 (2018)
Irit Dinur, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. Electron. Colloquium Comput. Complex. 25 (2018)
Irit Dinur, Pasin Manurangsi
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. ITCS (2018)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
On non-optimally expanding sets in Grassmann graphs. STOC (2018)
Irit Dinur, Or Meir
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Comput. Complex. 27 (3) (2018)
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Boolean Function Analysis on High-Dimensional Expanders. APPROX-RANDOM (2018)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Towards a proof of the 2-to-1 games conjecture? STOC (2018)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. 25 (2018)
Irit Dinur, Yotam Dikstein, Yuval Filmus, Prahladh Harsha
Boolean function analysis on high-dimensional expanders. Electron. Colloquium Comput. Complex. 25 (2018)
Irit Dinur, Oded Goldreich, Tom Gur
Every set in P is strongly testable under a suitable encoding. Electron. Colloquium Comput. Complex. 25 (2018)
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Boolean functions on high-dimensional expanders. CoRR (2018)
Irit Dinur, Tali Kaufman
High Dimensional Expanders Imply Agreement Expanders. FOCS (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Low degree almost Boolean functions are sparse juntas. CoRR (2017)
Irit Dinur, Inbal Livni Navon
Exponentially Small Soundness for the Direct Product Z-Test. Computational Complexity Conference (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Agreement tests on graphs and hypergraphs. Electron. Colloquium Comput. Complex. 24 (2017)
Amey Bhangale, Irit Dinur, Inbal Livni Navon
Cube vs. Cube Low Degree Test. ITCS (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. 24 (2017)
Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
Direct Sum Testing. SIAM J. Comput. 46 (4) (2017)
Irit Dinur, Inbal Livni Navon
Exponentially Small Soundness for the Direct Product Z-test. Electron. Colloquium Comput. Complex. 24 (2017)
Irit Dinur, Tali Kaufman
High dimensional expanders imply agreement expanders. Electron. Colloquium Comput. Complex. 24 (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Agreement tests on graphs and hypergraphs. CoRR (2017)
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
Multiplayer Parallel Repetition for Expanding Games. ITCS (2017)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
On Non-Optimally Expanding Sets in Grassmann Graphs. Electron. Colloquium Comput. Complex. 24 (2017)
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
Multiplayer parallel repetition for expander games. CoRR (2016)
Amey Bhangale, Irit Dinur, Inbal Livni Navon
Cube vs. Cube Low Degree Test. Electron. Colloquium Comput. Complex. 23 (2016)
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
Towards a Proof of the 2-to-1 Games Conjecture? Electron. Colloquium Comput. Complex. 23 (2016)
Irit Dinur, Or Meir
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Computational Complexity Conference (2016)
Irit Dinur, Or Meir
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Electron. Colloquium Comput. Complex. 23 (2016)
Amey Bhangale, Irit Dinur, Inbal Livni Navon
Cube vs. Cube Low Degree Test. CoRR (2016)
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
Multiplayer parallel repetition for expander games. Electron. Colloquium Comput. Complex. 23 (2016)
Irit Dinur
Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover. Electron. Colloquium Comput. Complex. 23 (2016)
Irit Dinur, Shafi Goldwasser, Huijia Lin
The Computational Benefit of Correlated Instances. ITCS (2015)
Irit Dinur, Prahladh Harsha, Guy Kindler
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. STOC (2015)
Irit Dinur, Prahladh Harsha, Guy Kindler
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. CoRR (2015)
Irit Dinur, Prahladh Harsha, Guy Kindler
Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. Electron. Colloquium Comput. Complex. 22 (2015)
Irit Dinur, David Steurer, Thomas Vidick
A parallel repetition theorem for entangled projection games. Comput. Complex. 24 (2) (2015)
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
Derandomized Graph Product Results Using the Low Degree Long Code. STACS (2015)
Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
Direct Sum Testing. ITCS (2015)
Irit Dinur, Shafi Goldwasser, Huijia Lin
The Computational Benefit of Correlated Instances. Electron. Colloquium Comput. Complex. 21 (2014)
Irit Dinur, David Steurer
Direct Product Testing. Computational Complexity Conference (2014)
Irit Dinur, David Steurer, Thomas Vidick
A Parallel Repetition Theorem for Entangled Projection Games. Computational Complexity Conference (2014)
Irit Dinur, David Steurer
Analytical approach to parallel repetition. STOC (2014)
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
Derandomized Graph Product Results using the Low Degree Long Code. CoRR (2014)
Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
Direct Sum Testing. Electron. Colloquium Comput. Complex. 21 (2014)
Irit Dinur, Elazar Goldenberg
Clustering in the Boolean Hypercube in a List Decoding Regime. Electron. Colloquium Comput. Complex. 20 (2013)
Irit Dinur, David Steurer
Direct Product Testing. Electron. Colloquium Comput. Complex. 20 (2013)
Irit Dinur, David Steurer, Thomas Vidick
A parallel repetition theorem for entangled projection games. CoRR (2013)
Irit Dinur, Elazar Goldenberg
Clustering in the Boolean Hypercube in a List Decoding Regime. ICALP (1) (2013)
Irit Dinur, Venkatesan Guruswami
PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring. FOCS (2013)
Irit Dinur, Prahladh Harsha
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. SIAM J. Comput. 42 (6) (2013)
Irit Dinur, Gillat Kol
Covering CSPs. Computational Complexity Conference (2013)
Irit Dinur, David Steurer
Analytical Approach to Parallel Repetition CoRR (2013)
Irit Dinur, Igor Shinkar
On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors. Electron. Colloquium Comput. Complex. 20 (2013)

Irit Dinur.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Irit Dinur