Irit Dinur

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

Dinur studied computer science at the University of Tel Aviv, where she received her doctorate in Shmuel Safra. After that, she worked for several years at the Institute for Advanced Study at NEC Research and a year as a Miller Fellow at the University of California, Berkeley. She was a professor of computer science at the Hebrew University and is a professor at the Weizmann Institute. 2012, she has become a sabbatical at Microsoft Research.

In 2005 she was known by a new proof of the PCP theorem, which constituted a great simplification over previous evidence. The theorem was originally proved in the 1990s by Sanjeev Arora, Safra and others.

In 2010 she gave a plenary lecture at the ICM in Hyderabad ( Probabilistic checkable proofs and codes). In 2012 she was awarded awarded the Erdős Prize.

Writings

  • The PCP theorem by gap amplification, Technical Report 2005, Journal of the ACM, Volume 54, 2007, p.1, online, pdf
417193
de