Program

The workshop is taking place at CIRM.

Monday February 13rd

9:30

Welcome

10:00

Model 1 : Graph coverings

Graph Coverings in Anonymous Networks since Angluin's Emmanuel Godard (LIS)

11:00

Model 2 : Graph Fibrations

Angluin's Approach for Message Passing Jérémie Chalopin (LIS)

12:30

Lunch

14:00

Model 3: Dynamic Networks

Computing in Anonymous Dynamic Networks Is Linear Giuseppe Di Luna (La Sapienza)

15:00

Distinguishing views in symmetric networks: A tight lower bound Dariusz Dereniowski (Gdansk TU)

15:30

Coffee break

16:00

Symmetries in Programmable Matter Maria Kokkou (LIS)

16:30

Locality and Checkability in Wait-Free Computing Sergio Rajsbaum (UNAM, Mexique)

17:00

Exercices, discussion and open problems special session

19:30 workshop dinner at CIRM

Tuesday February 14th

9:00

Welcome

9:30

Model 4 : Random Algorithms in Anonymous Networks

Randomized Election Algorithms Emmanuel Godard (LIS)

10:30

Coffee break

11:00

Model 5 : Distributed Computing and Control Theory

Computability in multi-agent systems Bernadette Charron-Bost (DI ENS, Paris)

12:30

Lunch

14:00

Little Lost Robot Mike Robson (LaBRI)

14:30

Election in unidirectional rings with homonyms Anaïs Durand (LIMOS)

15:00

Random thoughts on different kinds of symmetries Arnaud Casteigts (LaBRI)

15:30

End of the days