Slides of some Talks

Proof Complexity Lower Bounds from Algebraic Circuit Complexity

Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound

Skoltech, Moscow, April 2016.

ReedMuller codes for random errors and erasures

Capacity achieving multiwrite WOM codes

On Sunflowers and Matrix Multiplication

CCI, Princeton, October 2012.

Polynomial Identity Testing

Bernoulli Lecture, EPFL, September 2011.

Lower Bounds for 2Query Locally Decodable Codes over Finite Fields

Workshop on Algebraic Coding Theory, EPFL, September 2011.

Noisy Interpolating Sets for Low Degree Polynomials

Workshop on Aspects of Coding Theory, EPFL, July 2011.

On The Fourier Spectrum of Symmetric Boolean Functions

Survey of Recent Results on Polynomial Identity
Testing

CSR, June, 2011.

M.I.T., November 2010.

Recent Results on Polynomial Identity
Testingg

Oberwolfach, Complexity Theory meeting, November 2009.

A (biased) survey on Arithmetic Circuits

Barriers in Computational Complexity workshop, August 2009.