A link to many online talks
- Several talks at the Institute for Advanced Study, Princeton.
- Building monotone expanders, Neo-classical methods in discrete analysis, Simons Institute, Berkeley.
- Lower bounds for multilinear circuits and Non-commutative lower bounds, Recent progress in arithmetic complexity, TIFR, Bombai.
- A needle in a haystack, in Hebrew, Technion, Haifa.
- Rounding group actions: examples, Computational complexity meeting, BIRS, Banff.
- Lower bounds on the multiparty communication complexity of disjointness, Communication complexity and application meeting, BIRS, Banff.
- Symmetric computations, Workshop on Algebraic Complexity Theory, Tel Aviv.
- Geometric stability using information theory, Nexus of Information and Computation Theories, IHP, Paris.
- Spectral gaps and geometric representations, Expanders and Extractors Workshop, Simons Institute, Berkeley.
- Blocky ranks, BIRS, Banff.