Breakthroughs

Breakthroughs is a lecture series highlighting major new developments in theoretical computer science.

Fall 2021

Breakthroughs — Locally Testable Codes with Constant Rate, Distance, and Locality

Speaker: Irit Dinur (Weizmann Institute of Science)

Oct. 6, 2021 10:00 am – 11:00 am

Summer 2021

Breakthroughs — An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture

Speaker: Yuansi Chen (Duke University)

Aug. 5, 2021 10:00 am – 11:00 am

Breakthroughs — A Refined Laser Method and Faster Matrix Multiplication

Speaker: Virginia Vassilevska Williams (MIT)

Jun. 16, 2021 10:00 am – 11:00 am