Tentative schedule (at a glance):
 
  Sunday Monday Tuesday  Wednesday  Thursday Friday  
7:30   Breakfast
7:30
8:30 1h 5' 8:30
9:00 9:00
9:35 Wulff-Nilsen Hansen Censor-Hillel Saia Borodin 9:35
10:10 Saranurak Vassilevska Williams Nanongkai Bender Parotsidis 10:10
10:45 Coffee break
10:45
11:15 Zwick Goldberg Krinninger Acar Zamir 11:15
11:50 Italiano Werneck Roditty Kaplan Iacono 11:50
12:25 5' Adjourn
12:25
12:30 Lunch
12:30
13:30 1h 20' Excursion 1h 20' Departures
13:30
14:15 Registration 14:15
14:50 Alistarh Chechik Georgiadis 14:50
15:25 Tarjan Golan Ellen 15:25
16:00 Coffee break Coffee break 16:00
16:30 3h 3h 3h 16:30
17:30 17:30
19:30 Welcome buffet Dinner Dinner 19:30
 

Detailed program:

Sunday, June 11
14:15-19:30 Registration (via Frangipane, 4)
19:30 Welcome buffet (Canteen)

 

Monday, June 12
7:30-8:30 Breakfast (Canteen)
9:25-9:35 Welcome address
9:35-10:10 Wulff-Nilsen: Fully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time
10:10-10:45 Saranurak: Dynamic Spanning Forest with Worst-Case Update Time
10:45-11:15 Coffee break
11:15-11:50 Zwick: TBA
11:50-12:25 Italiano: Decremental Single-Source Reachability in Planar Digraphs
12:30-13:30 Lunch (Canteen)
14:50-15:25 Alistarh: Data Structures of the Future: Concurrent, Optimistic, and Relaxed
15:25-16:00 Tarjan: Concurrent Disjoint Set Union
16:00-16:30 Coffee break
19:30 Dinner

 

Tuesday, June 13
7:30-8:30 Breakfast (Canteen)
9:35-10:10 Hansen: Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made
10:10-10:45 Vassilevska Williams: TBA
10:45-11:15 Coffee break
11:15-12:25 Goldberg: Lost in Translation: Production Code Efficiency
11:50-12:25 Werneck: Route Planning for Zone-Based Routing
12:30-13:30 Lunch (Canteen)
14:50-15:25 Chechik: TBA
15:25-16:00 Golan: Streaming Pattern Matching
16:00-16:30 Coffee break
19:30 Dinner

 

Wednesday, June 14
7:30-8:30 Breakfast (Canteen)
9:35-10:10 Censor-Hillel: New lower bounds for the CONGEST model
10:10-10:45 Nanongkai: Challenges in Distributed Shortest Paths Algorithms
10:45-11:15 Coffee break
11:15-11:50 Krinninger: Approximate Single-Source Shortest Paths in Distributed Networks
11:50-12:25 Roditty: Fault tolerant subgraph for single source reachability: generic and optimal
12:30-13:30 Lunch (Canteen)
13:30 Excursion

 

Thursday, June 15
7:30-8:30 Breakfast (Canteen)
9:35-10:10 Saia: Interactive communication for large networks
10:10-10:45 Bender: Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries
10:45-11:15 Coffee break
11:15-11:50 Acar: TBA
11:50-12:25 Kaplan: TBA
12:30-13:30 Lunch (Canteen)
14:50-15:25 Georgiadis: All-Pairs 2-Reachability in O(nω log n) Time
15:25-16:00 Ellen: Computability and Complexity of Shared Memory Operations
16:00-16:30 Coffee break
19:30 Dinner

 

Friday, June 16
7:30-8:30 Breakfast (Canteen)
9:35-10:10 Borodin: De-randomizing online algorithms: an incomplete tale of two problems
10:10-10:45 Parotsidis: TBA
10:45-11:15 Coffee break
11:15-11:50 Zamir: TBA
11:50-12:25 Iacono: TBA
12:25-12:30 Adjourn
12:30-13:30 Lunch (Canteen)
14:00- Departures