Department of Computer Science
January 2015: 18th Midrasha Mathematicae: In and Around Combinatorics, Israel Institute for Advanced Studies, Jerusalem.
December 6, 2014: Midwest Theory Day, University of Michigan, Ann Arbor.
September 2014: workshop on semidefinite optimization, approximation and applications, Simons Institute, Berkeley.
September 2014: lectures on extended formulations and the sum-of-squares method at Fifth Cargèse Workshop on Combinatorial Optimization, Corsica, France.
February 2014: workshop on semidefinite programming and graph algorithms, ICERM, Providence.
- Microsoft Research Faculty Fellowship, 2014
- NSF CAREER Award, 2014
- Alfred P. Sloan Research Fellowship, 2014
- Simons Collaboration: Algorithms and Geometry, 2014
- NSF AF Medium 1408673, 2014
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors — STOC 2016
- Lower bounds on the size of semidefinite programming relaxations — STOC 2015
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method — STOC 2015
- Sum-of-Squares Proofs and the Quest toward Optimal Algorithms — ICM 2014
- Rounding Sum-of-Squares Relaxations — STOC 2014
- Analytical Approach to Parallel Repetition — STOC 2014
- Approximate Constraint Satisfaction Requires Large LP Relaxations — FOCS 2013
- Hypercontractivity, Sum-of-Squares Proofs, and Applications — STOC 2012
- Rounding Semidefinite Programming Hierarchies via Global Correlation — FOCS 2011
- On the Complexity of Unique Games and Graph Expansion — Dissertation
- Subexponential Algorithms for Unique Games and Related Problems — FOCS 2010
- Graph Expansion and the Unique Games Conjecture — STOC 2010