Dana Moshkovitz

Dana Moshkovitz Aaronson (Hebrew: דנה מושקוביץ) is an Israeli theoretical computer scientist whose research topics include approximation algorithms and probabilistically checkable proofs.

She is an associate professor of computer science at the University of Texas at Austin.

Her dissertation, Two Query Probabilistic Checking of Proofs with Subconstant Error, was supervised by Ran Raz,[1] and won the 2009 Haim Nessyahu Prize of the Israel Mathematical Union for the best mathematics dissertation in Israel.

[2] After postdoctoral research at Princeton University and the Institute for Advanced Study, Moshkovitz became a faculty member at the Massachusetts Institute of Technology.

[3][4] Moshkovitz is married to American theoretical computer scientist Scott Aaronson.