#### ASD day January 27th 2020

Room 3052

- 9h30-10h45
*Amaury Pouly*. Continuous models of computation: computability, complexity, universality.

- 11h00-11h45
*Valérie Berthé*. How to approximate simultaneously numbers?

- 11h45-12h30
*Jean Krivine*. Introduction to (Stochastic) Graph Rewriting.

- 13h30-14h20
*Patrice Ossona de Mendez*. Low complexity networks: a model theoretical approach to sparsity.

- 14h20-15h10
*Enrica Duchi*. Square permutations

- 15h30-16h20
*Simon Mauras*. How to aggregate Top-lists: Approximation algorithms via scores and average ranks.

- 16h20-17h10
*Pierluigi Crescenzi*. Temporal graphs and static graphs. A fruitful two-way collaboration.

- 17h10-17h30 Discussion