Irit Dinur
Irit Dinur ( Hebrew אירית דינור) is an Israeli computer scientist .
Dinur studied computer science at Tel Aviv University , where she did her PhD with Shmuel Safra . She then spent several years at the Institute for Advanced Study , 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 . In 2012 she is on a sabbatical at Microsoft Research .
It became known in 2005 through a new proof of the PCP theorem , which was a great simplification of previous proofs. The theorem was originally proven 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 ). For 2012 she was awarded the Erdős Prize , for 2019 the Gödel Prize .
Fonts
- The PCP Theorem by gap amplification , Technical Report 2005 and Journal of the ACM, Volume 54, 2007, p. 1, Online, pdf
Web links
Individual evidence
- ↑ Jaikumar Radhakrishnan, Madhu Sudan: On Dinur's Proof of the PCP theorem. In: Bulletin AMS. Volume 44, 2007, pp. 19-61
- ^ O'Donnel History of the PCP Theorem, pdf
personal data | |
---|---|
SURNAME | Dinur, Irit |
ALTERNATIVE NAMES | אירית דינור & lrm (Hebrew) |
BRIEF DESCRIPTION | Israeli computer scientist |
DATE OF BIRTH | 20th century |