Lightning Talks
summary
Eighteen rapidfire introductions summarize ongoing work and questions across dynamic graph algorithms: lower bounds on expanders, oblivious routing with electrical flows, dynamic differential privacy under continual observation, GPU implementations of dynamic graph kernels, batch dynamic setting and concurrent data structures, matrix-maintenance for dynamic shortest paths and matchings, LP and multiplicative-weights speedups, prediction-augmented algorithms, local cuts and vertex connectivity, and how to make these techniques practical. The session finishes all 18 minutes of slides.
AI-written summary Β· about
chapters (36)
- 0:00Intro
- 1:45Welcome
- 4:48Dynamic Graphs
- 6:26Sebastian Foster
- 10:22John Owens
- 14:47Helen Wang
- 15:18Chris
- 18:02David
- 19:01Aaron
- 19:57Phillip
- 21:06Vlado
- 21:29Tower
- 21:42Jallo
- 22:04Shari Solomon
- 23:01Savita Singh
- 23:15Ali Vacillian
- 24:43Te Jing
- 25:01Ishani
- 25:30Chandra
- 25:40Danny
- 25:59Alexander
- 26:37Sharon
- 26:49Malia
- 27:01David Weitz
- 27:32Catherine Hanover
- 28:34Roshu
- 28:46Nicole
- 29:17Sara
- 30:07Anthony
- 30:20Lawrence
- 30:33IBN
- 30:53Yin Chang
- 31:52Matthew Wang
- 32:16Virginia Vasilevska Williams
- 32:39Guy Blowock
- 32:59Outro
