Английская Википедия:Dana Moshkovitz

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:Short description

Файл:ComplexityTheory2009 MFO12245.jpg
Dana Moshkovitz (rightmost) at the MFO Workshop Complexity Theory, Nov. 2009

Dana Moshkovitz Aaronson (Шаблон:Lang-he) 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,Шаблон:R and won the 2009 Haim Nessyahu Prize of the Israel Mathematical Union for the best mathematics dissertation in Israel.Шаблон:R

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.Шаблон:R

Personal life

Moshkovitz is married to American theoretical computer scientist Scott Aaronson.Шаблон:R

References

Шаблон:Reflist

External links

Шаблон:Authority control