Slides of some Talks

  1. Proof Complexity Lower Bounds from Algebraic Circuit Complexity
    • Technion, June 2016.

  2. Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound
    • Skoltech, Moscow, April 2016.

  3. Reed-Muller codes for random errors and erasures
    • IAS, April 2016.

  4. Capacity achieving multi-write WOM codes
    • Technion, January 2014

  5. On Sunflowers and Matrix Multiplication
    • CCI, Princeton, October 2012.

  6. Polynomial Identity Testing
    • Bernoulli Lecture, EPFL, September 2011.

  7. Lower Bounds for 2-Query Locally Decodable Codes over Finite Fields
    • Workshop on Algebraic Coding Theory, EPFL, September 2011.

  8. Noisy Interpolating Sets for Low Degree Polynomials
    • Workshop on Aspects of Coding Theory, EPFL, July 2011.

  9. On The Fourier Spectrum of Symmetric Boolean Functions
    • IAS, March 2011.

  10. Survey of Recent Results on Polynomial Identity Testing
    • CSR, June, 2011.
    • M.I.T., November 2010.

  11. Recent Results on Polynomial Identity Testingg
    • Oberwolfach, Complexity Theory meeting, November 2009.

  12. A (biased) survey on Arithmetic Circuits
    • Barriers in Computational Complexity workshop, August 2009.