Thesis 2001 | Name Irit Dinur | |
 | ||
Awards Anna and Lajos Erdos Prize in Mathematics Fields Computer Science, Computational complexity theory | ||
Notable awards Erdos Prize (2012) | ||
Irit dinur direct products of games and graphs i
Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science. Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation.
Contents
- Irit dinur direct products of games and graphs i
- Irit dinur on the structure of np hard 3 sat instances
- References
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. 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.
In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv. She was a plenary speaker at the 2010 International Congress of Mathematicians. In 2012, she won the Anna and Lajos Erdős Prize in Mathematics, given by the Israel Mathematical Union. She was the William Bentinck-Smith Fellow at Harvard University in 2012–2013.