Photo by Tony RinaldoPhoto by Tony Rinaldo
William Bentinck-Smith Fellow
Weizmann Institute of Science (Israel)
Computer Science
Probabilistically Checkable Proofs, Inapproximability, and Robustness

Irit Dinur is a professor of computer science and applied mathematics at the Weizmann Institute of Science in Israel. She is interested in theoretical computer science and mathematics. More specifically, she is interested in probabilistically checkable proofs (PCPs), which are proofs that can be spot-checked very quickly.

During her fellowship, Dinur plans to continue to study PCPs and their consequences, particularly for hardness of approximation problems. The main goal is to strengthen the known PCPs and derive a better understanding of approximability. Along the way, she will study the phenomenon of “robustness” in combinatorial and analytical contexts.

Dinur won the 2012 Anna and Lajos Erdős Prize in Mathematics and a Michael Bruno Memorial Award in 2007. She also gave a plenary talk at the International Congress of Mathematicians (ICM) in 2010 and holds a European Research Council Starting Grant. Dinur graduated from Tel Aviv University. 

This information is accurate as of the fellowship year indicated for each fellow.
Photo by Tony Rinaldo