Dana Moshkovitz
Workshop Complexity Theory, Nov. 2009 Dana Moshkovitz Aaronson ( ) is an Israeli theoretical computer scientist whose research topics include probabilistically checkable proofs and pseudorandomness.
≈ 1 min read
Dana Moshkovitz. encyclopegia.org, snapshot enwiki-001372523176. /a/dana-moshkovitz
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Workshop Complexity Theory, Nov. 2009 Dana Moshkovitz Aaronson ( ) is an Israeli theoretical computer scientist whose research topics include probabilistically checkable proofs and pseudorandomness. She is a 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, 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.
Personal life
Moshkovitz is married to American theoretical computer scientist Scott Aaronson.
External links
Home page
Text derived from https://en.wikipedia.org/w/index.php?oldid=1372523176 under CC BY-SA 4.0; modifications have been made.