Programme

Wednesday, 4th June

08:30 - 09:10 Coffee/Tea
09:10 - 10:00 Yael Kalai — Survey on verifying quantum computation
10:00 - 10:30 Jeremy Fineman — Single-Source Shortest Paths with Negative Real Weights in Õ(mn^8/9) Time
 
11:00 - 11:30 Richard Hladik — Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
11:30 - 12:00 Christoph Grunau — Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
12:00 - 12:30 Maximilian Probst Gutenberg — Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
 
14:00 - 15:30 Contributed (21 Talks of 3+1 Minutes)
15:30 - 16:30 Coffee Break & Poster Session
 
16:30 - 17:20 Shay Solomon — Survey on spanners
17:20 - 17:50 Greg Bodwin — An Alternate Proof of Near-Optimal Light Spanners
17:50 - 18:20 Yasamin Nazari — On Dynamic Graph Algorithms with Predictions
18:30 - 19:30 Business Meeting (with drinks)

Thursday, 5th June

08:30 - 09:10 Coffee/Tea
09:10 - 10:00 Sergei Vassilvitskii — Survey on learning-augmented algorithms
10:00 - 10:30 Ewin Tang — High-Temperature Gibbs States are Unentangled and Efficiently Preparable
 
11:00 - 11:30 Michal Feldman — Fair Division via Quantile Shares
11:30 - 12:00 Soheil Behnezhad — Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
12:00 - 12:30 Mihir Singhal — Optimal Quantile Estimation: Beyond the Comparison Model
 
14:00 - 15:30 Contributed (21 Talks of 3+1 Minutes)
15:30 - 16:30 Coffee Break & Poster Session
 
16:30 - 17:20 Mohsen Ghaffari — Survey on deterministic distributed algorithms
17:20 - 17:50 Prasanna Ramakrishnan — Breaking the Metric Voting Distortion Barrier
17:50 - 18:20 Xi Chen — Computing a Fixed Point of Contraction Maps in Polynomial Queries
18:30 - 22:00 Reception / Dinner

Friday, 6th June

08:30 - 09:10 Coffee/Tea
09:10 - 10:00 Matus Telgarsky — Survey on Mathematical Questions in LLMs and Deep Learning
10:00 - 10:30 Mohammad T. Hajiaghayi — Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?
 
11:00 - 11:30 Shuyi Yan — Edge-Weighted Online Stochastic Matching: Beating 1−1/e
11:30 - 12:00 Louis Golowich — New Explicit Constant-Degree Lossless Expanders
12:00 - 12:30 Oliver Hinder — The Price of Adaptivity in Stochastic Convex Optimization
 
14:00 - 15:30 Contributed (21 Talks of 3+1 Minutes)
15:30 - 16:00 Coffee Break
 
16:00 - 16:50 Sebastian Forster — Survey on dynamic algorithms
16:50 - 17:50 Poster Session

Building plan