![]() |
Monday, June 2, 2025 |
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
|
›9:00 (30min)
9:00 - 9:30 (30min)
Welcome
Welcoming participants, coffee
›9:30 (50min)
9:30 - 10:20 (50min)
Fair Division Beyond Monotone Valuations
Siddharth Barman
›10:30 (30min)
10:30 - 11:00 (30min)
Coffee break
›11:00 (25min)
11:00 - 11:25 (25min)
Analyzing black-box optimization algorithms - why and how?
Carola Doerr
›11:30 (25min)
11:30 - 11:55 (25min)
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
Georg Zetzsche
›12:00 (1h30)
12:00 - 13:30 (1h30)
Lunch
›13:30 (50min)
13:30 - 14:20 (50min)
The Success Story of Polyregular Functions: Why We Need Pebbles
Sandra Kiefer
›14:30 (30min)
14:30 - 15:00 (30min)
Coffee break
›15:00 (25min)
15:00 - 15:25 (25min)
Local Correction algorithms for low-degree polynomials
Amik Raj Behera
›15:30 (25min)
15:30 - 15:55 (25min)
Synthesizing Asynchronous Automata from Fair Specifications
B. Srivathsan
›16:00 (1h)
16:00 - 17:00 (1h)
Coffee break
|
Session | Speech | Logistics | Break | Tour |