Dana Moshkovitz
Dana Moshkovitz Aaronson | |
|---|---|
דנה מושקוביץ | |
| Alma mater | Weizmann Institute of Science |
| Known for | Approximation algorithms, probabilistically checkable proofs |
| Awards | Haim Nessyahu Prize (2009) |
| Scientific career | |
| Fields | Theoretical Computer Science |
| Institutions | University of Texas at Austin |
| Doctoral advisor | Ran Raz |
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.
Education and career
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,[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. She moved to the University of Texas as an associate professor in 2016.[3][4]
Personal life
Moshkovitz is married to American theoretical computer scientist Scott Aaronson.[4]
References
- ^ Dana Moshkovitz at the Mathematics Genealogy Project
- ^ The Haim Nessyahu Prize in Mathematics, MacTutor History of Mathematics archive, retrieved 2019-09-21
- ^ "Dana Moshkovitz – Theoretical Computer Science", New Faculty, University of Texas at Austin Department of Computer Science, retrieved 2019-09-21
- ^ a b Aaronson, Scott (February 28, 2016), "From Boston to Austin", Shtetl-Optimized
External links
- Home page
- Dana Moshkovitz publications indexed by Google Scholar
