Dinur, Irit
- Good Quantum LDPC Codes with Linear Time Decoders
2022/06/15 by Dinur, Irit, Hsieh, Min-Hsiu, Lin, Ting-Chun +1 · 30 citations
#FOS: Physical sciences #Quantum Physics (quant-ph)
- Analytical Approach to Parallel Repetition
2013/05/09 by Irit Dinur, Dinur, Irit, David Steurer +1 · 12 citations
Computer Science · #Artificial Intelligence in Games #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences
- Locally Testable Codes with constant rate, distance, and locality
2021/11/08 by Irit Dinur, Shai Evra, Dinur, Irit +7 · 1 voice · 11 citations
Computer Science · Mathematics · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Information Theory (cs.IT) #cs.CC #cs.IT #math.GR
- Conditional Hardness for Approximate Coloring
2005/04/14 by Irit Dinur, Elchanan Mossel, Dinur, Irit +3 · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #cs.CC #math.PR
- A Characterization of Multiclass Learnability
2022/03/03 by Nataly Brukhim, Daniel Carmon, Brukhim, Nataly +7 · 7 citations
Engineering · Computer Science · Medicine · #Artificial Immune Systems Applications #Rough Sets and Fuzzy Logic #Tuberculosis Research and Epidemiology
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
2003/04/19 by Irit Dinur, Venkatesan Guruswami, Dinur, Irit +5 · 3 citations
Computer Science · #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences #cs.CC
- A parallel repetition theorem for entangled projection games
2013/10/15 by Dinur, Irit, Steurer, David, Vidick, Thomas · 3 citations
#Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
- Derandomized Parallel Repetition via Structured PCPs
2010/02/08 by Dinur, Irit, Meir, Or · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- Coboundary and cosystolic expansion without dependence on dimension or degree
2023/04/04 by Dikstein, Yotam, Dinur, Irit · 2 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Cube vs. Cube Low Degree Test
2016/12/22 by Bhangale, Amey, Dinur, Irit, Navon, Inbal Livni · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- Good Locally Testable Codes
2022/07/25 by Dinur, Irit, Evra, Shai, Livne, Ron +2 · 1 citation
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Information Theory (cs.IT)
- Bipartite unique-neighbour expanders via Ramanujan graphs
2023/01/08 by Asherov, Ron, Dinur, Irit · 1 citation
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
- New Codes on High Dimensional Expanders
2023/08/29 by Dinur, Irit, Liu, Siqi, Zhang, Rachel Yun · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Information Theory (cs.IT)
- Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
2024/02/12 by Irit Dinur, Ting-Chun Lin, Dinur, Irit +3 · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
- Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
2024/02/02 by Yotam Dikstein, Dikstein, Yotam, Irit Dinur +3 · 1 citation
Computer Science · Engineering · #Advanced Control Systems Optimization #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Fault Detection and Control Systems #Formal Methods in Verification #Group Theory (math.GR)