| Monday, April 22, 2013 |
| 13:30 - 14:00 |
opening by Thomas Ehrhard and Pierre Fraigniaud |
| 14:00 - 14:50 |
Glynn Winskel (Cambridge) |
Distributed strategies |
| 15:00 - 15:50 |
Pavol Hell (Simon Fraser University) |
Complexity of list homomorphisms |
| 16:00 - 16:30 |
coffee break |
| 16:30 - 17:20 |
Vincent Danos (Edinburgh) |
Thermodynamic graph rewriting |
|
| Tudesday, April 23, 2013 |
| 9:30 - 10:00 |
coffee |
| 10:00 - 10:50 |
Thomas A. Henzinger (IST Austria) |
Quantitative Reactive Modeling |
| 11:00 - 11:50 |
Rajeev Alur (U Penn) |
Regular Functions and Cost Register Automata |
| 12:00 - 14:00 |
lunch |
| 14:00 - 14:50 |
Alexandre Miquel (ENS Lyon) |
From forcing to classical realizability |
| 15:00 - 15:50 |
Bruno Salvy (INRIA) |
Newton iteration in computer algebra and combinatorics |
| 16:00 - 16:30 |
coffee break |
| 16:30 - 17:20 |
Justin Salez (LPMA, Paris 7) |
Spectral theory of sparse random graphs |
|
| Wednesday, April 24, 2013 |
| 9:30 - 10:00 |
coffee |
| 10:00 - 10:50 |
Hagit Attiya (Technion) |
Indistinguishability: Friend and Foe of Concurrent Data Structures |
| 11:00 - 11:50 |
Kathrin Bringmann (Cologne) |
Ramanujan and asymptotic formulas |
| 12:00 - 14:00 |
lunch |
| 14:00 - 14:15 |
opening of the CNRS silver medal session for Pierre Fraigniaud by Michel Bidoit (CNRS) |
| 14:15 - 15:05 |
David Peleg (Weizmann Institute) |
The Role of Randomness in Local Distributed Decision |
| 15:15 - 15:45 |
coffee break |
| 15:45 - 16:35 |
Sergio Rajsbaum (UNAM, Mexico) |
Computability in Distributed Computing and a Locality Notion -
The missing topic in Turing's Centenary Celebrations |
| 18:00 |
promotion of Maurice Nivat to the grade of Commandeur in the Ordre des Palmes Académiques by Annie Veyre (Université d'Auvergne) |
|
| Thursday, April 25, 2013 |
| 9:30 - 10:00 |
coffee |
| 10:00 - 10:50 |
Gérard Berry (Collège de France) |
Time / space exchange games (pdf slides without animations) |
| 11:00 - 11:50 |
Xavier Leroy (INRIA) |
From functional programming to deductive software verification |
| 12:00 - 14:00 |
lunch |
| 14:00 - 14:50 |
Ohad Kammar (Cambridge) |
A general theory of type-and-effect systems via universal algebra |
| 15:00 - 15:50 |
Mathilde Noual (I3S, Nice) |
Updating automata networks |
| 16:00 - 16:30 |
coffee break |
| 16:30 - 17:20 |
Michał Skrzypczak (Warsaw) |
Descriptive complexity vs. decidability for Monadic Second-Order logic |
|
| Friday, April 26, 2013 |
| 9:30 - 10:00 |
coffee |
| 10:00 - 10:50 |
Ronitt Rubinfeld (MIT and Tel Aviv) |
Something for almost nothing: Advances in sub-linear time algorithms |
| 11:00 - 11:50 |
Mark Braverman (Princeton) |
Information complexity and exact communication bounds |
| 12:00 - 14:00 |
lunch |
| 14:00 - 14:50 |
Nicole Schweikardt (Frankfurt) |
Gaifman's theorem revisited |
| 15:00 - 15:50 |
Howard Straubing (Boston) |
Algebra meets finite model theory |
| 16:00 - 17:00 |
closing |
