
Assistant Professor
Computer Science Department
Cornell University
Research Interests
computational complexity of (combinatorial) optimization problems
strengths and limits of mathematical relaxations, especially linear and semidefinite programs
News
February 10–14, 2014: workshop on semidefinite programming and graph algorithms, ICERM, Providence.
Fall 2014: workshop on graph partitioning, semidefinite programming hierarchies, and the Unique Games Conjecture, Simons Institute, Berkeley.
Past
- 2010–2012
-
Microsoft Research New England — postdoc
- 2006–2010
-
Princeton University — Ph.D., advised by Sanjeev Arora
- 2003–2006
-
Saarland University — undergraduate
Committees
Recent Papers
- Approximate Constraint Satisfaction Requires Large LP Relaxations — FOCS 2013pdf
- Analytical Approach to Parallel Repetition — pdf
- On the Optimality of Semidefinite Relaxations for Average-Case and Generalized Constraint Satisfaction — ITCS 2013pdf
- Approximation Limits of Linear Programs (beyond Hierarchies) — FOCS 2012pdf
- Making the Long Code Shorter — FOCS 2012pdf
Selected Papers
- Hypercontractivity, Sum-of-Squares Proofs, and Applications — STOC 2012pdf
- Rounding Semidefinite Programming Hierarchies via Global Correlation — FOCS 2011pdf
- On the Complexity of Unique Games and Graph Expansion — Dissertationpdf
- Subexponential Algorithms for Unique Games and Related Problems — FOCS 2010pdf
- Graph Expansion and the Unique Games Conjecture — STOC 2010pdf
Current Courses
- Introduction to Theory of Computing (CS 4810, Fall 2013)
- Theory Seminar (CS 7890, Fall 2013)