Planning

‹ Wednesday, September 25, 2019 ›
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
›9:00 (50min)
Analysis of algorithms
Plenary talk 5 Vincent Cohen-Addad "From Local to Global: Local Search Algorithms Beyond the Worst-Case Analysis"
› Amphi D
›9:50 (50min)
Analysis of algorithms
Plenary talk 6 Imre Bárány "Limit shape of random polygons and lattice polygons: a survey"
› Amphi D
›10:40 (20min)
Coffee break
›11:00 (30min)
Analysis of algorithms
Short talk 5 Nathan Noiry "The Depth First Search algorithm on a Configuration Model"
› Amphi D
›11:30 (30min)
Analysis of algorithms
Short talk 6 Matthieu Dien "1-2 tree: let's twist"
› Amphi D
›12:00 (2h)
Lunch
› CROUS
›14:10 (50min)
Analysis of algorithms
Plenary talk 7 Ralph Neininger "Process valued complexity measures of algorithms"
› Amphi D
›15:00 (30min)
Analysis of algorithms
Short talk 7 Pablo Rotondo "Recurrence of substitutive Sturmian words"
› Amphi D
›15:30 (20min)
Coffee break
›15:50 (30min)
Analysis of algorithms
Short talk 8 Przemyslaw Berk "On induction of interval exchange intervals"
› Amphi D
›16:20 (50min)
Analysis of algorithms
Plenary talk 8 Cyril Nicaud "Branch prediction in analysis of algorithms"
› Amphi D
Session
Speech
Logistics
Break
Tour
Online user: 18