Irit Dinur
Israeli computer scientist From Wikipedia, the free encyclopedia
Irit Dinur (Hebrew: אירית דינור) is an Israeli computer scientist. She is professor of computer science at the Weizmann Institute of Science.[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 | |
|---|---|
אירית דינור | |
 Dinur in 2014 | |
| Alma mater | PhD Tel Aviv University |
| Awards |
|
| Scientific career | |
| Fields | Computer Science, Complexity Theory |
| Institutions | Weizmann Institute of Science Institute for Advanced Study |
| Thesis | (2001) |
| Doctoral advisor | Shmuel Safra |
| Website | www |
Biography
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.[4] She joined the Weizmann Institute after visiting the Institute for Advanced Study in Princeton, New Jersey, NEC, and the University of California, Berkeley.
Dinur published in 2006 a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result.[5]
Awards and recognition
In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv.[6] She was a plenary speaker at the 2010 International Congress of Mathematicians.[7] In 2012, she won the Anna and Lajos Erdős Prize in Mathematics, given by the Israel Mathematical Union.[8] She was the William Bentinck-Smith Fellow at Harvard University in 2012–2013.[9] In 2019, she won the Gödel Prize for her paper "The PCP theorem by gap amplification".[10]
References
External links
Wikiwand - on
Seamless Wikipedia browsing. On steroids.