David Steurer

David Steurer is an Associate Professor in the Department of Computer Science at ETH Zurich. His research interests include complexity theory, approximation algorithms, convex optimization, parameter estimation, and tensor methods. Prof. Steurer's work focuses on theoretical computer science, with an emphasis on algorithmic techniques and their applications. His profile page provides further details on his research and academic activities.

David Steurer is a researcher at ETH Zürich, specializing in Algorithms and Complexity. His work focuses on the design and analysis of efficient algorithms for problems in theoretical computer science, particularly those involving approximation, optimization, and hardness of computation. He has made significant contributions to understanding the limits of approximation algorithms and the power of semidefinite programming relaxations. His research also explores the connections between sum-of-squares proofs, tensor decomposition, and the unique games conjecture. Steurer's work has advanced the understanding of how to efficiently solve complex computational problems with theoretical guarantees.