Wednesday (March 16)

• 09h00-12h00: Working groups on your own

13h00: Lunch (on site)

• 14h25-14h30: Welcome to DUCAT+ESTATE
• 14h30-15h30: Franck Petit – Enhancing Safety and Self-Stabilization in Time-Varying Distributed Environments
• 15h30-16h00: Alain Cournier – The first fully polynomial stabilizing algorithm for BFS tree construction

16h00-16h30: Coffee break

• 16h30-17h00: Pierre Sens – A scalable causal broadcast that tolerates dynamics of mobile networks
• 17h00-17h30: Ralf Klasing – Bamboo Garden Trimming Problem
• 17h30-18h00: Quentin Bramas – Stand-up tolerant rendez-vous

20h00: Diner (on site)

Thursday (March 17)

• 09h00-10h00: Pierre Fraigniaud – Distributed Network Computing through the Lens of Algebraic Topology
• 10h00-10h30: Mikaël Rabie – Distributed Recoloring

10h30-11h00: Coffee break

• 11h00-11h30: Laurent Viennot – Compact representation of distances in sparse graphs: a tour around 2-hop labelings
• 11h30-12h00: Ioan Todinca – A Meta-Theorem for Distributed Certification

12h00-14h00: Lunch break (on site)

• 14h00-15h00: Emmanuel Godard – Dynamic Networks through the Lens of Algebraic Topology
• 15h00-15h30: Arnaud Casteigts – Efficient generation of simple temporal graphs up to isomorphism

15h30-16h00: Coffee break

• 16h00-16h30: Hugues Fauconnier – On Linearizability
• 16h30-17h00: Ami Paz – A Speedup Theorem for Asynchronous Computation
• 17h00-17h30: Achour Mostefaoui – Operational model
• 17h30-18h00: Michel Raynal – The Linearizabilty Hierarchy

19h00: Diner (on site)

Friday (March 18)

• 09h00-10h00: Pascal Lafourcade – Electronic Voting (In)Security
• 10h00-10h30: Pierre Civit – Crime and Punishment in Distributed Systems

10h30-11h00: Coffee break

• 11h00-11h30: Patrick Lambein – Fault Tolerant Coloring of the Asynchronous Cycle
• 11h30-12h00: Corentin Travers – Synchronous t-Resilient Consensus in Arbitrary Graphs

12h00-14h00: Lunch break (on site)

14h45: Shuttle departure