# 2016

Tensor decompositions, sum-of-squares proofs, and spectral algorithms

**Simons Institute in Berkeley.** PDF VIDEO

# 2015

Tensor principal component analysis via sum-of-squares

**COLT 2015.** PDF

Lower bounds for semidefinite programming relaxations

**Midwest theory day.** PDF VIDEO

# 2014

Sum-of-Squares method, dictionary learning, and tensor decomposition

**Banff approximation workshop.** PDF VIDEO

Sum-of-squares proofs and the quest towards optimal algorithms

**Dagstuhl Seminar 2014.** PDF

Sum-of-Squares method and approximation algorithms

**Cargèse workshop on combinatorial optimization.** PDF

Rounding Sum-of-Squares Relaxations

**STOC 2014.** PDF

# 2013

Approximate Constraint Satisfaction Requires Large LP Relaxations

**New York area theory day.** PDF VIDEO

The Unique Games Conjecture and Polynomial Optimization

**Isaac Newton Institute.** PDF VIDEO

Analytical Approach to Parallel Repetition

**Banff workshop on computational complexity.** PDF VIDEO

# 2012

Semidefinite Programming — Approximation & Complexity

**RWTH Aachen summer school on semidefinite optimization.** PDF

Semidefinite Programming Hierarchies and the Unique Games Conjecture

**Algorithmic Frontiers Workshop at EPFL.** PDF

On the Power of Semidefinite Programming Hierarchies

with Prasad Raghavendra. **STOC 2012 Workshop on Unique Games Conjecture.** PDF

Hypercontractivity, Sum-of-Squares Proofs, and their Applications

**Georgia Tech theory seminar.** PDF

# 2011

Rounding Semidefinite Programming Hierarchies via Global Correlation

**FOCS 2011.** PDF

# 2010

Subexponential Algorithms for Unique Games and Related Problems

**FOCS 2010.** PDF VIDEO