Survey speakers:
Invited talks:
- Mihir Singhal (University of California, Berkeley) — Optimal Quantile Estimation: Beyond the Comparison Model
- Louis Golowich (University of California, Berkeley) — New Explicit Constant-Degree Lossless Expanders
- Yasamin Nazari (Vrije Universiteit Amsterdam) — On Dynamic Graph Algorithms with Predictions
- Shuyi Yan (University of Copenhagen) — Edge-Weighted Online Stochastic Matching: Beating 1−1/e
- Xi Chen (Columbia University) — Computing a Fixed Point of Contraction Maps in Polynomial Queries
- Ewin Tang (University of California, Berkeley) — High-Temperature Gibbs States are Unentangled and Efficiently Preparable
- Greg Bodwin (University of Michigan) — An Alternate Proof of Near-Optimal Light Spanners
- Michal Feldman (Tel Aviv University) — Fair Division via Quantile Shares
- Jeremy Fineman (Georgetown University) — Single-Source Shortest Paths with Negative Real Weights in Õ(mn^8/9) Time
- Richard Hladik (ETH Zürich) — Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
- Christoph Grunau (ETH Zürich) — Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
- Max Probst Gutenberg (ETH Zürich) — Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
- Soheil Behnezhad (Northeastern University) — Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
- Oliver Hinder (University of Pittsburgh) — The Price of Adaptivity in Stochastic Convex Optimization
- Prasanna Ramakrishnan (Stanford University) — Breaking the Metric Voting Distortion Barrier
- Mohammad Taghi Hajiaghayi (University of Maryland) — Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?