Irit Dinur (Hebrew: אירית דינור) is an Israeli computer scientist.

[1] In 2024 she was appointed a permanent faculty member in the School of Mathematics of the Institute for Advanced Study.

[2] Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation.

[3] Irit Dinur earned her doctorate in 2002 from the school of computer science in Tel Aviv University, advised by Shmuel Safra; her thesis was entitled On the Hardness of Approximating the Minimum Vertex Cover and The Closest Vector in a Lattice.

[5] In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv.