I don't maintain this page. Some of my older talks...

- New frontiers for the probabilistic method, ELC Tokyo complexity workshop, March 2013
- Circuit lower bounds - a combinatorial approach to P vs NP, Math conversations, Institute for Advanced Study, November 2012
- Pseudorandmness - a tutorial, Coding, Complexity and Sparsity workshop, University of Michigan, August 2011

- New probabilistic techniqe to prove existence of regular combinatorial objects, with Greg Kuperberg and Ron Peled, STOC 2012
- Subspace evasive sets, with Zeev Dvir, STOC 2012
- K-wise vs almost K-wise permutations, with Noga Alon, RANDOM 2012
- New extension of the Weil bound for character sums and applications to coding, with Tali Kaufman, FOCS 2011
- Bounded depth circuits cannot sample good codes, with Emanuele Viola, CCC 2011
- Space lower bound for dynamic, approximate membership data structures (e.g Bloom filters), with Ely Porat, FOCS 2010, presented at Synergies in Lower bounds workshop, Aarhus, July 2011
- Random polynomials are hard to approximate, with Ido Ben-Eliezer and Rani Hod, RANDOM 2009
- (the original) Inverse conjecture for the Gowers norm is false, with Roy Meshulam and Alex Samorodnitsky, STOC 2008
- Worst case to average case reductions for polynomials, with Tali Kaufman, FOCS 2008