Mercredi 17 septembre

13:45-15:00: Déjeuner

15:00-16:00: Carole Delporte-Hugues Fauconnier: Consensus (obstruction-free, probabiliste) en mémoire bornée

16:00-16:30: Pause

16:30-17:00: Achour Mostéfaoui: Signature-Free Asynchronous Byzantine Consensus with t<n/3 and O(n^2) Messages

17:00-17:30: Michel Raynal: Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-passing Systems

19:30: Dîner

Jeudi 18 septembre

 9:30-10:30: Pierre Fraigniaud: On the role of IDs in local distributed computing

10:30-11:00: Pause

11:00-11:30: Laurent Feuilloley: Dérandomisation des algorithmes en temps constant pour des langages probabilistes

11:30-12:00: David Ilcinkas: Distributedly Testing Cycle-Freeness

12:15-14:00: Déjeuner

14:00-15:00: Michel Raynal: What can be computed in a distributed system?

15:00-15:30: Claire Capdevielle: Solo-fast Universal Constructions for Deterministic Abortable Objects

15:30-16:00: Pause

16:00-16:30: Laurent Viennot: Multipath routing with variable connectivity

16:30-17:00: Zohir Bouzid: Strong Equivalence Relations for Iterated Models

17:00-18:00: Problèmes ouverts

19:30: Dîner

Vendredi 19 septembre

 9:30-10:30: Adrian Kosowski

10:30-11:00: Pause

11:00-11:30: Christian Glacet: Disconnected components detection and rooted shortest-path tree maintenance in networks

11:30-12:00: Evangelos Bampas: Periodic data retrieval in asynchronous rings with a faulty host

12:15-14:00: Déjeuner