Irit Dinur (Hebrew: אירית דינור) is an Israeli computer scientist. 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]
^Faculty listing, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
^Research interests of faculty members, Weizmann Institute Faculty of Mathematics and Computer Science, retrieved 2014-06-18.
IritDinur (Hebrew: אירית דינור) is an Israeli computer scientist. She is professor of computer science at the Weizmann Institute of Science. Her research...
politician Yehiel Dinur (1909–2001), Jewish writer IritDinur, Israeli mathematician This page lists people with the surname Dinur. If an internal link...
of individuals in the database was NP-hard. In 2003, Kobbi Nissim and IritDinur demonstrated that it is impossible to publish arbitrary queries on a private...
too many questions will destroy privacy in a spectacular way." In 2003, IritDinur and Kobbi Nissim proposed a reconstruction attack based on noisy answers...
sexual harassment.” In November 2018 three Israeli computer scientists IritDinur, Oded Goldreich and Ehud Friedgut wrote a letter to the community mentioning...
The 2013 ACM PODS Alberto O. Mendelzon Test-of-Time Award (joint with IritDinur). The 2017 Gödel Prize and 2016 Theory of Cryptography Test of Time Award...
PCP theorem and its connection to hardness of approximation. In 2005 IritDinur discovered a significantly simpler proof of the PCP theorem, using expander...
Jonathan Danilowitz, activist Ran Danker, actor Jason Danino-Holt, anchor IritDinur, mathematician/computer scientist Uzi Even, scientist and politician Rose...
analyst, first female doctorate in mathematics at University of Gothenburg IritDinur, Israeli researcher in probabilistically checkable proofs and hardness...
sum-of-squares hierarchy is the most general kind of SDP hierarchy. Together with IritDinur, he introduced a new and simple approach to parallel repetition theorems...
choices, and their extensive applications to practice." 2021 Avrim Blum, IritDinur, Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam D. Smith For "fundamental...
Lellis Manuel del Pino Freddy Delbaen Frank den Hollander Nils Dencker IritDinur Cynthia Dwork Manfred Einsiedler Anna Erschler Alex Eskin Steven Neil...
Tsaban's doctoral dissertation, supervised by Hillel Furstenberg, won, with IritDinur, the Nessyahu prize for the best Ph.D. in mathematics in Israel in 2003...
Association for Computing Machinery, pp. 403–412, doi:10.1145/1374376.1374434 Dinur, Irit; Kaufman, Tali (2017), "High dimensional expanders imply agreement expanders"...
example, Volume 48 contains 11 out of 85 papers published in FOCS 2016. Dinur, Irit; Meir, Or; Kopparty, Swastik (2019). "Special Section on the Fifty-Seventh...
symposium on Theory of computing, ACM, pp. 475–484, ISBN 978-0-89791-888-6. Dinur, Irit; Steurer, David (2013), "Analytical approach to parallel repetition"...
Combinatorica, 20 (2): 153–172, doi:10.1007/s004930070018, S2CID 1173532. Dinur, Irit (2007), "The PCP theorem by gap amplification" (PDF), Journal of the...
archived (PDF) from the original on 2010-12-29, retrieved 2007-10-11 Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex...
Global Information