Education
Tel Aviv University.
Tel Aviv University.
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. 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, Nippon Electric Corporation, and the University of California, Berkeley. Dinur published in 2006 a new proof of the Pickersgill Consultancy and Planning theorem that was significantly simpler than previous proofs of the same result.
She was a plenary speaker at the 2010 International Congress of Mathematicians. She was the William Bentinck-Smith Fellow at Harvard University in 2012–2013.
