| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | ||
| 7:30 | Breakfast |
7:30
|
|||||
| 8:30 | 30' | 1h 5' | 8:30 | ||||
| 9:00 | Sanders | Bender | King | Fleischman | 9:00 | ||
| 9:35 | Bingman | Goldberg | Bernstein | Iacono | Chechik | 9:35 | |
| 10:10 | Woelfel | Blelloch | Krinninger | Censor-Hillel | Haeupler | 10:10 | |
| 10:45 | Coffee break |
10:45
|
|||||
| 11:15 | Italiano | Kaplan | Zwick | Fiat | Pettie | 11:15 | |
| 11:50 | Munro | Georgiadis | Stein | Borodin | Parotsidis | 11:50 | |
| 12:25 | 5' | Adjourn |
12:25
|
||||
| 12:30 | Lunch |
12:30
|
|||||
| 13:30 | 45' | Excursion to Ferrara + dinner at Casa Artusi in Forlimpopoli | 1h 20' | Departures |
13:30
|
||
| 14:15 | Registration | Roditty | Gorelik | 14:15 | |||
| 14:50 | Dueholm Hansen | Marchetti Spaccamela | Venkatasubramanian | 14:50 | |||
| 15:25 | Porat | Saia | McCauley | 15:25 | |||
| 16:00 | Coffee break | Coffee break | 16:00 | ||||
| 16:30 | Discussion session: industry-academia interaction | 3h | 3h | 16:30 | |||
| 17:30 | 2h | 16:30 | |||||
| 19:30 | Welcome buffet | Dinner | Dinner | 19:30 | |||
Detailed program:
| Sunday, June 21 | |
| 14:15-19:30 | Registration (via Frangipane, 4) |
| 19:30 | Welcome buffet (Canteen) |
| Monday, June 22 | |
| 7:30-8:30 | Breakfast (Canteen) |
| 8:50-9:00 | Welcome address |
| 9:00-9:35 | Sanders: Parallel Algorithms Reconsidered |
| 9:35-10:10 | Bingman: Engineering Parallel Shared-Memory String Sorting |
| 10:10-10:45 | Woelfel: Randomized Mutual Exclusion with Constant Amortized RMR Complexity |
| 10:45-11:15 | Coffee break |
| 11:15-11:50 | Italiano: Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching |
| 11:50-12:25 | Munro: Succinct Data Structures for Equivalence Classes and Unordered Permutations |
| 12:30-13:30 | Lunch (Canteen) |
| 14:15-14:50 | Roditty: New routing techniques and their applications |
| 14:50-15:25 | Dueholm Hansen: Hollow Heaps |
| 15:25-16:00 | Porat: 3SUM Hardness in (Dynamic) Data Structures |
| 16:00-16:30 | Coffee break |
| 16:30-17:30 | Discussion session: industry-academia interaction |
| 19:30 | Dinner (Restaurant "EBC", Via Mainardi 10, Bertinoro) |
| Tuesday, June 23 | |
| 7:30-8:30 | Breakfast (Canteen) |
| 9:00-9:35 | Bender: TBD: Three Backoff Dilemmas |
| 9:35-10:10 | Goldberg: Hub Labeling Algorithms |
| 10:10-10:45 | Blelloch: Teaching an Introduction to Parallel and Functional Algorithms |
| 10:45-11:15 | Coffee break |
| 11:15-11:50 | Kaplan: Minimum Cost Flows in Graphs with Unit Capacities |
| 11:50-12:25 | Georgiadis: 2-Edge-Connectivity Problems in Directed Graphs |
| 12:30-13:30 | Lunch (Canteen) |
| 14:15-14:50 | Gorelik: The Temp Secretary Problem |
| 14:50-15:25 | Marchetti Spaccamela: Scheduling of Systems of Conditional Sporadic DAG Tasks |
| 15:25-16:00 | Saia: Interactive Communication with Unknown Noise Rate |
| 16:00-16:30 | Coffee break |
| 19:30 | Dinner (Restaurant "La Grotta", Via Roma 37, Bertinoro) |
| Wednesday, June 24 | |
| 7:30-8:30 | Breakfast (Canteen) |
| 9:00-9:35 | King: Improved worst case update time (and sublinear space) for dynamic graph connectivity |
| 9:35-10:10 | Bernstein: Dynamic matching in bipartite graphs |
| 9:35-10:10 | Krinninger: Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time |
| 10:45-11:15 | Coffee break |
| 11:15-11:50 | Zwick: An improved version of the Random-Facet pivoting rule for the simplex algorithm |
| 11:50-12:25 | Stein: Hallucination Helps: Energy Efficient Virtual Circuit Routing |
| 12:30-13:30 | Lunch (Canteen) |
| 13:30 | Excursion to Ferrara and dinner at restaurant "Casa Artusi" in Forlimpopoli |
| Thursday, June 25 | |
| 7:30-8:30 | Breakfast (Canteen) |
| 9:00-9:35 | Fleischman: A Simple O(|A||B|) algorithm for the Longest Common Cyclic Subsequence |
| 9:35-10:10 | Iacono: Cache-Oblivious Persistence |
| 10:10-10:45 | Censor-Hillel: Tight Bounds on Vertex Connectivity Under Vertex Sampling |
| 10:45-11:15 | Coffee break |
| 11:15-11:50 | Fiat: Pricing Online Decisions |
| 11:50-12:25 | Borodin: (Enhanced) Sequential Posted Price Mechanisms with Correlated Valuations |
| 12:30-13:30 | Lunch (Canteen) |
| 14:50-15:25 | Venkatasubramanian: Streaming verification of graph and geometric problems |
| 15:25-16:00 | McCauley: Cache-Adaptive Analysis |
| 16:00-16:30 | Coffee break |
| 19:30 | Dinner (Restaurant "Osteria della Serafina", Via Roma 29, Bertinoro) |
| Friday, June 26 | |
| 7:30-8:30 | Breakfast (Canteen) |
| 9:35-10:10 | Chechik: Approximate Distance Oracles with Improved Bounds |
| 10:10-10:45 | Haeupler: Distributed Algorithms for Planar Networks: Planar Embeddings |
| 10:45-11:15 | Coffee break |
| 11:15-11:50 | Pettie: Weighted Matching on General Graphs: Faster and Simpler |
| 11:50-12:25 | Parotsidis: 2-Vertex Connectivity in Directed Graphs |
| 12:25-12:30 | Adjourn |
| 12:30-13:30 | Lunch (Canteen) |
| 14:00- | Departures |