These are some of the slide-talks I have given in the last few years.

- Functional lower bounds for arithmetic circuits

- Computational Complexity Conference (CCC 2016), Tokyo, Japan
- Source files may be found here.

- Lower bounds for shallow circuits

- Job talk, survey-ish with some high level view of the depth-5 lower bound.
- Source files may be found here.

- Depth Reduction in arithmetic circuits

- Workshop on Arithmetic Complexity Theory (WACT 2015), Saarbrucken, Germany
- Source files may be found here.

- Arithmetic Circuits: A chasm at depth three

- Approaching the chasm at depth four

- CCC 2013, Palo Alto, California, USA.
- Source files may be found here.

- Jacobians hits all circuits

- Microsoft Research India, Bangalore. 2012
- Source files may be found here.

*xelatex*).

You are free to use any of the figures.