| Dana Moshkovitz Aaronson | |
| Native Name: | דנה מושקוביץ |
| Native Name Lang: | he |
| Fields: | Theoretical Computer Science |
| Workplaces: | University of Texas at Austin |
| Alma Mater: | Weizmann Institute of Science |
| Doctoral Advisor: | Ran Raz |
| Known For: | Approximation algorithms, probabilistically checkable proofs |
| Awards: | Haim Nessyahu Prize (2009) |
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.
Moshkovitz completed her Ph.D. in 2008 at the Weizmann Institute of Science. Her dissertation, Two Query Probabilistic Checking of Proofs with Subconstant Error, was supervised by Ran Raz, and won the 2009 Haim Nessyahu Prize of the Israel Mathematical Union for the best mathematics dissertation in Israel.
After postdoctoral research at Princeton University and the Institute for Advanced Study, Moshkovitz became a faculty member at the Massachusetts Institute of Technology. She moved to the University of Texas as an associate professor in 2016.
Moshkovitz is married to American theoretical computer scientist Scott Aaronson.