Irit Dinur

Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science.[1] Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation.[2]

Irit Dinur
Irit Dinur in 2014
Alma materPh.D. Tel Aviv University
Awards
Scientific career
FieldsComputer Science, Complexity Theory
InstitutionsWeizmann Institute of Science
Thesis (2001)
Doctoral advisorShmuel Safra
Websitewww.wisdom.weizmann.ac.il/~dinuri/

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.[3] She joined the Weizmann Institute after visiting the Institute of Advanced Studies 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.[4]

Awards and recognition

In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv.[5] She was a plenary speaker at the 2010 International Congress of Mathematicians.[6] In 2012, she won the Anna and Lajos Erdős Prize in Mathematics, given by the Israel Mathematical Union.[7] She was the William Bentinck-Smith Fellow at Harvard University in 2012–2013.[8] In 2019, she won the Gödel Prize for her paper "The PCP theorem by gap amplification".[9]

gollark: What?
gollark: Haskell uses lazy evaluation so you can implement `if` as a normal function.
gollark: Irrelevant. Haskell is lazy.
gollark: You mean JavaScript?
gollark: C as C preprocessor when?! I mean, this would be terrible as C makes string ops apioforms and would make ASTs bad but still.

References
  1. Faculty listing, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
  2. Research interests of faculty members, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
  3. School of Computer Science Thesis Repository, Tel-Aviv University, accessed 2014-06-18.
  4. 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.
  5. Michael Bruno Memorial Award recipients Archived 2018-10-12 at the Wayback Machine, retrieved 2014-06-18.
  6. ICM2010 — Avila, Dinur, plenary lectures, Tim Gowers, August 30, 2010.
  7. EMS e-News 4, September 2012 Archived 2013-06-12 at the Wayback Machine, European Mathematical Society, retrieved 2014-06-18.
  8. Irit Dinur, Radcliffe Institute for Advanced Study, Harvard University, retrieved 2014-06-18.
  9. EATSC 2019 Gödel Prize, retrieved 2019-09-11.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.