Irit Dinur

Irit Dinur is a professor at the Weizmann Institute of Science, specializing in theoretical computer science and combinatorics. She works in the Department of Applied Mathematics and Computer Science, focusing on probabilistically checkable proofs (PCPs), hardness of approximation, and high-dimensional expanders (HDX).

• Organizer of the Winter School on Expansion in Groups, Combinatorics, and Complexity (2025) at Weizmann Institute
• Co-organizer of the ICTS Workshop on HDX and Codes (Bangalore, April 2025)
• Teaching a summer course on Robust Computation: From Local to Global (2025)

Her research bridges theoretical computer science and mathematics, with recent work exploring:

• Interactive proof systems and their applications to undecidability
• Connections between high-dimensional expanders and quantum LDPC codes
• Advances in PCP theory and their implications for computational complexity
• Sparse graph counting techniques in additive combinatorics

She has been instrumental in organizing educational initiatives that explore cutting-edge topics like:

• Expansion properties in Cayley graphs
• Coboundary expansion in coset complexes
• Applications of finite free probability to expander graphs