|
Irit Dinur 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, especially probabilistically checkable proofs, hardness of approximation. She graduated from the school of computer science in Tel-Aviv University. Her advisor was Shmuel Safra. She spent a couple of years in Princeton at Institute of Advanced Studies and NEC, and a year as a Miller fellow at University of California Berkeley.
Dinur contributed to the vertex cover problem. In 2005, she discovered a dramatically simple and radically new proof of the PCP theorem.
|
