Breakthroughs

Breakthroughs

Breakthroughs is a series devoted to technical lectures highlighting major new developments in theoretical computer science.

Strong Bounds for 3-Progressions | Breakthroughs Raghu Meka Breakthroughs-Banner
|
Strong Bounds for 3-Progressions | Breakthroughs

Calvin Lab Auditorium

Speakers: Raghu Meka
Details of Strong Bounds for 3-Progressions | Breakthroughs
Breakthroughs — Thresholds Breakthroughs — Thresholds Banner
|
Breakthroughs — Thresholds

Calvin Lab Auditorium and Zoom

Speakers: Jinyoung Park (Stanford)
Details of Breakthroughs — Thresholds
Breakthroughs — Locally Testable Codes with Constant Rate, Distance, and Locality Breakthroughs — Locally Testable Codes Banner
|
Breakthroughs — Locally Testable Codes with Constant Rate, Distance, and Locality

Calvin Lab auditorium and Zoom (speaker presenting remotely)

Speakers: Irit Dinur (Weizmann Institute of Science)
Details of Breakthroughs — Locally Testable Codes with Constant Rate, Distance, and Locality
Breakthroughs — An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture Breakthroughs — An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture Banner
|
Breakthroughs — An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture
Speakers: Yuansi Chen (Duke University)
Details of Breakthroughs — An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture
Breakthroughs — A Refined Laser Method and Faster Matrix Multiplication Breakthroughs — A Refined Laser Method and Faster Matrix Banner
|
Breakthroughs — A Refined Laser Method and Faster Matrix Multiplication
Speakers: Virginia Vassilevska Williams (MIT)
Details of Breakthroughs — A Refined Laser Method and Faster Matrix Multiplication
Series
Richard M. Karp Distinguished Lectures
Theoretically Speaking
Breakthroughs
Quantum Colloquium
All Public Lectures