Английская Википедия:David Steurer

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

Шаблон:Short description



Шаблон:Infobox scientist

David Steurer is a German theoretical computer scientist, working in approximation algorithms, hardness of approximation, sum of squares, and high-dimensional statistics. He is an associate professor of computer science at ETH Zurich.[1]

Biography

David Steurer studied for a bachelor's degree at the University of Saarland (2003–2006), and went on to study at Princeton University, where he obtained his PhD under the supervision of Sanjeev Arora at 2010. He then spend two years as a postdoc at Microsoft Research New England, before joining Cornell University. In 2017 he moved to ETH Zurich, where he became an associate professor in 2020.[2]

Work

Steurer's work focuses on optimization using the sum of squares technique, giving an invited talk on the topic at the 2018 ICM, together with Prasad Raghavendra.[3]

Together with Prasad Raghavendra, he developed the small set expansion hypothesis, for which they won the Michael and Shiela Held Prize.[4]

Together with James Lee and Prasad Raghavendra, he showed that in some settings, the sum-of-squares hierarchy is the most general kind of SDP hierarchy.[5]

Together with Irit Dinur, he introduced a new and simple approach to parallel repetition theorems.[6]

References

Шаблон:Reflist

External links

Шаблон:Authority control