Irit Dinur
Israeli computer scientist
- Paris Kanellakis Award (2021)
- Erdős Prize (2012)
- Gödel Prize (2019)
Institute for Advanced Study
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]
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
- ^ Faculty listing, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
- ^ "Three World-Leading Mathematicians Join IAS Faculty - Press Release | Institute for Advanced Study". July 2024.
- ^ Research interests of faculty members, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
- ^ School of Computer Science Thesis Repository, Tel Aviv University, accessed 2014-06-18.
- ^ Radhakrishnan, Jaikumar; Sudan, Madhu (2007), "On Dinur's proof of the PCP theorem", Bulletin of the American Mathematical Society, New Series, 44 (1): 19–61, doi:10.1090/S0273-0979-06-01143-8, MR 2265009.
- ^ Michael Bruno Memorial Award recipients Archived 2018-10-12 at the Wayback Machine, retrieved 2014-06-18.
- ^ ICM2010 — Avila, Dinur, plenary lectures, Tim Gowers, August 30, 2010.
- ^ EMS e-News 4, September 2012 Archived 2013-06-12 at the Wayback Machine, European Mathematical Society, retrieved 2014-06-18.
- ^ Irit Dinur, Radcliffe Institute for Advanced Study, Harvard University, retrieved 2014-06-18.
- ^ EATCS 2019 Gödel Prize, retrieved 2019-09-11.
External links
- Personal HomePage
- Turing Centennial Post 1: Irit Dinur, guest post on Luca Trevisan's blog "in theory" concerning Dinur's experiences as a lesbian academic
- v
- t
- e
Gödel Prize laureates
- Vardi / Wolper (2000)
- Arora / Feige / Goldwasser / Lund / Lovász / Motwani / Safra / Sudan / Szegedy (2001)
- Sénizergues (2002)
- Freund / Schapire (2003)
- Herlihy / Saks / Shavit / Zaharoglou (2004)
- Alon / Matias / Szegedy (2005)
- Agrawal / Kayal / Saxena (2006)
- Razborov / Rudich (2007)
- Teng / Spielman (2008)
- Reingold / Vadhan / Wigderson (2009)
Authority control databases  | |
|---|---|
| International |
|
| National |
|
| Academics |
|
