Survey speakers:
Invited talks:
- Davi Castro-Silva (University of Cambridge) — Algorithmic Polynomial Freiman-Ruzsa Theorem
- Timothy M. Chan (University of Illinois at Urbana-Champaign) — A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
- Sitan Chen (Harvard) — Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions
- Natalie Collina (University of Pennsylvania) — Swap Regret and Correlated Equilibria Beyond Normal-Form Games
- Martin Costa (University of Warwick) — Vizing’s Theorem in Near-Linear Time
- Daniel DeLayo (Stony Brook University) — Don’t Melt Your Cache: Low Associativity with Heat Sink
- Ekin Ergen (TU Berlin) — Online Makespan Scheduling under Scenarios
- Maxwell Fishelson (MIT) — Breaking the T2/3 Barrier for Sequential Calibration
- MohammadTaghi Hajiaghayi (University of Maryland) — Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest
- Sam Hopkins (MIT) — SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
- Jun-Ting Hsieh (MIT) — Explicit Lossless Vertex Expanders
- Haotian Jiang (University of Chicago) — Quasi-Monte Carlo Beyond Hardy-Krause
- Nutan Limaye (ITU Copenhagen) — Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
- Neekon Vafa (MIT) — Symmetric Perceptrons, Number Partitioning and Lattices
- Some more additional invited talks TBA