Rapport d`activité 2007-2012 - liafa

Transcription

Laboratoire d’Informatique Algorithmique : Fondements et Applications
LIAFA
Rapport d’activités
1 janvier 2007 – 30 juin 2012
er
Laboratoire d’Informatique Algorithmique : Fondements et Applications (LIAFA)
UMR CNRS 7089
Université Paris Diderot - Paris 7
Case 7014
75205 Paris Cedex 13
Tel. +33 (0)1 57 27 92 56
Fax. +33 (0)1 57 27 94 09
[email protected]
http://www.liafa.univ-paris-diderot.fr
Table des matières
Préambule
1
I
Rapport et projet scientifique du LIAFA
3
1
Rapport scientifique du laboratoire
5
2
Projet scientifique du laboratoire
II
29
Algorithms and Complexity team
37
1
Research report: Algorithms and Complexity
39
2
Fiche résumé: Algorithmes et Complexité
45
3
Executive Summary: Algorithms and Complexity
47
4
Research project: Algorithms and Complexity
49
5
List of publications: Algorithms and Complexity
57
6
Appendix: Algorithms and Complexity
67
III
Equipe Algorithmes Distribués et Graphes
77
1
Rapport scientifique : Algorithmes Distribués et Graphes
79
2
Fiche résumé : Algorithmes Distribués et Graphes
85
3
Executive Summary : Distributed Algorithms and Graphs
87
4
Projet scientifique : Algorithmes Distribués et Graphes
89
5
Liste des publications : Algorithmes Distribués et Graphes
95
6
Annexes : Algorithmes Distribués et Graphes
119
i
TABLE DES MATIÈRES
IV
Automata and Applications team
143
1
Research report: Automata and Applications
145
2
Fiche résumé: Automates et applications
151
3
Executive Summary: Automata and Applications
153
4
Research project: Automata and Applications
155
5
List of publications: Automata and Applications
163
6
Appendix: Automata and Applications
181
V
Equipe Combinatoire
199
1
Rapport scientifique : Combinatoire
201
2
Fiche résumé : Combinatoire
207
3
Executive Summary : Combinatorics
209
4
Projet scientifique : Combinatoire
211
5
Liste des publications : Combinatoire
217
6
Annexes : Combinatoire
225
VI
Modeling and Verification team
231
1
Research report: Modeling and Verification
233
2
Fiche résumé: Modélisation et Verification
239
3
Executive Summary: Modeling and Verification
241
4
Research project: Modeling and Verification
243
5
List of publications: Modeling and Verification
251
6
Appendix: Modeling and Verification
265
VII
Bref historique du LIAFA
279
ii
Table des matières détaillée
Préambule
1
I
Rapport et projet scientifique du LIAFA
3
1
5
1.1
Résumé des activités et des résultats de l’unité . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5
1.1.1
Faits marquants 2007-2012 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
5
1.1.2
A propos d’une fusion LIAFA-PPS . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
8
Gouvernance, administration et vie scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . .
8
1.2.1
Gouvernance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
8
1.2.2
Administration et services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
9
1.2.3
Vie scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
10
1.3
Composition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
11
1.4
Budget . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
14
1.5
Le LIAFA dans son environnement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
16
1.5.1
L’université Paris Diderot, l’UFR, la Fédération, et l’Ecole Doctorale . . . . . . . . . . .
16
1.5.2
La Fondation et le LABEX Sciences Mathématiques de Paris . . . . . . . . . . . . . . . .
16
1.5.3
Inria, CEA et Technicolor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
17
1.5.4
Environnement scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
17
1.5.5
Animation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
19
1.5.6
Interdisciplinarité . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
19
1.6
Formation par la recherche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
20
1.7
Vulgarisation et diffusion scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
21
1.8
Valorisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
21
1.9
Annexes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
22
1.9.1
Liste des membres permanents chercheurs et enseignants-chercheurs au 10/09/2012 . . . .
22
1.9.2
Liste des membres du conseil de laboratoire . . . . . . . . . . . . . . . . . . . . . . . . .
24
1.9.3
Règlement intérieur . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
25
1.9.4
Charte d’utilisation des moyens informatiques . . . . . . . . . . . . . . . . . . . . . . . .
27
1.2
2
29
2.1
29
Positionnement scientifique et objectif général . . . . . . . . . . . . . . . . . . . . . . . . . . . .
iii
TABLE DES MATIÈRES DÉTAILLÉE
2.2
2.3
2.4
II
1
3
30
2.2.1
Algorithmique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
31
2.2.2
Systèmes concurrents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
31
2.2.3
Structures et logique, jeux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
32
Rapprochement LIAFA-PPS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
33
2.3.1
Thématiques d’accroche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
33
2.3.2
Séminaire didactique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
34
Analyse SWOT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
35
37
39
1.1
Research areas and main objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
39
1.1.1
Development of the team . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
39
1.1.2
Description of our main scientific results . . . . . . . . . . . . . . . . . . . . . . . . . .
41
Selected results of significance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
42
1.2.1
Streaming algorithms for large XML databases . . . . . . . . . . . . . . . . . . . . . . .
42
1.2.2
Quantum cryptographic protocols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
43
1.3
Scientific service and influence, honors and prizes . . . . . . . . . . . . . . . . . . . . . . . . . .
43
1.4
Internal organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
44
1.2
2
Axes fédérateurs internes et implications externes . . . . . . . . . . . . . . . . . . . . . . . . . .
45
2.1
Effectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
45
2.2
Production scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
45
2.3
Bilan quantitatif . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
45
2.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
45
2.3.2
Logiciels, brevets, rapports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
46
2.3.3
Rayonnement
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
46
2.3.4
Interactions de l’équipe avec son environnement . . . . . . . . . . . . . . . . . . . . . .
46
2.3.5
Actions de formation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
46
47
3.1
Members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
47
3.2
Scientific outcomes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
47
3.3
Quantitative assessment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
47
3.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
47
3.3.2
Software, patents, reports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
48
3.3.3
Influence of the team . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
48
3.3.4
Interactions between the team and its environment . . . . . . . . . . . . . . . . . . . . .
48
3.3.5
Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
48
iv
4
49
4.1
Research objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
49
4.1.1
Scientific outlook . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
49
4.1.2
Our long term scientific goals: Efficiency and Security . . . . . . . . . . . . . . . . . . .
50
4.1.3
Detailed descriptoin of research objectives . . . . . . . . . . . . . . . . . . . . . . . . .
51
Project implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
53
4.2
5
6
57
ACL : Articles in international or national journals . . . . . . . . . . . . . . . . . . . . . . . . . . . .
57
C-INV : Invited talks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
60
C-ACTI : International conference proceedings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
60
C-COM : International or national conferences without proceedings . . . . . . . . . . . . . . . . . . .
64
DO : Editing of journals and other works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
OS : Scientific works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
PV : Popularization works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
AP : Other works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
67
6.1
Composition and team organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
67
6.1.1
Current members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
67
6.1.2
Former members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
68
6.1.3
Visitors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
69
6.1.4
Team organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
69
Grants and research projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
70
6.2.1
Management of international projects . . . . . . . . . . . . . . . . . . . . . . . . . . . .
70
6.2.2
Management of national projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
71
6.2.3
Participation in international projects . . . . . . . . . . . . . . . . . . . . . . . . . . . .
71
6.2.4
Participation in local projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
71
6.2.5
Participation in local projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
71
Research administration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
71
6.3.1
Editorial duties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
71
6.3.2
Management of scientific conferences . . . . . . . . . . . . . . . . . . . . . . . . . . . .
72
6.3.3
Organization of scientific events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
73
6.3.4
Participation in scientific juries and committees . . . . . . . . . . . . . . . . . . . . . . .
73
Teaching, advising, and evaluation activities . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
74
6.4.1
Theses and HdR defended . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
74
6.4.2
Thesis reports . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
74
6.4.3
Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
74
6.2
6.3
6.4
v
III
1
2
3
4
77
79
1.1
Thématique générale et principaux objectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
79
1.1.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
79
1.1.2
Thèmes de recherche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
80
1.2
Exemples de résultats significatifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
80
1.3
Animation scientifique, rayonnement, prix et récompenses . . . . . . . . . . . . . . . . . . . . .
82
1.4
Fonctionnement interne . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
83
1.5
Formation par la recherche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
83
85
2.1
Effectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
85
2.2
Production scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
85
2.3
Bilan quantitatif . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
86
2.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
86
2.3.2
Logiciels, brevets, rapports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
86
2.3.3
Rayonnement
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
86
2.3.4
Interactions de l’équipe avec son environnement . . . . . . . . . . . . . . . . . . . . . .
86
2.3.5
Actions de formation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
86
87
3.1
Members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
87
3.2
Scientific outcomes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
87
3.3
Quantitative assessment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
88
3.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
88
3.3.2
Software, patents, reports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
88
3.3.3
Influence of the team . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
88
3.3.4
Interactions between the team and its environment . . . . . . . . . . . . . . . . . . . . .
88
3.3.5
Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
88
89
4.1
Objectifs scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
89
4.1.1
Théorie de la calculabilité et de la complexité du calcul distribué. . . . . . . . . . . . . .
89
4.1.2
Grands réseaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
91
4.1.3
Algorithmique de graphes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
93
4.1.4
Bioinformatique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
93
Mise en œuvre du projet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
94
4.2
5
95
ACL : Articles dans des revues internationales ou nationales . . . . . . . . . . . . . . . . . . . . . . .
95
C-INV : Conférences invitées . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
vi
C-ACTI : Communications avec actes de conférences internationales . . . . . . . . . . . . . . . . . . 103
C-ACTN : Communications avec actes de conférences nationales . . . . . . . . . . . . . . . . . . . . 114
C-COM : Communications orales sans actes en conférences internationales ou nationales . . . . . . . . 115
DO : Directions d’ouvrages ou de revues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
OS : Ouvrages scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
PV : Publications de vulgarisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
AP : Autres productions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
6
6.1
6.2
6.3
6.4
IV
1
2
119
Composition et vie scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
6.1.1
Liste actuelle des membres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
6.1.2
Anciens membres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
6.1.3
Visiteurs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
6.1.4
Vie de l’équipe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
Contrats et projets scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
6.2.1
Responsabilités de projets internationaux . . . . . . . . . . . . . . . . . . . . . . . . . . 126
6.2.2
Responsabilité de projets nationaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
6.2.3
Participation à des projets internationaux . . . . . . . . . . . . . . . . . . . . . . . . . . 127
6.2.4
Participation à des projets nationaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128
6.2.5
Participation à des projets locaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128
Administration de la recherche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
6.3.1
Activitées éditoriales . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
6.3.2
Gestion scientifique de conférences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
6.3.3
Organisation d’évènements scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . 133
6.3.4
Participant à des comités et jurys scientifiques . . . . . . . . . . . . . . . . . . . . . . . . 133
Activités de formation, encadrement et évaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 134
6.4.1
Liste des thèses et HdR soutenues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134
6.4.2
Listes des rapports de thèses et d’habilitations . . . . . . . . . . . . . . . . . . . . . . . . 135
6.4.3
Enseignement dispensé . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
6.4.4
Autres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
143
145
1.1
Research areas and main objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
1.2
Selected results of significance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
1.3
Scientific service and influence, honors and prizes . . . . . . . . . . . . . . . . . . . . . . . . . . 149
1.4
Internal organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 150
151
vii
3
4
5
2.1
Effectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
2.2
Production scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
2.3
Bilan quantitatif . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
2.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
2.3.2
Logiciels, brevets, rapports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
2.3.3
Rayonnement
2.3.4
Interactions de l’équipe avec son environnement . . . . . . . . . . . . . . . . . . . . . . 152
2.3.5
Actions de formation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
153
3.1
Members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
3.2
Scientific outcomes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
3.3
Quantitative assessment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
3.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
3.3.2
Software, patents, reports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
3.3.3
Influence of the team . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
3.3.4
Interactions between the team and its environment . . . . . . . . . . . . . . . . . . . . . 154
3.3.5
Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
155
4.1
Research objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155
4.2
Project implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 160
163
ACL : Articles in international or national journals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163
C-INV : Invited talks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
C-ACTI : International conference proceedings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170
C-COM : International or national conferences without proceedings . . . . . . . . . . . . . . . . . . . 179
DO : Editing of journals and other works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
OS : Scientific works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
COS : Chapters in scientific works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
PV : Popularization works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180
6
6.1
6.2
181
Composition and team organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
6.1.1
Current members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
6.1.2
Former members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 182
6.1.3
Visitors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184
6.1.4
Team organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184
Grants and research projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
6.2.1
Management of international projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186
viii
6.3
6.4
V
1
6.2.2
Management of national projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
6.2.3
Management of local projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
6.2.4
Participation in international projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
6.2.5
Participation in national projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188
Research administration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
6.3.1
Editorial duties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
6.3.2
Management of scientific conferences . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
6.3.3
Organization of scientific events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
6.3.4
Participation in scientific juries and committees . . . . . . . . . . . . . . . . . . . . . . . 192
Teaching, advising, and evaluation activities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
6.4.1
Theses and HdR defended . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
6.4.2
Thesis and habilitation reports . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194
6.4.3
Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
6.4.4
Prices and distinctions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
Equipe Combinatoire
1.1
3
201
Thématique générale et principaux objectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
1.1.1
2
199
Constitution de l’équipe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
1.2
Exemples de résultats significatifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203
1.3
Animation scientifique, rayonnement, prix et récompenses . . . . . . . . . . . . . . . . . . . . . 205
1.4
Fonctionnement interne . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205
207
2.1
Effectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207
2.2
2.3
2.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
2.3.2
Rayonnement
2.3.3
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
209
3.1
Members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
3.2
3.3
3.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210
3.3.2
3.3.3
3.3.4
Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 210
ix
4
4.1
4.2
5
211
Objectifs scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
4.1.1
Auto-évaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
4.1.2
Evolution par rapport à la période précédente . . . . . . . . . . . . . . . . . . . . . . . . 211
4.1.3
Objectifs de l’équipe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211
4.1.4
Programme prévu dans le contexte local, national et international . . . . . . . . . . . . . 212
4.1.5
Prospective, positionnement dans la communauté scientifique, et évolution à moyen terme 212
4.1.6
Prospective, positionnement dans la communauté scientifique, d’évolution à long terme . . 213
Mise en œuvre du projet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 214
4.2.1
Politique scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 214
4.2.2
Partenariats dans la recherche et l’enseignement supérieur . . . . . . . . . . . . . . . . . 214
4.2.3
Vie de l’équipe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 214
4.2.4
Recherche de moyens . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
4.2.5
Diffusion des résultats . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
217
ACL : Articles dans des revues internationales ou nationales . . . . . . . . . . . . . . . . . . . . . . . 217
C-INV : Conférences invitées . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220
C-ACTI : Communications avec actes de conférences internationales . . . . . . . . . . . . . . . . . . 220
C-COM : Communications orales sans actes en conférences internationales ou nationales . . . . . . . . 222
6
6.1
6.2
6.3
6.4
225
Composition et vie scientifique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
6.1.1
Liste actuelle des membres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
6.1.2
Anciens membres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 226
6.1.3
Visiteurs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 226
6.1.4
Vie de l’équipe . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 226
Contrats et projets scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227
6.2.1
Responsabilité de projets nationaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227
6.2.2
Participation à des projets internationaux . . . . . . . . . . . . . . . . . . . . . . . . . . 227
6.2.3
Participation à des projets nationaux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227
Administration de la recherche . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
6.3.1
Activités éditoriales . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
6.3.2
Gestion scientifique de conférences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
6.3.3
Organisation d’événements scientifiques . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
6.3.4
Participant à des comités et jurys scientifiques . . . . . . . . . . . . . . . . . . . . . . . . 228
Activités de formation, encadrement et évaluation . . . . . . . . . . . . . . . . . . . . . . . . . . 229
6.4.1
Liste des thèses et HdR soutenues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
6.4.2
Enseignement dispensé . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
x
VI
1
2
3
4
5
231
233
1.1
General context and objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
1.2
Main results in the period 2007-2012 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
1.3
Scientific services, international visibility, and collaborations . . . . . . . . . . . . . . . . . . . . 236
1.4
Internal organization and management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
239
2.1
Effectifs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
2.2
2.3
2.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
2.3.2
Logiciels, brevets, rapports, etc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
2.3.3
Rayonnement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240
2.3.4
Interactions de l’équipe avec son environnement . . . . . . . . . . . . . . . . . . . . . . 240
2.3.5
241
3.1
Members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
3.2
3.3
3.3.1
Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
3.3.2
3.3.3
3.3.4
Interactions between the team and its environment . . . . . . . . . . . . . . . . . . . . . 242
3.3.5
Educational activities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 242
243
4.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243
4.2
Reasoning about complex data structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244
4.3
Concurrent and distributed systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
4.4
Malware detection
4.5
Quantitative Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
4.6
Implementation of the project . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 246
251
ACL : Articles in international or national journals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251
C-INV : Invited talks/papers in international conferences and workshops . . . . . . . . . . . . . . . . . 253
C-ACTI : International conference proceedings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 253
C-ACTI : International workshop proceedings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 262
C-COM : Talks at conferences without proceedings or upon-invitation-only meetings . . . . . . . . . . 262
xi
DO : Editing of journals and other works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
COS : Chapters in scientific works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
6
6.1
6.2
6.3
6.4
6.5
VII
265
Composition and team organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
6.1.1
List of current members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
6.1.2
Former members . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266
6.1.3
Visitors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 267
6.1.4
Team organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 267
Grants and research projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
6.2.1
Coordination of international projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
6.2.2
Coordination of national projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
6.2.3
Participation in international projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
6.2.4
Participation in national projects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270
Research administration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270
6.3.1
Editorial activities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270
6.3.2
Scientific management of conferences . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270
6.3.3
Organization of scientific events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273
6.3.4
Participation in scientific juries and committees . . . . . . . . . . . . . . . . . . . . . . . 273
International visibility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274
6.4.1
Invited talks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274
6.4.2
Participation in upon-invitation-only scientific meetings . . . . . . . . . . . . . . . . . . 275
6.4.3
Invited stays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275
Educational, advising, and evaluation activities . . . . . . . . . . . . . . . . . . . . . . . . . . . 276
6.5.1
List of defended PhD theses and Habilitations . . . . . . . . . . . . . . . . . . . . . . . . 276
6.5.2
Reports on PhD and Habilitation theses . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
6.5.3
Educational activities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
279
xii
Préambule
Ce document décrit les activités scientifiques et administratives du Laboratoire d’Informatique Algorithmique : Fondements et Applications (LIAFA), UMR 7089 CNRS – Université Paris Diderot (Paris 7),
pour la période allant de janvier 2007 à juin 2012 (voir historique du laboratoire en partie VII). Il inclut
en Partie I un bilan scientifique et administratif des activités du laboratoire durant cette période, ainsi
qu’une description du projet scientifique général du LIAFA pour le prochain quinquennat. La description détaillée des activités scientifiques de chacune des équipes de recherche du LIAFA est fournie dans
les rapports des cinq équipes du laboratoire, dans les cinq parties suivantes II à VI du document. Chaque
rapport d’équipe inclut un bilan détaillé des activités de l’équipe sur la période couverte par le rapport,
ainsi qu’un projet de recherche détaillé, spécifique à l’équipe, pour le prochain quinquennat.
Je tiens à remercier tous les membres du laboratoire, les chercheurs, enseignants-chercheurs, doctorants
et post-doctorants, ainsi que le personnel administratif et technique. Le LIAFA ne saurait être ce qu’il est
sans la participation active de chacun d’entre eux, et je tiens à exprimer le plaisir que j’ai eu et la fierté
que j’éprouve à exercer la responsabilité d’un tel laboratoire. Je tiens également à remercier les responsables des cinq équipes de recherche du laboratoire, Ahmed Bouajjani, Sylvie Corteel, Carole Delporte,
Miklos Santha, et Olivier Serre, pour le travail considérable qu’ils ont fourni lors de la rédaction de ce
rapport. Je souhaite également exprimer ma reconnaissance à Enrica Duchi, Peter Habermehl, Frédéric
Magniez, Fabien Mathieu et Olivier Serre pour leur aide absolument indispensable et le travail précieux
qu’ils ont fourni pour collecter et gérer les publications de tous les membres du laboratoire. Je souhaite
tout particulièrement exprimer ma profonde gratitude envers Frédéric Magniez et Olivier Serre pour leur
implication dans la rédaction de ce document. Leur aide scientifique et technique n’a pas seulement été
précieuse, elle a été absolument cruciale, et ce document n’aurait pas pu voir le jour sans leur implication. Je tiens bien sûr aussi à exprimer le plaisir immense que j’ai pris à travailler avec Valérie Berthé,
directrice adjointe du laboratoire, non seulement pour la rédaction de ce document mais aussi tout au
long de notre collaboration à la direction du laboratoire. Je tiens enfin tout particulièrement à remercier très chaleureusement Noëlle Delgado, pour le travail considérable et souvent très délicat de collecte
de données qu’elle a dû fournir pour la rédaction des documents administratifs et financiers liées à ce
rapport. Son implication a été absolument essentielle.
31/08/2012
Pierre Fraigniaud
Directeur du LIAFA
1
2
Partie I
Rapport et projet scientifique
du LIAFA
3
Chapitre 1
1.1
Résumé des activités et des résultats de l’unité
Le Laboratoire d’Informatique Algorithmique : Fondements et Applications (LIAFA) est une unité mixte
de recherche (UMR 7089) du Centre National de la Recherche Scientifique (CNRS) et de l’Université
Paris Diderot - Paris 7. Le laboratoire compte actuellement 60 membres permanents, se répartissant en
34 enseignant-chercheurs, 24 chercheurs CNRS et 2 chercheurs INRIA. L’effectif total du laboratoire,
incluant doctorants, post-doctorants, personnel administratif et technique, et visiteurs de longue durée
s’élève à près de 110 personnes (voir section 1.3).
Les principales thématiques de recherche du LIAFA ont trait à l’informatique fondamentale, et se
déclinent autour de cinq équipes de recherche :
• Algorithmes et complexité – responsable : Miklos Santha (DR CNRS)
• Algorithmique distribuée et graphes – responsable : Carole Delporte (Professeur)
• Automates et applications – responsable : Olivier Serre (CR CNRS)
• Combinatoire – responsable : Sylvie Corteel (DR CNRS)
• Modélisation et vérification – responsable : Ahmed Bouajjani (Professeur)
Le LIAFA est membre de la Fondation Sciences Mathématiques de Paris (SMP), et membre du LABEX Sciences Mathématiques de Paris issu de cette fondation. Le LIAFA est également membre de la
Fédération de Recherche en Mathématiques Paris centre (FR2830) du CNRS. Il héberge l’équipe-projet
INRIA « GANG » au sein de l’équipe Algorithmique distribuée et graphes.
La direction du laboratoire durant la période couverte par ce rapport a été exercée successivement par
Jean-Eric Pin, jusqu’à décembre 2007, puis par Michel Habib de janvier 2008 à décembre 2009, et,
depuis janvier 2010, par Pierre Fraigniaud.
1.1.1
Faits marquants 2007-2012
• Environ 380 publications dans des revues internationales, et environ 430 publications dans des
actes de conférences internationales 1 .
• 12 « Best Paper Award », aux conférences SPAA 2007, ICALP 2008, CIAA 2008, DISC 2009,
FORMATS 2009, FPSAC 2009 (« best student paper award »), ICDCN 2009, DISC 2011, ICALP
2011, Int. Conf. on Petri Nets 2011, ETAPS 2012, et ICDT 2012 (« best newcomer paper »).
• Deux « Starting Grants » de l’ERC : Thomas Colcombet (2010) et Iordanis Kerenidis (2012 2 ).
• Responsabilité de deux Laboratoires Européens Associés (LEA) :
• STRUCO avec Charles University, Prague (Jean-Sébastien Sereni, CR CNRS).
• FILOFOCS avec Tel-Aviv University (Adi Rosén, DR CNRS).
• Médaille de bronze CNRS 2010 (Thomas Colcombet, CR CNRS) et médaille d’argent CNRS
2012 (Pierre Fraigniaud, DR CNRS).
1. Soit près de trois publications par an et par permanents, sur la base de 60 permanents durant le quinquennat.
2. Début officiel du projet : 1er janvier 2013.
5
CHAPITRE 1. RAPPORT SCIENTIFIQUE DU LABORATOIRE
Déménagement interne à Chevaleret (septembre 2010). Le retour des laboratoires de mathématiques
de l’UPMC sur le campus de Jussieu a libéré des locaux à Chevaleret, ce qui a permis au LIAFA,
après restructuration, de gagner en surface à la rentrée 2010. Le LIAFA devrait entrer dans ses
locaux définitifs du bâtiment Sophie Germain 3 du campus de l’université Paris Diderot fin 2012 début 2013 (voir figures 1.1 et 1.2). Ce dernier déménagement devrait enfin résoudre, au moins
pour un temps, un problème récurrent d’espace empoisonnant la vie du LIAFA depuis de nombreuses années. 4
F IGURE 1.1 – Le bâtiment Sophie Germain (emplacement marqué d’une croix rouge)
Création de l’équipe Combinatoire (janvier 2011). Le conseil de laboratoire du LIAFA a donné
son accord fin 2010 pour la création de l’équipe Combinatoire. Cette création reconnaissait
l’émergence d’une activité importante et pleinement autonome au sein du LIAFA sur cette
thématique, et répondait à la nécessité d’affirmer vis-à-vis de l’extérieur l’activité combinatoire
au LIAFA.
Accueil de l’équipe Algorithmes et complexité (novembre 2010). La restructuration des locaux de
Chevaleret à la rentrée 2010 mentionnée ci-dessus a permis de finaliser fin 2010 une opération
scientifique d’envergure, à savoir, la mutation au LIAFA de six membres du LRI : Michel De Rougemont (Pr, Pantheon-Assas), Julia Kempe (DR CNRS), Iordanis Kerenidis (CR CNRS), Frédéric
Magniez (DR CNRS), Adi Rosén (DR CNRS), et Miklos Santha (DR CNRS). L’arrivée de ces
chercheurs au LIAFA a naturellement conduit le laboratoire à créer une cinquième équipe : Algorithmes et complexité. Cette opération stratégique d’importance répondait au besoin pour le
LIAFA de développer des activités conséquentes en algorithmique. Elle n’aurait pu être menée à
bien sans une coordination constructive de la part du CNRS lors des négociations entre le LRI et le
LIAFA 5 . L’université Paris Diderot a fortement soutenu cette opération scientifique en répondant
positivement à la demande de l’UFR Informatique de création d’un poste de professeur sur les
thèmes de la nouvelle équipe. Cette création a ainsi permis de finaliser la mutation de l’équipe de
Paris Sud à Paris Diderot grâce au recrutement en juin 2012 de Sophie Laplante (Pr Paris Diderot).
3. Marie-Sophie Germain (1776-1831) est l’une des premières mathématiciennes françaises. Autodidacte, elle se procure
les cours de l’École polytechnique, réservée aux hommes, en empruntant l’identité d’un ancien élève. Elle envoie ses remarques
à Joseph-Louis Lagrange, qui finit par découvrir l’imposture en la convoquant du fait de ses brillantes réponses. (Source :
Wikipédia).
4. Toutes les négociations avec l’université Paris Diderot liées aux locaux pour l’informatique ont été menées par François
Laroussinie et Jean-Marie Rifflet pour l’UFR Informatique, Thomas Ehrhard pour PPS et Pierre Fraigniaud pour le LIAFA.
5. Pierre Fraigniaud tient à exprimer toute sa reconnaissance envers Philippe Dague (directeur du LRI) qui, par sa courtoisie, a permis aux négociations entre les deux laboratoires, sous couvert du CNRS, de se dérouler dans un climat de parfaite
sérénité.
6
F IGURE 1.2 – Le campus de l’université Paris Diderot
7
1.1.2
A propos d’une fusion LIAFA-PPS
Mi-2010, l’institut INS2I du CNRS a invité les directeurs des deux laboratoires LIAFA et PPS à engager des discussions afin d’envisager une potentielle fusion des deux unités, idéalement à l’horizon
2014. Cette demande était motivée par la proximité thématique entre les deux laboratoires, tous deux
focalisés sur des thématiques d’informatique fondamentale. Un des objectifs principaux était ainsi de
créer une unité d’Informatique avec une forte visibilité au sein de l’Université Paris Diderot couvrant
une grande partie du spectre de l’Informatique Fondamentale. Cette invitation a conduit à la constitution d’un comité « fusion » constitué de Valérie Berthé (LIAFA), Pierre-Louis Curien (PPS), Roberto
Di Cosmo (PPS), Thomas Ehrhrard (PPS), Pierre Fraigniaud (LIAFA), François Laroussinie (LIAFA),
Anne Micheli (LIAFA), Olivier Serre (LIAFA), et Daniele Varacca (PPS). Ce comité a pendant plusieurs
mois réfléchi aux avantages et inconvénients d’une fusion LIAFA-PPS, ainsi qu’au mode de fonctionnement d’une potentielle unité résultant de la fusion des deux laboratoires. Il a rédigé début 2012 un
compte-rendu détaillé de ses discussions, résumant ces avantages et inconvénients, diffusé à l’ensemble
des membres des deux laboratoires. Très sommairement, les conclusions du rapport soulignent l’avantage d’un gain en visibilité en cas de fusion, avec comme inconvénient majeur de devoir faire cohabiter
deux structures aux modes de fonctionnement très différents. Ce compte-rendu a été discuté en AG
dans chacun des deux laboratoires en mars 2012. Sont apparues durant ces discussions une inquiétude
majeure concernant les différences entre les structures et les fonctionnements respectifs des deux laboratoires, ainsi que des craintes concernant le positionnement Math-Info du laboratoire PPS. Les directions
des deux laboratoires se sont néanmoins ouvertement prononcées en faveur de la fusion et ont expliqué
leur position dans une lettre commune diffusée à l’ensemble des membres des deux laboratoires. Les
membres permanents du LIAFA et de PPS ont été invités à voter le 4 avril 2012 dans chacun de leur
laboratoire, pour ou contre la fusion au 01/01/2014.
Les résultats du vote ont été « oui » à la fusion pour 60% des 48 bulletins exprimés au LIAFA, et
« non » à la fusion pour 59% des 32 bulletins exprimés à PPS. Ces résultats ont conduit les directeurs
des deux laboratoires à rejeter la fusion puisque celle-ci ne recueillait pas l’assentiment de chacune des
deux unités. Il ressort toutefois des discussions informelles ou lors des AG que le vote « non » étaient
souvent motivés par l’absence de collaborations scientifiques effectives entre les deux laboratoires. Cet
état de fait réel ne reflète néanmoins pas le potentiel de collaborations existant entre le LIAFA et PPS.
Les deux laboratoires ont donc entrepris de laisser de côté les aspects administratifs liés aux structures,
et de travailler sur les points d’accroche scientifique. Un comité scientifique (incluant des membres de
l’équipe Logique de l’IMJ), co-présidé par Paul-André Mellies (PPS) et Olivier Serre (LIAFA), a ainsi
été créé en mai 2012 dans le but de lancer et de développer des actions inter-laboratoires. Le travail de
ce comité a permis de rédiger un projet scientifique commun aux deux unités, inclus dans leurs rapports
d’activités respectifs. Ce texte se trouve en section 2.3 du présent rapport.
1.2
1.2.1
Gouvernance, administration et vie scientifique
Gouvernance
La direction du laboratoire est assurée par son directeur, Pierre Fraigniaud, assisté d’une directrice adjointe, Valérie Berthé (voir l’organigramme en figure 1.3). La direction est conseillée par un conseil de
direction qui réunit, outre le directeur et la directrice adjointe, les responsables des équipes du laboratoire (voir section 1.1). Ce conseil aide la direction pour la prise de décisions rapides (arbitrage entre
demandes de ressources, affectation des bureaux, etc.). Il permet la diffusion de l’information de la direction vers les équipes, et de faire remonter tous types de demandes des équipes à la direction. Le conseil
de laboratoire est en charge des décisions administratives ou scientifiques engageant le laboratoire sur
le long terme (création d’équipe, élection du directeur, etc.). Souvent organisé en AG du laboratoire, il
permet également la diffusion de l’information de la direction directement vers les membres de l’unité.
8
Direction du laboratoire
- Pierre Fraigniaud (directeur)
- Valérie Berthé (directrice adjointe)
Conseil de direction
Direction + responsables d'équipes
Conseil de laboratoire
Direction + membres élus
Equipe Algorithmes et complexité
Responsable : Miklos Santha
Service administratif
Responsable : Noelle Delgado
Equipe Algorithmique distribuée et graphes
Responsable : Carole Delporte
Service informatique
Responsable : Laifa Ahmadi
Equipe Automates et applications
Responsable : Olivier Serre
Commissions :
- matériel
- web
- doctorants
- locaux
- bibliothèque
- etc.
Equipe Combinatoire
Responsable : Sylvie Corteel
Equipe Modélisation et vérification
Responsable : Ahmed Bouajjani
F IGURE 1.3 – Organigramme du LIAFA
Outre les différents conseils mentionnés ci-dessus, la diffusion de l’information s’effectue directement de
la direction aux membres du laboratoire (permanents et/ou non-permanents, selon le type d’information)
par courrier électronique via les différentes listes de diffusion du LIAFA. Les informations diffusées incluent entre autres les appels relatifs aux allocations de thèse, les appels à projets (Europe, ANR, Région
IdF, Ville de Paris, etc.), les offres de bourses post-doctorales, et, bien sûr les différents programmes de
la Fondation Sciences Mathématiques de Paris.
1.2.2
Administration et services
Le laboratoire dispose d’un secrétariat, composé de Noëlle Delgado (AI CNRS), responsable administrative, et de Nathalie Rousseau 6 (AJT CNRS), secrétaire gestionnaire. Le secrétariat est en charge de
toutes les tâches administratives et financières liées au fonctionnement du LIAFA, dont en particulier
la gestion des missions, la gestion financière de l’ensemble des contrats, et la gestion financière des
personnels sur contrat (doctorants, post-doctorants, invités, etc.).
Le service informatique du LIAFA est composé de Laifa Ahmadi (IR CNRS) et de Houy Kuoy (IE
CNRS). Il a principalement en charge la gestion du réseau et des terminaux légers (TX), la gestion des
serveurs de fichiers et des sauvegardes, et l’aide aux utilisateurs, dont en particulier les demandes de devis pour l’achat de matériels individuels sur ressources propres. Notons que le LIAFA a récemment
rejoint la plateforme informatique visant à fédérer la gestion informatique entre les laboratoires de
mathématiques et d’informatique devant rejoindre le bâtiment Sophie Germain du campus de Paris Diderot. La migration de la gestion de la messagerie et du web 7 est effectuée, et la migration des serveurs
de fichiers devrait se faire au second semestre 2012.
Le LIAFA possède également un ensemble de commissions en charge de questions spécifiques :
• Commission « matériel » : arbitrage et prospective relatifs aux achats de matériel informatique
6. Recrutement NOEMI, juillet 2010.
7. Incluant le passage des adresses liafa.jussieu.fr aux adresses liafa.univ-paris-diderot.fr.
9
•
•
•
•
pour le laboratoire — président : Fabien de Montgolfier (MdC, Paris Diderot).
Commission « web » : en charge des pages web du laboratoire — président : David Xiao (CR
CNRS), inclus les responsables communication du laboratoire (voir ci-après).
Commission « doctorants » : points de contact pour les doctorants 8 — Coordinatrice : Valérie
Berthé (DR CNRS).
Commission « locaux » : décide de l’affectation des bureaux aux membres — président : Pierre
Fraigniaud (DR CNRS) et composée de François Laroussinie (Pr, Paris Diderot), Noëlle Delgado
(AI CNRS), un(e) représentant(e) par équipe, un(e) représentant(e) doctorant.
Commission « bibliothèque » : en charge des achats relatifs à la bibliothèque math-info de l’université — correspondant pour le LIAFA : Olivier Serre (CR CNRS).
Par ailleurs le laboratoire s’est doté d’un service de communication sous la responsabilité scientifique
de Sylvie Corteel et la responsabilité administrative de Noëlle Delgado.
Enfin, le laboratoire dispose d’un comité hygiène et sécurité dont le correspondant est Noëlle Delgado, et
les ACMO Noëlle Delgado (AI CNRS), Frédéric Magniez (DR CNRS), et Christian Konrad (doctorant).
1.2.3
Vie scientifique
La vie scientifique du laboratoire est essentiellement centrée autour de ses équipes de recherche, et en
particulier des séminaires hebdomadaires et des groupes de travail de ces équipes. Il convient de noter
que les séminaires des équipes sont publics et ouverts à tous, membres du laboratoire ou extérieurs.
Ces séminaires jouent ainsi un rôle de passerelles entre les équipes, en particulier pour les membres
du laboratoires dont les thèmes de recherche se situent à l’interface entre plusieurs équipes. Outre ces
séminaires d’équipe, notons que de nombreux groupes de travail et groupes de lecture sont organisés au
sein du laboratoire.
Les séminaires hebdomadaires d’équipe sont les suivants :
•
•
•
•
Séminaire « Algorithmes et complexité », mardi 11h – responsable Adi Rosén.
Séminaire « Algorithmique distribuée et graphes », mardi 14h – responsable Pierre Charbit.
Séminaire « Automates », vendredi 14h30 – responsables Christiane Frougny et Sylvain Perifel.
Séminaire « Combinatoire énumérative et analytique », jeudi 12h – responsables Sylvie Corteel
et Vlady Ravelomanana.
• Séminaire « Vérification », lundi 11h – responsables Ahmed Bouajjani et Constantin Enea.
Les frontières entre les équipes sont de fait extrêmement poreuses, et les exemples ne manquent pas de
passages d’un membre du laboratoire d’une équipe à une autre. Il est à souligner que les découpages
entre les équipes, qui se sont faits naturellement sur des bases principalement scientifiques, reposent
également sur des bases historiques (par exemple, entre les équipes Algorithmes et complexité et Algorithmique distribuée et graphes). Il n’est ainsi pas à exclure des modifications dans les années à venir
concernant le découpage entre équipes. Le groupe de travail « Complexité », animé pendant presque
deux ans par Sylvain Perifel, et réunissant des membres de toutes les équipes du laboratoire, est un
exemple typique de travaux inter-équipes au sein du laboratoire 9 . D’autres groupes de travail interéquipes, sur les systèmes dynamiques et sur les jeux, devraient prochainement voir le jour. Les participations inter-équipes à des projets ANR sont loin d’être l’exception ; notons par exemple les projets
8. A distinguer de l’évaluation des étudiants à mi-parcours, mise en place par l’ED, en coordination avec le laboratoire. Les
membres de cette commission sont de jeunes membres du laboratoire auprès desquels les doctorants ne devraient pas hésiter à
se confier en cas de problèmes : Guillaume Chapuy (CR CNRS), Mihaela Sighireanu (MdC), Frédéric Magniez (DR CNRS).
9. Ce GT s’est principalement organisé sous la forme d’un groupe de lecture du livre d’Arora et Barak Computational
Complexity : a Modern Approach, 2009, sur la complexité. Il réunissait des membres du LIAFA et de l’équipe de logique
mathématique de l’IMJ, plus quelques extérieurs. Il s’est réuni une petite trentaine de fois entre mars 2010 à début 2011.
10
« Blancs » NeTOC, RDAM et AlgoPol, les deux premiers entre l’équipe Algorithmes et complexité et
l’équipe Algorithmique distribuée et graphes, et le troisième entre l’équipe Algorithmique distribuée et
graphes et l’équipe Automates et applications. Il convient enfin de souligner l’existence d’un séminaire
« Thésards », commun aux laboratoires LIAFA et PPS. Ce séminaire est destiné en priorité aux doctorants et a, en particulier, vocation à les ouvrir à la diversité des thèmes de recherche en informatique
fondamentale.
Enfin, le LIAFA organise chaque année une journée des entrants, qui peut en fait devoir se dérouler
sur plusieurs jours, sous la responsabilité actuelle de Florian Horn (CR CNRS). Durant cette ou ces
journées, les nouveaux entrants au laboratoire, enseignants-chercheurs, chercheurs, doctorants, postdoctorants, visiteurs de longue durée, sont invités à présenter leur travaux, brièvement bien sûr lorsqu’il
s’agit d’un doctorant n’ayant pas encore débuté sa thèse.
1.3
Composition
Le laboratoire a considérablement évolué en taille dans la période 2007-2012, passant d’environ 70
membres en 2007 à presque 110 membres en 2012 (voir la figure 1.4 et la liste exhaustive des membres
permanents en section 1.9.1).
120 Divers 100 Post Doc 80 Doct ITA 60 CR 40 DR MdC 20 Pr 0 2007 2008 2009 2010 2011 2012 F IGURE 1.4 – Effectif complet du LIAFA
Cet accroissement de l’effectif du LIAFA est principalement lié à la conjonction de trois phénomènes :
1. la poursuite d’une politique volontariste de recrutement CNRS,
2. l’arrivée de l’équipe “Algorithmes et complexité” au 1er novembre 2010,
3. l’accroissement du nombre de doctorants et de post-doctorants.
Le LIAFA s’implique très fortement, tant pour attirer d’excellents candidats, que pour les aider
à présenter leur candidature lors des concours de recrutement CNRS. Cette politique volontariste,
conjuguée au soutien du CNRS, a ainsi permis le recrutement de 8 CR 10 et 1 DR 11 entre 2007 et
2011. Notons néanmoins qu’en 2012, comme déjà partiellement en 2011, le CNRS a mis en œuvre
une réaffectation systématique dans d’autres laboratoires des recrues CR présentées par le LIAFA. Si le
laboratoire comprend la politique d’affectation du CNRS visant à répartir les ressources entre les laboratoires, il tient à souligner que la qualité des candidats soutenus par le LIAFA résulte de l’attractivité
du laboratoire à l’étranger 12 et auprès des grands laboratoires nationaux, et de la formation reçue par les
candidats lors, typiquement, d’un séjour post-doctoral d’un ou deux ans au LIAFA. Ainsi, le laboratoire
tient à exprimer son inquiétude quant à la poursuite de la politique systématique de réaffectation mis en
10. Laurent Bienvenu, Guillaume Chapuy, Florian Horn, Łukasz Kaiser, Amos Korman, Jean-Sébastien Sereni, Nicolas
Trotignon, et David Xiao.
11. Mai Gehrke.
12. Parmi les derniers recrutements CNRS au LIAFA, on trouve un américain, un israélien, un polonais et une hollandaise,
ayant tous effectué leur thèse à l’étranger.
11
œuvre par le CNRS en 2012, qui pourrait conduire à réduire l’attractivité du LIAFA. Un équilibre devra
donc être trouvé dans les prochaines années entre la politique générale de recrutement de l’INS2I et la
politique spécifique de recrutement du LIAFA 13 .
20 18 16 14 Pr 12 MdC 10 8 DR 6 CR 4 2 0 2007 2008 2009 2010 2011 2012 F IGURE 1.5 – Effectifs LIAFA : permanents
L’arrivée de l’équipe “Algorithmes et complexité” a été présentée dans la section 1.1. Plusieurs mutations vers le laboratoire 14 ont également eu lieu dans la même période. Il en résulte que de 20% des
membres en 2007, presque 40% des membres du laboratoire en 2012, sont CNRS (voir la figure 1.5),
pour un effectif total d’environ 60 chercheurs et enseignants-chercheurs. En particulier, l’accroissement
du nombre de DR est dû à la conjonction de plusieurs faits : arrivée de l’équipe “Algorithmes et complexité”, recrutement DR2 (Mai Gehrke), mutations (Valérie Berthé), et promotions internes (Nicolas
Schabanel et Sylvie Corteel).
Aux deux phénomènes mentionnés ci-dessus s’ajoute le doublement du nombre de doctorants et de
post-doctorants au sein du laboratoire (voir la figure 1.6), passant d’un vingtaine à une quarantaine,
augmentant par là le taux d’encadrement 15 de 1,0 à 1,2 entre 2007 et 2012, malgré la croissance du
nombre d’habilités d’une vingtaine à plus de trente dans la même période. A cet accroissement s’ajoute
la présence d’une petite dizaine de post-doctorants dans le laboratoire depuis deux ans, pour la plupart
étrangers. Ce phénomène est principalement lié à la présence de la Fondation SMP et à la participation
du LIAFA au LABEX éponyme (voir la section 1.5), et au succès des membres du laboratoire auprès
de l’ANR et de l’ERC. Le laboratoire a en particulier augmenté la diversité d’origine de ses doctorants,
incluant de nombreux étudiants étrangers, parfois en co-tutelle.
La figure 1.7 ne reflète pas encore d’augmentation du nombre de soutenances de doctorats puisque les
étudiants entrés en thèse en 2011 ou 2012 n’ont évidemment pas encore soutenu. Le relativement faible
nombre d’HDR soutenues doit être rapporté au fait que presque la moitié des membres du laboratoire
ont moins de 40 ans, dont 11 recrutés durant les cinq dernières années. (Notons que deux des thèses
soutenues en 2012 le seront en septembre, et les deux HDR 2012 seront soutenues au second semestre.)
Notons également que le laboratoire accueille, en moyenne annuelle, une dizaine d’invités de moyenne
durée (1 à 2 mois), généralement financés par l’université Paris Diderot (rubrique « professeurs invités »), par la fondation SMP, ou directement par les équipes sur leurs ressources propres, et non comptabilisés dans la figure 1.4.
13. Notons de surcroı̂t que les CR CNRS recrutés au LIAFA n’ont pas forcément vocation à effectuer toute leur carrière
au laboratoire, comme en témoignent les mutations récentes, pour des raisons à la fois familiales et scientifiques, d’un CR1
(Nicolas Trotignon) en 2011 au LIP, et d’un CR2 (Jean-Sébastien Sereni) en 2012 au LORIA. Ces départs se rajoutent à celui
d’une CR2 (Emmanuelle Lebhar) en 2010 vers l’éducation nationale.
14. Valérie Berthé, Thomas Colcombet, Sylvie Corteel, Mathieu Raffinot, Nicolas Schabanel.
15. Nombre d’étudiants membres du laboratoire à l’année x divisé pas le nombre de permanents habilités du laboratoire à
cette même année x. Notons que de nombreuses thèses sont en fait co-encadrées par un-e non habilité-e.
12
45 40 35 30 25 Doct 20 Post Doc 15 10 5 0 2007 2008 2009 2010 2011 2012 F IGURE 1.6 – Effectifs LIAFA : doctorants et post-doctorants
7 6 5 4 Thèses 3 HDR 2 1 0 2007 2008 2009 2010 2011 2012 F IGURE 1.7 – Nombre de thèses et HDR soutenues
La figure 1.5 montre également l’effort consenti par l’université Paris Diderot envers le LIAFA. En
particulier, le laboratoire a bénéficié de quatre postes de professeurs 16 dont deux « créations », et de
quatre postes de Maitres de Conférence 17 , dont deux « créations ». Bien évidemment, cet effort est
amplement justifié par l’énorme investissement en enseignement de l’UFR d’Informatique au sein de
l’université Paris Diderot.
Politique de recrutement d’enseignants-chercheurs au LIAFA. La politique de recrutement des
enseignants-chercheurs au LIAFA est tournée quasi-exclusivement vers l’extérieur — un seul recrutement interne depuis 2007 sur les 7 postes ouverts au concours à Paris Diderot pour le LIAFA, avec un
candidat extérieur classé sur chaque première ligne des 7 concours. Notons qu’en cas de non réciprocité
dans les autres établissements universitaires, cette politique pourrait potentiellement trouver ses limites,
ce qui irait à l’encontre du fil conducteur de la politique de recrutement du LIAFA auquel le laboratoire souhaite se tenir. Le laboratoire est particulièrement sensible à cette situation, surtout lorsque l’on
considère la pyramide des âges des personnels (voir figure 1.8). En effet, on peut observer que si les
doctorants formés au LIAFA et désirant poursuivre une carrière académique ont été en mesure entre
2007 et 2012 d’obtenir des postes de chercheurs ou d’enseignants-chercheurs dans d’autres universités,
16. A savoir, un accroissement de deux unités du nombre de professeurs entre le 01/01/2007 et le 30/06/2012 : deux recrutements extérieurs à Paris Diderot (François Laroussinie et Vlady Ravelomanana), et une promotion interne à Paris Diderot
(Carole Delporte) — combinés à l’arrivée de Michel de Rougemont (Pantheon-Assas), au départ en retraite de Luc Boasson
en octobre 2009, et à la fin de l’éméritat de Maurice Nivat ; le recrutement de Sophie Laplante, prenant acte au 01/09/2012
n’apparaı̂t pas sur la figure.
17. A savoir, Aldric Degorre, Constantin Enea, Sylvain Perifel, et Arnaud Sangnier — combinés au départ de Thierry Cachat
en disponibilité dans l’industrie, à celui d’Antoine Meyer sur une chaire CNRS à l’université Paris-Est, à la promotion de Carole
Delporte, et au détachement de Dominique Poulalhon au LIX.
13
la promotion au titre de professeur des maı̂tres de conférences habilités et qualifiés du LIAFA semble
s’effectuer avec plus de difficulté, malgré des dossiers de très grande qualité.
18 16 14 12 10 UNIVERSITE 8 CNRS/INRIA 6 ITA 4 2 0 ≤ 30 31-‐40 41-‐50 51-‐60 >60 F IGURE 1.8 – Histogramme des âges des personnels permanents du LIAFA. Parmi les enseignantschercheurs de plus de 60 ans, trois sont émérites.
1.4
Budget
Le budget du laboratoire dépend essentiellement de quatre sources de financement : les deux tutelles
(CNRS et Université Paris Diderot), l’ANR, et l’UE. Les ressources issues des tutelles se répartissent
en subventions directes et en subventions sur projets. Les subventions directes sont relativement stables
depuis 2007 : environ 120Ke par an pour Paris Diderot, et entre 50 et 60Ke par an pour le CNRS,
avec une diminution notable en 2012. Les subventions des tutelles sur projet, principalement du CNRS,
dépendent des résultats aux appels d’offre PEPS, PICS, LEA, LIA, etc.
CNRS, 60 000 Paris Diderot, 121 400 Europe, 254 001 PEPS, PICS, LEA, LIA, etc., 169 514 Salaires, 381 185 Missions, 288 200 ANR, 636 221 Equipement, 58 500 Fonct., 55 050 F IGURE 1.9 – Répartition des ressources (à gauche) et des dépenses (à droite) 2011 en e
La figure 1.9 présente la répartition des ressources (à gauche) et des dépenses (à droite), en 2011, hors
salaires des permanents 18 . Ces répartitions sont typiques des années récentes. Environ 50% des ressources du LIAFA proviennent de l’ANR, un petit quart de l’UE au travers principalement des ERC, et
un gros quart des tutelles, sous diverses formes (« récurrent », projets, subventions, etc.). Les dépenses
se répartissent principalement en deux gros postes : les salaires (essentiellement des contrats doctoraux
18. Le montant total des ressources excède le montant des dépenses, ce qui entraı̂ne des report importants. Le laboratoire
développe actuellement un effort de réduction significatif de ses reports, parfois entravé par la politique de certains organismes,
dont l’ANR, consistant à notifier très tardivement dans l’année le montant de ses subventions.
14
ou post-doctoraux) et les missions. Ces dernières entrent pour plus d’un tiers des dépenses du laboratoire ! Cela résulte de la très grande activité de publication des membres du LIAFA dans les congrès,
conférences et colloques. Ces publications et communications orales sont la clé de la diffusion des
résultats du LIAFA au sein de la communauté, et elles sont absolument nécessaires à l’acquisition rapide des connaissances les plus en pointe touchant les sujets de recherche du laboratoire.
900 000 1 400 000 800 000 1 200 000 700 000 1 000 000 600 000 Subv. Tutelles 500 000 400 000 300 000 Union Européenne 800 000 PICS, PEPS, LIA, LEA, etc. ANR, ACI, CIFRE, etc. ANR, ACI, CIFRE, etc. 600 000 PICS, PEPS, LIA, LEA, etc. Union Européenne 400 000 Subv. Tutelles 200 000 200 000 100 000 0 0 2007 2008 2009 2010 2011 2012 2007 2008 2009 2010 2011 2012 F IGURE 1.10 – Ressources en e (hors salaires des permanents) de 2007 à 2012
Les figures 1.10 et 1.11 présentent respectivement l’évolution des ressources et des dépenses du laboratoire de 2007 à 2012. On peut noter la constante et importante proportion des projets ANR dans
le budget. Les projets ANR portés par le laboratoire, ou impliquant certains de ses membres, relèvent
de différents programmes (SYSCOMM, CHIST-ERA, DEFIS, Sesur, SETIN, ARA-SSIA, ARPEGE,
SEGI, VERSO, Télécom, Sécurité, COSINUS, etc.). Toutefois, les programmes « Blancs » et « JCJC »
demeurent les deux principales sources de financement du laboratoire auprès de l’ANR. On note l’apparition de financements européens à partir de 2010, principalement liée à une ERC et à l’arrivée de
l’équipe Algorithmes et Complexité d’Orsay 19 .
450 000 900 000 400 000 800 000 350 000 700 000 300 000 Missions 250 000 Fonc2onnement 200 000 Equipement 150 000 Salaires 600 000 Salaires 500 000 Equipement 400 000 Fonc=onnement 300 000 100 000 200 000 50 000 100 000 0 Missions 0 2007 2008 2009 2010 2011 2007 2008 2009 2010 2011 F IGURE 1.11 – Dépenses en e (hors salaires des permanents) de 2007 à 2011
Utilisation des subventions des tutelles. Comme indiqué ci-dessus, les subventions des tutelles
s’élèvent à environ 170Ke, à savoir environ 120Ke de l’université Paris Diderot plus environ 50Ke du
CNRS. Le laboratoire n’impose pas ses équipes sur leurs contrats, et ces 170Ke forment donc l’unique
ressource pour le fonctionnement du laboratoire proprement dit. Ce budget est évidemment utilisé pour
couvrir toutes les dépenses relevant du fonctionnement global du laboratoire : fournitures, achats de
serveurs, achats de terminaux légers, photocopies, etc. Une partie importante du budget du laboratoire
19. L’arrivée de cette équipe ne s’est pas traduite en un accroissement des projets ANR car les projets ANR en cours de
l’équipe sont restés gérés à l’université Paris Sud.
15
est toutefois également utilisée pour subvenir aux besoins des membres du LIAFA ne disposant pas
de ressources propres, ou ne pouvant pas abonder aux ressources propres de leurs équipes. Ainsi, une
partie non négligeable du budget est utilisée pour l’achat d’ordinateurs (après avis de la commission
« matériel ») et pour couvrir des missions. Si la demande de mission, de matériel ou également de financement de stage, est justifiée (c’est-à-dire : (1) ne peut-être financée par l’équipe, et (2) offre un
important intérêt scientifique), alors elle est généralement acceptée par la direction. Ce mode de fonctionnement permet de lisser les chocs liés à des absences ponctuelles de ressources propres au sein d’une
équipe, ou d’un sous-groupe au sein d’une équipe.
1.5
1.5.1
Le LIAFA dans son environnement
L’université Paris Diderot, l’UFR, la Fédération, et l’Ecole Doctorale
Le laboratoire entretient des relations très étroites avec l’UFR d’Informatique de Paris Diderot. Son
conseil scientifique est actuellement présidé par Olivier Carton (Pr Paris Diderot), membre du LIAFA.
Le directeur ou la directrice et son adjoint(e) sont membres de droit de ce conseil. Le directeur de l’UFR
depuis mi-2012, François Laroussinie, est également membre du LIAFA (l’ancien directeur, Jean-Marie
Rifflet, était membre de PPS).
Le laboratoire est également très fortement impliqué dans l’Ecole Doctorale Sciences mathématiques de
Paris Centre (ED 386), dont Ahmed Bouajjani, membre du LIAFA, assure la responsabilité pour l’informatique à Paris Diderot 20 . L’ED joue un rôle important pour l’informatique à Paris Diderot puisque
qu’elle permet aux laboratoires PPS et LIAFA d’obtenir environ cinq allocations doctorales par an. L’arbitrage entre les candidatures en informatique à Paris Diderot est effectué par une commission ad hoc
formée du responsable pour l’informatique à Paris Diderot de l’ED et des deux directeurs des laboratoires LIAFA et PPS 21 , le classement final revenant au conseil de l’ED.
Le laboratoire est membre de la Fédération de Recherche en Mathématiques de Paris Centre (FR 2830).
Cette Fédération est rattachée à l’INSMI. Elle regroupe les cinq laboratoires de mathématiques et d’informatique associés au CNRS actuellement présents sur les sites de Jussieu et de Chevaleret, et relevant
conjointement des universités Pierre et Marie Curie et Paris Diderot ou de l’une ou l’autre de ces universités. Elle a principalement pour rôle de coordonner ces cinq laboratoires pour permettre une meilleure
gestion des moyens communs, dont en particulier de la Bibliothèque de Mathématiques-Informatique
Recherche, rattachée aux deux universités Pierreet Marie Curie et Paris Diderot. Jean Mairesse, membre
du LIAFA, est directeur adjoint de la Fédération.
Enfin, la présence d’Hugues Fauconnier (MdC Paris Diderot), membre du LIAFA, au Conseil d’Administration de l’Université Paris Diderot, illustre le volonté du laboratoire de s’investir dans les structures
de l’université.
1.5.2
La Fondation et le LABEX Sciences Mathématiques de Paris
Le LIAFA bénéficie du cadre scientifique offert par la Fondation Sciences Mathématiques de Paris
(SMP) 22 . Il s’agit d’un réseau de laboratoires, initialement structuré en RTRA, fondé en 2006 par
des universités et institutions de recherche parisiennes, fédérant 11 laboratoires de mathématiques et
d’informatique, ainsi que 20 équipes-projets de l’INRIA. La fondation SMP réunit ainsi plus de 1200
chercheurs. Ce réseau couvre ainsi l’ensemble du spectre des mathématiques pures et appliquées, ainsi
20. L’établissement principal de rattachement de l’ED est l’université Pierre et Marie Curie (P6), avec, en tant
qu’établissements co-accrédités, l’université Paris Diderot (P7) et l’ENS Paris. Les autres établissements associés à l’ED sont
les universités Panthéon-Sorbonne (P1) et Paris Descartes (P5), ainsi que l’INRIA.
21. Ce mode de fonctionnement ne donne pas entière satisfaction, et cette procédure de classement entre les candidats en
informatique, héritée d’une époque où les laboratoires étaient de plus petite taille, devrait être revue l’an prochain.
22. Valérie Berthé (LIAFA) est directrice adjointe de cette fondation.
16
que de l’informatique fondamentale. La Fondation initie et finance des programmes d’envergure internationale (bourses de master, chaires d’excellence, positions post-doctorales, invitations de chercheurs,
programmes internationaux, etc.). Elle a pour mission de favoriser et de coordonner les échanges entre
ses laboratoires, les ouvertures vers les autres disciplines scientifiques, ainsi que de favoriser les collaborations entre les chercheurs et le monde économique et industriel. La fondation est également adossée
à la Fédération de Recherches en Mathématiques (FR2830 du CNRS) 23 .
La fondation SMP a porté le LABEX Sciences Mathématiques de Paris qui a obtenu ce statut en
2011. Ce LABEX, qui couvre les laboratoires et équipes de la fondation SMP, travaille en concertation avec les deux autres LABEX parisiens en mathématiques, à savoir, le LABEX Bézout, à l’interface entre mathématiques et informatique, et le LABEX Mathématiques Hadamard, plus centrée sur les
mathématiques.
Ce contexte parisien particulièrement stimulant offre donc des possibilités de collaborations fructueuses
et variées au sein de l’informatique fondamentale (entre UMR CNRS, et avec les équipes-projets INRIA
associées), mais également à l’interface mathématiques-informatique à l’échelle parisienne.
1.5.3
Inria, CEA et Technicolor
Le LIAFA héberge l’équipe-projet INRIA « GANG ». Ce projet, sous la responsabilité de Laurent Viennot (DR INRIA), membre du LIAFA, inclut les membres de l’équipe Algorithmique distribuée et graphes
dont les domaines de compétence sont en rapport avec la conception d’algorithmes pour les réseaux à
grande échelle, en utilisant les propriétés structurelles de ces réseaux 24 .
Le laboratoire entretient également des liens étroits avec le CEA, comme en témoigne par exemple le
présence pendant un an dans l’équipe Combinatoire de Jérémie Bouttier, chercheur CEA en physique
statistique combinatoire. Enfin, il convient de souligner que le LIAFA a entretenu durant ces dernières
années des liens forts avec Technicolor (publications communes, projet ANR « PROSE », etc.).
1.5.4
1.5.4.1
Environnement scientifique
Local et régional
Notre partenaire local privilégié est bien sûr le laboratoire PPS (voir section 1.1.2). Les liens entre le
LIAFA et PPS ne devraient que pouvoir se renforcer à l’avenir (voir section 2.3). Le LIAFA entretient
toutefois également des liens étroits avec d’autres partenaires à Chevaleret, en particulier avec l’équipe
Logique mathématique de l’IMJ sur la complexité algébrique (un article à STOC 2012 [DMPY12])
et la vérification approchée de systèmes probabilistes (ANR VERAP), ainsi qu’avec l’équipe Algèbres
d’opérateurs de l’IMJ sur les groupes et semi-groupes d’automates (projet BQR inter-disciplinaire 20101011 Paris Diderot entre le LIAFA et l’ IMJ).
Au niveau de l’informatique de Paris Centre, de forts liens se mettent en place avec le Département
d’Informatique (DI) de l’ENS, en particulier avec l’équipe de cryptographie « Cascade », et par l’arrivée
récente de Claire Mathieu. Notons que la Fondation SMP permet de travailler en étroite synergie avec
les trois laboratoires Informatiques de la Fondation, à savoir le LIAFA, le LIENS et PPS. Par ailleurs,
les liens entre le LIAFA et Télécom Paris-Tech jusque-là principalement orientés autour des automates
se renforcent également autour du quantique (sécurité et communications quantiques). Les liens avec le
LIP6 sont également multiples et relèvent de thématiques variées, dont la combinatoire (en particulier
avec la mise en place du séminaire de combinatoire « Philippe Flajolet » à l’IHP), le calcul « on-line »
23. Jean Mairesse (LIAFA) est directeur adjoint de cette fédération.
24. Membres : Yacine Boufkhad (MdC, Paris Diderot), Pierre Charbit (MdC, Paris Diderot), Carole Delporte (Pr., Paris
Diderot), Hugues Fauconnier (MdC, Paris Diderot), Dominique Fortin (CR INRIA, non membre du LIAFA), Pierre Fraigniaud
(DR CNRS), Michel Habib (Pr., Paris Diderot), Amos Korman (CR CNRS), Fabien Mathieu (chercheur CDD, INRIA), Fabien
de Montgolfier (MdC, Paris Diderot), et Laurent Viennot (DR INRIA, responsable du projet).
17
(ANR NeTOC), les protocoles distribués pour les réseaux (ANR SHAMAN), etc.
Plus largement, en Ile-de-France, le LIAFA collabore activement avec les principaux laboratoires en
informatique de la région, dont en particulier le LIGM (combinatoire algébrique, automates et systèmes
dynamiques, vérification et systèmes infinis, 3 thèses en codirection plus deux projets ANR : AMIS
et EQUINOCS), le LIPN (combinatoire), le LIX (combinatoire, algorithmique distribuée), le LRI
(tolérance aux pannes, protocoles distribués pour les réseaux), et le LSV (jeux, logiques temporelles,
vérification, quatre projets ANR : AVERILES, AVERISS, DOTS et ImpRo), le LACL (logique et automates, spécification et vérification, 1 thèse en codirection et projet ANR EQUINOCS), et caetera.
1.5.4.2
National
Au niveau national, le LIAFA entretient des liens étroits avec les principaux laboratoires français ayant
une composante informatique fondamentale. Ainsi, outre des collaborations individuelles ponctuelles, le
laboratoire collabore activement, voire formellement au travers de projets scientifiques communs, avec
évidemment le LaBRI (entre autres sur la combinatoire, l’algorithmique distribuée pour les réseaux, la
tolérance aux pannes, la logique, les automates et les jeux), mais aussi avec l’IRISA, dont les membres
de l’équipe-projet ASAP de l’INRIA Bretagne (calcul distribué, ANR DISPLEXITY), avec VERIMAG
(ANR AMAES, AVERILES, VERIDYC, EQINOCS), avec l’IRCCyN (ANR DOTS, ImPro), et avec le
LIRMM (complexité, algorithmes de graphes).
1.5.4.3
International
Il serait vain de lister les collaborateurs internationaux des membres du LIAFA, et consulter les listes
de publications des équipes suffira à évaluer le volume de ces collaborations nombreuses et fructueuses.
Quelques-unes des collaborations formelles que le LIAFA entretient avec des organismes étranger sont
listées ci-dessous :
• Participation au projet STREP « EULER » : Experimental UpdateLess Evolutive Routing.
• Participation au projet STREP « QCS » : Quantum Computer Science.
• Participation au EU Integrated Project IST-2003-015848 « QAP » : Qubit Applications (quantum
information processing).
• Direction de l’ESF Research networking programme « AutoMathA » : Automata : from Mathematics to Applications.
• Participation au projet CHIST-ERA 25 « DIQIP » : Device-Independent Quantum Information
Processing.
• Responsabilité du projet PICS Franco-Suisse « Architectures multicœurs et algorithmique distribuée ».
• Nombreuses responsabilités de projets bilatéraux du Ministère des Affaires Etrangères (voir rapports des équipes).
En outre, le LIAFA porte deux laboratoires européens associés du CNRS, à savoir, un LEA avec Israël
(French-Israeli Laboratory on Foundations of Computer Science (FILOFOCS), codirigé par l’université
de Tel-Aviv University), et un LEA avec la République Tchèque (STRUCO, codirigé avec l’Université
Charles-Prague). Le Laboratoire participe de plus activement au LIA « LIRCO » (Laboratoire International Franco-Québécois de Recherche en Combinatoire), au LIA « FSQL » (France-Singapore Quantum Physics and Information Lab), au LIA « INFINIS » avec l’Argentine (Informatique Fondamentale,
Logique, Langages, Vérification et Systèmes), au LIA « INFORMEL » avec l’Inde (responsables LSVCMI), et enfin à l’UMI Franco-Japonaise « FFLI » (French Laboratory for Informatics).
25. Activité de coopération des agences nationales de moyens sous l’égide de l’ERA-Net de l’Union Européenne (coordonné
par l’ANR pour la France).
18
1.5.5
Animation
1.5.5.1
Nationale
Le LIAFA est fortement impliqué dans la vie et l’animation des GdR, principalement au niveau du GdR
Informatique Mathématique (IM) dont il assure la responsabilié de trois groupes de travail et d’un pôle,
en sus de la participation au comité de direction. Le LIAFA est également fortement impliqué dans les
GdR Information Quantique, Fondements & Applications (IQFA) (responsabilité de l’axe Communication quantique), Architecture, Systèmes, Réseaux (ASR) (participation au conseil scientifique du pôle
ResCom), et Calcul (participation au conseil scientifique) – ce dernier GdR relevant de l’INSMI.
Le LIAFA est également fréquemment impliqué dans des missions classiques d’expertise au niveau
national : jury AERES, comité ANR, jurys PES/PEDR, etc.
1.5.5.2
Internationale
Le LIAFA participe activement à l’animation de la recherche internationale, en particulier au travers
de la participation de ses membres à de nombreux comités éditoriaux de revues internationales, et à de
nombreux comités de programme et/ou de pilotage de conférences :
Comités éditoriaux de revues internationales : International Journal of Quantum Information, ACM
Transactions on Computation Theory, Distributed Computing, Theory of Computing Systems,
Fundamenta Informaticae, ICST Transactions on Algorithms Engineering, Journal of Interconnection Networks, Mathematica Bohemica, Annals of Combinatorics, RAIRO Theoretical Informatics and Applications 26 , Annals of Applied Probability, International Journal of Algebra and
Computation, Queueing Systems, The Houston Journal of Mathematics, Semigroup Forum, Mathematical Structures in Computer Science, Techniques et Sciences Informatiques, Formal Methods in System Design, etc.
Comités de programme et/ou de pilotage de conférences : STOC, ICALP, SODA, PODC, POPL,
LICS, STACS, DISC, CONCUR, SPAA, WG, MFCS, FCT, QIP, CAV, FPSAC, SOFSEM, AofA,
DLT, CCR, TACAS, FSTTCS, FOSSACS, FORMATS, VMCAI, etc.
Enfin, le LIAFA est fréquemment impliqué dans des missions classiques d’expertise internationale,
comme par exemple la participation au panel d’experts du programme FET (Future and Emerging
Technologies)-OPEN en ICT (Information and Communication Technologies), ou la participation aux
jurys de programmes ERC.
1.5.6
Interdisciplinarité
En termes d’interdisciplinarité, les forces du laboratoire sont très largement mobiliséees autour de l’interaction entre informatique et mathématiques. Des chercheurs du laboratoire se sont ainsi fortement
investis dans les structures locales et nationales d’animation autour de cette interface : deux chargés de
mission CNRS en charge de l’interface entre Informatique et Mathématiques 27 , responsabilités de GT
et de pôle au sein du GdR Informatique Mathématique, vice-direction Fondation SMP et Fédération
FRMPC, organisation d’un trimestre 28 et d’un séminaire récurrent 29 à l’IHP, etc. Notons de plus qu’un
membre du LIAFA 30 est issu de la section 01 (actuellement 41).
26.
27.
28.
29.
30.
Christian Choffrut et Olivier Serre sont même co-éditeurs en chef de la revue.
Valérie Berthé, puis Jean Mairesse.
Trimestre « Metric » en 2011.
Séminaire de Combinatoire Philippe Flajolet.
Jeremy Lovejoy.
19
Les résultats obtenus à cette interface relèvent principalement de l’informatique mathématique, les
problématiques et motivations provenant de l’informatique, les outils et les méthodes de résolution étant
de nature mathématique. Inversement, les travaux effectués au sein du laboratoire peuvent avoir des retombées directes en mathématiques (théorie des nombres et arithmétique, par exemple) avec un usage
d’outils relevant des mathématiques discrètes et de l’informatique théorique.
Parmi les thèmes développés à cette interface au laboratoire, citons en particulier la combinatoire (combinatoire énumérative et algébrique, analyse d’algorithmes, cartes planaires, etc.), l’étude des automates
(aspects algébriques et topologiques), ou encore, l’étude des systèmes dynamiques discrets. Les outils
mathématiques les plus largement utilisés relèvent des probabilités, de la logique, de l’algèbre et de la
topologie, de la théorie ergodique ou encore de la théorie des nombres et de l’arithmétique.
Outre les mathématiques, plusieurs autres axes interdisciplinaires émergent, en direction :
• de la biologie autour de la bio-informatique (réseaux phylogénétiques et graphes cordaux, algorithmes de graphes pour l’étude de l’évolution des génomes de virus, séquençage « haut débit »,
etc.), dans le cadre d’un projet ANR « COSINUS ».
• des SHS autour de problématiques liées aux réseaux sociaux (modélisation et algorithmique des
réseaux sociaux), dans le cadre de deux PEPS et de deux projets ANR.
• de la physique autour de thématiques liées au quantique (journées « Quantum in Paris », GdR Information Quantique, Fondements & Applications (IFQA), BQR Calcul distribué quantique, etc.),
et à la combinatoire (en collaboration avec le CEA) via la physique statistique et combinatoire.
1.6
Formation par la recherche
Le LIAFA porte une attention toute particulière à la formation par la recherche, en accueillant un grand
nombre de stagiaires de M2 et, comme mentionné précédemment, en produisant un effort pour augmenter son nombre de doctorants. Le laboratoire est impliqué dans plusieurs masters et filières d’enseignement de la région parisienne, bien sûr à Paris Diderot, mais aussi à l’Ecole Polytechnique, à l’Ecole
Centrale, etc. Le LIAFA est extrêmement impliqué dans le MPRI 31 . De fait, la majorité des doctorants
du laboratoire sont issus du MPRI. Néanmoins, le laboratoire participe également activement à plusieurs
filières professionnalisantes dont celle de la spécialité IAP du master Informatique de Paris Diderot. Enfin, le LIAFA s’implique régulièrement dans l’organisation d’écoles thématiques, comme par exemple
les écoles « jeunes chercheurs en informatique mathématique » et l’école de printemps en informatique
théorique.
Par ailleurs, le laboratoire a le souci de maintenir son effort de formation auprès des doctorants, tout
au long de leur thèse. Ces étudiants sont évidemment invités à suivre les nombreux séminaires hebdomadaire d’équipes mentionnés précédemment, mais, surtout, le LIAFA, en partenariat avec PPS, prend
soin de maintenir un séminaire dédié aux doctorants, afin que ceux-ci puissent sensibiliser l’ensemble
des étudiants du laboratoire à leur sujet de recherche.
Le laboratoire a récemment mis en place un protocole d’accueil et de suivi des doctorants, incluant en
particulier la commission « doctorants » mentionnée en section 1.2.2, la journée des entrants décrite en
section 1.2.3, et une évaluation à mi-parcours établie sous la responsabilité de l’Ecole Doctorale.
Notons, plus généralement, que le LIAFA s’est également impliqué dans l’enseignement auprès des
professeurs du secondaire dans le cadre de la formation au futur enseignement ISN (Informatique et
Sciences du Numérique).
31. Master Parisien de recherche en Informatique, cohabilité par l’université Paris Diderot, l’ENS Paris, l’ENS Cachan,
l’école Polytechnique, en partenariat avec les universités Pierre et Marie Curie et Paris Sud, et Telecom ParisTech.
20
1.7
Vulgarisation et diffusion scientifiques
Les membres du laboratoire sont fortement impliqués dans la diffusion des connaissance sous des formes
variées :
• Rédaction d’articles dans les revues et journaux de vulgarisation : La Recherche, Le Monde
supplément Sciences & Techno, Sciences & Avenir, etc.
• Rédaction d’articles pour des sites dédiés comme Images des Mathématiques ou Interstices, dont
Laurent Viennot (LIAFA) est éditeur scientifique.
• Interventions publiques : Fête de la Science, Cité des Sciences et de l’Industrie, Collège Belgique,
etc.
• Exposés dans les collèges et lycées, et préparation aux Olympiades internationales de
mathématiques.
• Expositions : projet « Quantum design-Anabole », projet « Encuentra el infinito » au musée des
sciences de Santiago du Chili, etc.
Notons en particulier que deux doctorants du LIAFA, Irène Markovici et Antoine Taveneaux, sont
membres du comité d’organisation du séminaire Mathematic Park, Antoine Taveneaux étant de plus
membre du bureau de MATh.en.JEANS.
Enfin, la célébration de l’année Alan Turing 2012 a été l’occasion de nombreuses interventions (exposé
lors des journées de l’ENS Lyon, etc.). Jean Mairesse a ainsi été conseiller scientifique du film « Le
modèle Turing » produit par CNRS Images, et a participé au Festival du Film de chercheurs 2012.
1.8
Valorisation
Les activités de valorisation menées au sein du laboratoire sont principalement orientées vers des entreprises de type « startup ». On peut ainsi citer plus spécifiquement :
• la participation à la création de la startup Move&Play 32 sur le partage de données personnelles,
• une coopération et mission d’expertise avec Ligaran consacrée à la publication sur supports
dématérialisés,
• une collaboration autour du calcul quantique et de la distribution quantique de clés, avec la société
IDQuantique, entreprise basée à Genève qui propose des solutions de chiffrement réseau haute
performance.
Notons également un dépôt de brevet en 2008 : « Utilisation d’un ensemble de clients privilégiés pour
une diffusion collaborative de contenu ».
Il convient enfin de mentionner la thèse Cifre de Stéphane Raux effectuée sous la direction de Christophe Prieur au sein de l’entreprise innovante Linkfluence. Cette thèse porte sur la mise en place d’une
infrastructure d’analyse de Twitter. Dans ce cadre, Stéphane Raux, en collaboration avec Alexis Jacomy,
Ronan Quidu, et Nils Grünwald, a remporté le concours Google de Data Viz - Elections 2012, avec
l’application web MediArena. Cette application propose à l’utilisateur de comparer le traitement réservé
par 12 médias en ligne aux thématiques et aux candidats de l’élection présidentielle française 2012.
32. Maintenant CleverScale.
21
1.9
Annexes
1.9.1
Liste des membres permanents chercheurs et enseignants-chercheurs au 10/09/2012
Les noms soulignés sont ceux des responsables d’équipe.
– Equipe Algorithmes et complexité
1. Michel De Rougemont (Pr, Pantheon-Assas)
2. Iordanis Kerenidis (CR CNRS, HDR)
3. Sophie Laplante (Pr, Paris Diderot)
4. Frédéric Magniez (DR CNRS)
5. Adi Rosén (DR CNRS)
6. Miklos Santha (DR CNRS)
7. David Xiao (CR CNRS)
– Equipe Algorithmique distribuée et graphes
1. Yacine Boufkhad (MdC, Paris Diderot)
2. Pierre Charbit (MdC, Paris Diderot)
3. Fabien de Montgolfier (MdC, Paris Diderot)
4. Carole Delporte (Pr, Paris Diderot)
5. Hugues Fauconnier (MdC, Paris Diderot, HDR)
6. Pierre Fraigniaud (DR CNRS)
7. Michel Habib (Pr, Paris Diderot)
8. Amos Korman (CR CNRS)
9. Fabien Mathieu (Chercheur INRIA, HDR)
10. Christophe Prieur (MdC, Paris Diderot, HDR prévue automne 2012)
11. Mathieu Raffinot (CR CNRS, HDR)
12. Nicolas Schabanel (DR CNRS)
13. Jean-Sebastien Sereni (CR CNRS)
14. Laurent Viennot (DR INRIA)
Note : Jean-Sebastien Sereni, CR CNRS actuellement au LIAFA, devrait prochainement rejoindre
le LORIA suite à sa demande de mutation pour rapprochement de conjoints. Fabien Mathieu
(Chercheur INRIA) est également membre de l’équipe, pour toute la durée de son CDD de trois
ans à l’INRIA.
– Equipe Automates et applications
1. Valérie Berthé (DR CNRS)
2. Laurent Bienvenu (CR CNRS)
3. Olivier Carton (Pr, Paris Diderot)
4. Christian Choffrut (Pr, Paris Diderot)
5. Thomas Colcombet (CR CNRS, HDR prévue automne 2012)
6. Marie Ferbus (MdC, Paris Diderot)
7. Christiane Frougny (Pr émérite, Paris Vincennes-Saint-Denis)
8. Mai Gehrke (DR CNRS)
22
9. Serge Grigorieff (Pr émérite, Paris Diderot)
10. Łukasz Kaiser (CR CNRS)
11. Ines Klimann (MdC, Paris Diderot)
12. Jean Mairesse (DR CNRS)
13. Sylvain Perifel (MdC, Paris Diderot)
14. Matthieu Picantin (MdC, Paris Diderot)
15. Jean Eric Pin (DR CNRS)
16. Olivier Serre (CR CNRS)
17. Wolfgang Steiner (CR CNRS)
18. Jean-Baptiste Yunès (MdC, Paris Diderot, HDR)
19. Wieslaw Zielonka (Pr, Paris Diderot)
– Equipe Combinatoire
1. Guillaume Chapuy (CR CNRS)
2. Sylvie Corteel (DR CNRS)
3. Enrica Duchi (MdC, Paris Diderot)
4. Jeremy Lovejoy (CR CNRS)
5. Roberto Mantaci (MdC, Paris Diderot, HDR)
6. Anne Micheli (MdC, Paris Diderot)
7. Vlady Ravelomanana (Pr, Paris Diderot)
Note : Dominique Poulalhon (MdC, Paris Diderot), actuellement en détachement au LIX, devrait
rejoindre le laboratoire à la rentrée 2013.
– Equipe Modélisation et vérification
1. Eugène Asarin (Pr, Paris Diderot)
2. Ahmed Bouajjani (Pr, Paris Diderot)
3. Aldric Degorre (MdC, Paris Diderot)
4. Constantin Enea (MdC, Paris Diderot)
5. Irene Guessarian (Pr émérite, Pierre et Marie Curie)
6. Peter Habermehl (MdC, Paris Diderot, HDR)
7. Florian Horn (CR CNRS)
8. Yan Jurski (MdC, Paris Diderot)
9. François Laroussinie (Pr, Paris Diderot)
10. Arnaud Sangnier (MdC, Paris Diderot)
11. Mihaela Sighireanu (MdC, Paris Diderot)
12. Tayssir Touili (CR CNRS, HDR)
Note : Yan Jurski (MdC, Paris Diderot) ne devrait plus en l’état faire partie du laboratoire au
31/12/2013. Il pourrait toutefois réintégrer le laboratoire au 01/01/2014 s’il en fait explicitement
la demande fin 2013, demande qui sera alors étudiée par le conseil de laboratoire.
23
1.9.2
Liste des membres du conseil de laboratoire
Membres de droit (2 sièges)
– Directeur du laboratoire : Pierre Fraigniaud (DR CNRS)
– Directrice adjointe du laboratoire : Valérie Berthé (DR CNRS)
Collège enseignant-chercheur et chercheur de catégorie A (5 sièges)
– Eugene Asarin (Pr, Paris Diderot)
– Olivier Carton (Pr, Paris Diderot)
– Vlady Ravelomanana (Pr, Paris Diderot)
– Michel de Rougemont (Pr, Pantheon-Assas)
– Nicolas Schabanel (DR CNRS)
Collège enseignant-chercheur et chercheur de catégorie B (5 sièges)
– Enrica Duchi (MdC, Paris Diderot)
– Fabien de Montgolfier (MdC, Paris Diderot)
– Mihaela Sighireanu (MdC, Paris Diderot)
– David Xiao (CR CNRS)
– Jean-Baptiste Yunès (MdC, Paris Diderot)
Collège secrétariat, ingénieur et technicien (2 sièges)
– Laifa Ahmadi (IR, CNRS)
– Noëlle Delgado (AI, CNRS)
Collège Doctorants (1 siège)
– Adeline Pierrot
24
1.9.3
Règlement intérieur
25
26
L'accès aux ressources informatiques du LIAFA est soumis à autorisation préalable du
directeur du laboratoire.
L'autorisation d'accès est strictement personnelle et incessible.
Cette autorisation est délivrée pour des activités conformes à la mission du laboratoire et à
la législation en vigueur.
27
l'utilisateur est tout enseignant, chercheur, invité ou personnel utilisant les systèmes
informatiques du laboratoire.
L' ASR est responsable techniquement du bon fonctionnement des moyens informatiques
du laboratoire.
Il a la charge d'assurer la sécurité des machines et du réseau.
L'ensemble des services utilisés génèrent des fichiers de traces essentiels à l'administration
des systèmes. Ces fichiers conservent par exemple des informations sur la messagerie, les
dates de connexions locales et à distance. Ces traces sont consultées par les ASR pour des
besoins de statistiques ou pour remédier aux dysfonctionnements des services. Toutefois,
dans le cadre d'une procédure judiciaire, ces fichiers peuvent être mis à la disposition de la
justice.
Extrait de la charte utilisateur de resources informatiques du CNRS : pour des nécessités
de maintenance et de gestion technique, l'utilisation des ressources matérielles ou
logicielles ainsi que les échanges via le réseau peuvent être analysés et contrôlés dans le
respect de la législation applicable et notamment de la loi sur l'informatique et les
libertés.
–
–
–
–
–
–
–
1
Les utilisateurs doivent choisir des mots de passe respectant les recommandations des
ASR.
Tout utilisateur est responsable des conséquences des autorisations qu'il donne aux autres
sur ses propres fichiers.
Aucun utilisateur ne doit prêter son compte ni utiliser le compte d'autrui.
L'utilisateur ne doit pas installer de logiciels sur les serveurs, qu'ils proviennent de
l'Internet ou de tout autre support, sans avoir référé au préalable aux ASR.
Il est interdit d'utiliser ou de développer des programmes mettant volontairement en cause
l'intégrité des systèmes informatiques.
Tout constat de violation, tentative de violation ou soupçon de violation des systèmes
informatiques du laboratoire doit être signalé aux ASR.
Il est interdit d'essayer de contourner les mécanismes de sécurité instaurés par les ASR.
3- Règles de sécurité
-
-
-
-
2- Utilisateur et Administrateur Systèmes et Réseau (ASR)
–
–
–
1- Conditions d'accès
Cette charte définit les règles d'accès et d'utilisation locale ou à distance des moyens
informatiques du LIAFA. Elle s'impose à tous.
Les possesseurs d'ordinateurs portables ou de stations de travail individuelles sont tenus
de les administrer selon les règles définies par les ASR.
Les utilisateurs ne doivent pas tenter de lire, de copier, de divulguer ou de modifier les
fichiers d'autres utilisateurs sans autorisation explicite.
Les utilisateurs doivent s'interdire toute tentative d'interception de communications entre
tiers.
Les utilisateurs sont tenus à la réserve d'usage sur toute information obtenue en utilisant
les ressources informatiques et relative au fonctionnement interne du laboratoire.
Tout utilisateur a le droit de travailler sans être dérangé. La courtoisie doit être de mise
dans tout échange de communication en particulier via le courrier électronique où chacun
doit préciser s'il s'exprime en son nom ou au nom du laboratoire.
Les utilisateurs sont invités à un usage raisonnable des moyens communs (puissance de
calcul, espace disque, imprimantes, etc.)
Il est recommandé d'exécuter les travaux longs et non interactifs en tâche de fond, d'éviter
de bloquer des ressources avec de multiples sessions interactives inutilisées et de
transférer son courrier sur son compte personnel.
On doit s'assurer que ses applications ne pénalisent pas les autres utilisateurs du réseau.
On doit s'abstenir de fumer, de manger et d'introduire sans autorisation des personnes
extérieures au laboratoire dans les salles contenant du matériel informatique en libre
service.
Il est interdit à tout utilisateur de faire des copies de logiciels commerciaux. Seules les
copies de sauvegarde faites par les administrateurs sont permises.
Il est interdit d'installer des logiciels commerciaux sur les serveurs du laboratoire sans
autorisation des ASR.
La création de tout fichier contenant des informations nominatives doit faire l'objet de
formalités préalables à sa mise en oeuvre auprès de la Commission Nationale de
l'Informatique et des libertés (CNIL).
Toute personne sur laquelle des informations figurent dans un tel fichier doit être informée
de l'existence de ce fichier, de sa finalité, de l'existence d'un droit d'accès et des modalités
de mise en oeuvre de celui-ci, dès la collecte d'informations la concernant.
-
2
Il est fortement recommandé de lire la Netiquette décrite par la RFC 1855 dont une
traduction en français est sur le site http://ww.ccr.jussieu.fr/ccr/Netiquette.html
8- Usage des services Internet
–
–
7- Informatique et libertés (loi 92-684 du 22 juillet 1992)
–
–
6- Respect de la propriété intellectuelle
–
–
–
–
–
5- Règles de bon usage
–
–
–
4- Règles de confidentialité
–
1.9.4
Charte d'utilisation des moyens informatiques du LIAFA
Charte d’utilisation des moyens informatiques
En particulier, l'utilisateur doit faire preuve de la plus grande correction à l'égard de ses
interlocuteurs dans les échanges électroniques (courrier, forums, pages web, etc.) et
s'imposer le respect des lois notamment celles relatives aux publications à caractère
injurieux, raciste, pornographique, diffamatoire.
Les liens sur d'autres serveurs à partir des pages personnelles des chercheurs doivent se
faire avec la plus grande précaution car on risque de violer les lois par imprudence.
la loi du 6/1/78 dite "informatique et liberté",(cf. http://www.cnil.fr/ )
la législation relative à la fraude informatique, (article 323-1 à 323-7 du Code pénal),(cf.
http://www.legifrance.gouv.fr/citoyen/code.cgi )
la législation relative à la propriété intellectuelle(cf.
http://www.legifrance.gouv.fr/citoyen/code.cgi )
la loi du 04/08/1994 relative à l'emploi de la langue française,(cf.
http://www.culture.fr/culture/dglf/ )
la
législation
applicable
en
matière
de
cryptologie.(cf.
http://www.telecom.gouv.fr/francais/activ/techno/crypto0698_1.htm )
28
Chaque utilisateur accède et utilise les moyens informatiques et le réseau sous sa propre
responsabilité
Il reconnaît que toute violation des dispositions de la charte et tout dommage de son fait
créé au laboratoire ou à des tiers, engagera sa responsabilité sur le plan civil et pénal.
3
Cette charte est inspirée des chartes de divers instituts et universités.
Création : 1997
Dernière mise à jour : mars 2003
Signature (précédée de la mention manuscrite : lu et approuvé)
Paris, le
Je soussigné :
détenteur d'un compte sur les serveurs du LIAFA sous le sigle :
déclare avoir pris connaissance de la charte des utilisateurs du laboratoire et m'engage à
respecter ses recommandations.
-
-
10- Responsabilités
-
-
-
-
Il est rappelé que toute personne sur le sol français doit respecter la législation française en
particulier de la sécurité informatique :
9- Rappel des principales lois françaises
-
-
Chapitre 2
Ce chapitre décrit le projet scientifique général du LIAFA pour le prochain quinquennat (2014-2018),
débutant au 01/01/2014. Il pourrait toutefois être mis en œuvre dès 2013, sous réserve de validation
par l’AERES. De fait, ce projet est en continuité des actions entreprises ces dernières années par le
laboratoire. Il ne se substitue pas aux projets scientifiques de chacune des équipes du LIAFA, tels que
décrits dans chacun des rapports d’équipe. En revanche, il offre un cadre général dans lequel chacun de
ces projets d’équipe pourra s’inscrire.
2.1
Positionnement scientifique et objectif général
L’objectif du LIAFA est de se positionner nationalement et internationalement en tant qu’acteur majeur en informatique fondamentale, définie comme l’ensemble des activités scientifiques ayant pour
objectif d’appréhender et de comprendre la nature des modes de calcul, d’en concevoir les théories, et de
développer les outils permettant la conception et l’analyse de calculs efficaces (corrects, rapides, etc.).
Le laboratoire est actuellement déjà identifié, et bien reconnu, en informatique fondamentale, grâce aux
activités de ses équipes. L’ambition du LIAFA est d’aller au-delà de l’addition des performances de ses
équipes pour développer à court/moyen terme, au sein de l’Université Paris Diderot et du CNRS, un lieu
d’excellence en informatique fondamentale, visible internationalement et identifié en tant que tel. Ce
projet pourrait à plus long terme déboucher sur la création d’un Institut d’Informatique Fondamentale à Paris Diderot.
Un institut d’informatique fondamentale ne pourrait toutefois voir le jour à Paris Diderot sans concertation avec les autres acteurs en informatique de l’université, dont bien sûr le laboratoire PPS. En fait, il
ne pourrait voir le jour sans la participation effective de ces acteurs. Le projet du LIAFA tel que décrit
dans ce rapport n’abordera donc pas directement le sujet de la création d’un tel institut, même si cette
création peut être gardée en toile de fond de la description du projet de l’unité, en particulier pour ce
qui touche au rapprochement avec PPS. Le texte ci-dessous se cantonnera plutôt à résumer brièvement
la politique que compte mettre en œuvre le LIAFA pour augmenter encore sa visibilité et son impact
scientifique dans le domaine de l’informatique fondamentale.
Les trois piliers soutenant le projet. L’évolution thématique du LIAFA ces dernières années, en
particulier l’élargissement de son spectre de compétences, est l’un des trois piliers sur lesquels le laboratoire compte s’appuyer pour réaliser son objectif. Les thématiques de recherches du laboratoire incluent
en effet maintenant la quasi-totalité des thématiques liées à l’informatique fondamentale au sein de la
nouvelle section 06 du CNRS « Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations », à savoir :
• algorithmique, combinatoire, graphes, automates, systèmes dynamiques discrets ;
• logique, complexité algorithmique et structurelle, sémantique, modèles de calcul ;
• vérification ;
29
CHAPITRE 2. PROJET SCIENTIFIQUE DU LABORATOIRE
• réseaux, réseaux sociaux, systèmes distribués, calcul distribué ;
• bioinformatique.
Le laboratoire possède donc à ce jour une assise suffisamment large en informatique fondamentale pour
bâtir un projet spécifique à cette thématique, visant à sa promotion scientifique et à l’identification du
LIAFA comme acteur central en son sein.
Le deuxième pilier sur lequel l’unité compte s’appuyer est son appartenance à plusieurs structures scientifiques nouvelles, dont le LABEX Sciences Mathématiques de Paris (SMP) et l’IDEX Sorbonne Paris Cité (SPC). Le LABEX SMP permet déjà de promouvoir l’interaction avec les mathématiques, et,
prosaı̈quement, d’accéder à un ensemble de ressources capitales (post doc, invitations, etc.) pour la mise
en œuvre du projet du LIAFA. L’IDEX SPC devrait quant à lui permettre, entre autre, de renforcer pour
certaines thématiques les liens entre le laboratoire et certaines équipes d’autres laboratoires parisiens,
dont le LIPN (membre de l’IDEX).
Enfin, le troisième pilier sur lequel le laboratoire compte s’appuyer est sa proximité scientifique et
géographique avec PPS. Au delà des problèmes de structure qui ont été évoqués plus haut dans ce
rapport, l’ambition du LIAFA ne saurait se réaliser sans un rapprochement avec PPS sur de nombreuses
thématiques qui, quoiqu’abordées actuellement de manières parfois différentes, révèlent de nombreux
points d’accroche sur plusieurs problématiques centrales de l’informatique fondamentale.
Une mise au point sur la couverture thématique. Avant de décrire plus avant le projet du LIAFA, il
convient de souligner que le laboratoire n’a évidemment pas comme ambition de couvrir tout le champ
de l’informatique fondamentale, et encore moins de se substituer aux équipes présentes sur le sujet
en région parisienne. A titre d’exemple, le LIAFA ne dispose pas de forces en calcul formel (LIP6),
en arithmétique des ordinateurs (LIP6), en géométrie algorithmique (ENS-INRIA), etc. Le laboratoire
ne compte pas a priori développer des activités sur ces thèmes. En revanche, il compte maintenir ou
créer des liens avec ces équipes afin de garder une certaine proximité avec des thématiques cruciales
au sein de l’informatique fondamentale. La proximité avec des équipes du LIENS (membre, comme
le LIAFA, de la fondation SMP), du LIP6 (sur les thèmes mentionnés ci-dessus, voir également en
algorithmique distribuée et en combinatoire), de Telecom ParisTech (en algorithmique quantique, par
exemple, et autour de la théorie des automates), du LIPN (en combinatoire), du LIGM (en automates et
combinatoire) ou encore du LSV (en vérification), sont autant d’atouts sur lesquels compte s’appuyer
le LIAFA pour le développement de son projet en général et de celui de chacune de ses équipes en
particulier.
Stratégie de mise en œuvre.
Fondamentale nécessite
L’ambition du LIAFA d’affirmer sa position de leader en Informatique
• d’une part de créer des axes de synergie entre ses équipes, et
• d’autre part d’élargir encore son spectre de compétences.
Les axes de synergie internes au laboratoire sont décrits dans la section suivante (section 2.2).
L’élargissement du spectre de compétences du laboratoire repose évidemment sur sa capacité à recruter,
mais aussi sur l’identification de points d’accroche scientifiques entre le LIAFA et PPS. Ces points d’accroche sont en cours d’identification par les deux UMR. Une liste non exhaustive résultant de discussions
préliminaires entre le LIAFA et PPS est décrite dans la section 2.3.
2.2
Axes fédérateurs internes et implications externes
Cette section décrit trois directions de recherche générales ayant pour objet, d’une part, de renforcer
la synergie entre les équipes du laboratoire, et, d’autre part, de promouvoir les recherches du laboratoire à l’externe, au delà du positionnement national ou international de telle ou telle équipe, ou de tel
30
ou tel groupe de chercheurs du laboratoire. Ces trois directions sont structurées autour de trois axes
transversaux :
• algorithmique,
• systèmes concurrents,
• structures et logique, jeux.
Les trois sous-sections ci-dessous décrivent chacun de ces axes transversaux, en spécifiant leur mise en
œuvre au sein du LIAFA.
2.2.1
Algorithmique
Si tout informaticien, et de nombreux mathématiciens et physiciens, conçoivent et analysent des algorithmes au quotidien, l’étude proprement dite des techniques de conception d’algorithmes n’est de
fait pas une force de l’informatique en France. Le pays a ainsi, à l’exception des travaux de quelques
personnalités, globalement manqué les révolutions successives des algorithmes d’approximation, des algorithmes probabilistes, des algorithmes « on-line », des algorithmes de « streaming », etc., sans même
parler du « property testing », de la complexité de la communication, ou d’autres thématiques algorithmiques connexes. Ainsi, les réussites scientifiques nationales telles que le projet Algorithmes à l’INRIA, le développement de l’algorithmique quantique au LRI à Orsay au début des années 2000, voire
les succès de l’école française en algorithmique distribuée, ne doivent pas cacher une relative faiblesse
de la France en ce qui concerne le développement de nouveaux concepts algorithmiques et l’analyse
en complexité de problèmes, au moins pour ce qui concerne les modèles les plus modernes mentionnés
ci-dessus.
La présence au laboratoire de plusieurs acteurs français parmi les plus éminents en algorithmique et
en complexité incite le LIAFA à œuvrer afin de supporter toutes les activités scientifiques en liaison
avec ces thématiques. Cela consiste évidemment pour une part à promouvoir en son sein l’étude de la
conception et l’analyse d’algorithmes. (Cette promotion pourra par exemple s’effectuer sous la forme de
support à des groupes de travail thématiques transversaux, tel que celui récemment animé par Sylvain
Perifel sur la complexité.) Au delà, le LIAFA estime qu’il se doit de jouer un rôle national pour aider au
développement de compétences en conception et en analyse d’algorithmes en France. Cette volonté s’est
déjà traduite par l’organisation de l’Ecole de Printemps d’Informatique Théorique (EPIT) en 2012 sur le
thème de l’algorithmique probabiliste, et par la création du groupe de travail Complexité et Algorithmes
(CoA) au sein du GdR Informatique Mathématique (IM), sur l’initiative de membres du laboratoire. Ces
initiatives devraient se poursuivre à l’avenir, sous forme d’outils pérennes (tels que les journées ALEA
ou les rencontres AlgoTel, sur des sujets connexes).
En résumé, le LIAFA compte poursuivre son effort en algorithmique, alliant renforcement des
compétences locales, implication dans la communauté informatique nationale, et augmentation de sa
visibilité internationale.
2.2.2
Systèmes concurrents
Les systèmes concurrents incluent tous les systèmes dans lesquels un ensemble d’entités informatiques (processeurs multi-cœurs au sein des ordinateurs, « cloud computing », etc.), d’acteurs humains
(économiques, sociaux, etc.), voire d’autres organismes vivants (colonie de fourmis, bactéries, etc.), interagissent de façon plus ou moins coordonnée. Ces systèmes ont envahi notre quotidien. Comprendre,
utiliser, contrôler, et/ou sécuriser ces systèmes est une problématique générale dont l’importance n’ira
que croissante dans les années à venir. Cet état de fait a ainsi été naturellement souligné lors des récentes
réunions du GT 1 d’ALLISTENE 1 . Or, tout comme pour ce qui concerne l’algorithmique (cf. sec1. Alliance des sciences et technologies du numérique. Partenaires : CDEFI (Conférence des Directeurs des Écoles
Françaises d’Ingénieurs), le CEA, le CNRS, la CPU (Conférence des Présidents d’Universités), INRIA et l’Institut Telecom.
31
tion 2.2.1), le LIAFA compte en son sein de nombreux spécialistes des systèmes concurrents. Il s’avère
toutefois que ces spécialistes sont dispersés au sein des différentes équipes du laboratoire, et abordent
cette thématique sous différentes formes, de la vérification à l’algorithmique distribuée, en passant pas
les automates cellulaires et les automates asynchrones. Ce n’est pas inhérent au LIAFA puisque leurs
communautés internationales sont également relativement disjointes.
Le LIAFA compte renforcer ses activités de recherche sur les systèmes concurrents, en particulier la
vérification de ces systèmes, la compréhension de leur dynamique, et l’étude de la conception d’algorithmes efficaces pour les systèmes distribués. Le laboratoire œuvrera donc afin, d’une part, de renforcer
équipes ou groupes de chercheurs traitant des systèmes concurrents, et d’autre part, de fédérer toutes les
activités scientifiques au LIAFA traitant de la concurrence.
Le renforcement de telle ou telle thématique pourra s’effectuer sous la forme classique de fléchage de
ressources. A titre d’exemple, un des postes demandés en 2012 par l’UFR Informatique auprès de l’université Paris Diderot touche directement à la vérification de systèmes concurrents. Le rapprochement
des différentes thématiques liées, sous une forme ou une autre, aux systèmes concurrents est un objectif d’une beaucoup plus grande ampleur. La rareté des mouvements inter-salles lors de l’organisation
conjointe des conférences annuelles PODC 2 et CONCUR 3 illustre à elle seule la difficulté de rapprocher
des communautés travaillant sur différents aspects d’un même objet scientifique. Néanmoins, le LIAFA
œuvrera au rapprochement entre les différents membres du laboratoire intéressés par les problèmes liés
aux systèmes concurrents, en particulier au moyen de groupes de travail transversaux sur des thèmes
tels que les systèmes distribués et les systèmes dynamiques discrets. Ce projet ne pourra toutefois être
pleinement réalisé qu’en synergie avec le laboratoire PPS qui possède une expertise complémentaire en
programmation dite concurrente (calcul de processus, pi-calcul et extensions, etc.) et mobile. Le rapport
reviendra donc sur le thème de la concurrence en section 2.3 dans la partie traitant du rapprochement
avec PPS.
2.2.3
Structures et logique, jeux
Le troisième axe transversal sur lequel le laboratoire compte s’appuyer pour augmenter la synergie entre
les équipes a trait d’une part à la logique et ses liens avec différentes structures, dont en particulier celles
issues de la théorie des graphes mais aussi de la combinatoire ou de l’algèbre, et, d’autre part, aux jeux.
Il s’agit de deux thématiques qui, conjointement ou séparément, sont susceptibles d’apporter de la valeur
ajoutée aux recherches du LIAFA par une augmentation des interactions entre les équipes.
La logique offre un cadre sophistiqué pour spécifier des propriétés de structures, dans lequel s’insèrent
une grande partie des travaux des équipes Automates et applications et Modélisation et vérification,
mais également de l’équipe Algorithmes et complexité. Le LIAFA souhaite donc renforcer les points
de contact entre les équipes sur ces thèmes afin d’améliorer encore l’expertise des membres du laboratoire sur ces sujets, et développer de nouvelles collaborations. À titre d’exemple, on peut penser aux
travaux initiés par Bruno Courcelle (LaBRI) montrant les liens entre la complexité des problèmes de
« model-checking » pour les graphes et les propriétés structurelles de décomposition (arborescente,
clique, etc.) de ses derniers. Ces problématiques peuvent naturellement engendrer des collaborations
entre les équipes Algorithmique distribuée et graphes et Modélisation et vérification. Une autre collaboration inter-équipe sur ce sujet peut être motivée par les résultats récents de Friedmann, Hansen et
Zwick sur la complexité des problèmes liés aux jeux de parité « mean payoff », qui correspondent en fait
à des problèmes de « model-checking » pour des graphes finis. Par les techniques employées, et par les
problèmes étudiés, ces travaux encouragent des connexions entre les équipes Algorithmes et complexité,
Automates et applications, et Modélisation et vérification.
2. ACM Symposium on Principles of Distributed Computing.
3. International Conference on Concurrency Theory.
32
Par ailleurs, et en liaison directe avec les thématiques ci-dessus, le laboratoire dispose d’une forte expertise dans le domaine des jeux. Ceci inclut évidemment les jeux pour la théorie des modèles (à la Ehrenfeucht–Fraı̈ssé), les jeux stochastiques et/ou à information imparfaite sur des graphes pour la vérification
de systèmes, la conception de mécanismes incitatifs (« mechanism design »), mais aussi la théorie des
jeux « classique » : jeux matriciels, équilibre de Nash et variantes, jeux à agents égoı̈stes rationnels, etc.
L’expertise du LIAFA reste toutefois fragmentée entre les équipes, malgré des participations conjointes
à des structures de recherche nationales (par exemple, le GT Jeux du GdR IM et, dans une moindre
mesure, le GdR Théorie des Jeux et le GdR Recherche Opérationnelle). Le laboratoire portera donc une
attention particulière au développement d’activités inter-équipes sur les jeux. Ce tout dernier point est
en fait en liaison directe avec le rapprochement LIAFA-PPS discuté dans la section suivante.
2.3
Rapprochement LIAFA-PPS
Cette section décrit le troisième pilier (outre l’identification d’axes transversaux et l’appartenance au
LABEX SMP) sur lequel le LIAFA a construit son projet, à savoir un élargissement du spectre de ses
compétences par un rapprochement scientifique avec le laboratoire PPS. Cette section a ainsi été partiellement rédigée en coordination avec la direction de PPS.
Le rapprochement avec PPS repose principalement sur deux outils : un ensemble de groupes de travail
communs sur des thématiques d’accroche entre les deux unités, et un ou plusieurs séminaire(s) commun(s), dont un séminaire didactique.
2.3.1
Thématiques d’accroche
Les discussions menées entre les deux laboratoires LIAFA et PPS en 2011-2012 dans le cadre de la
demande de fusion initiée par l’INS2I, et tout particulièrement celles tenues depuis quelques mois, ont
permis d’identifier tout un ensemble de thématiques scientifiques sur lesquelles des équipes des deux laboratoires pourraient sinon collaborer, au moins interagir afin d’élargir leur expertise. La liste ci-dessous
donne un ordre d’idée de ces thématiques, sans prétendre à l’exhaustivité puisque tout rapprochement
conduit à l’identification parfois inattendue d’autres points de convergence.
Jeux. La sémantique des jeux est un domaine important d’intérêt pour PPS, en particulier lié à la
modélisation de différentes primitives de programmation, dont les fonctions, le contrôle, les états,
le non-déterminisme, etc., tout en restant proche des langages de programmation. Cet intérêt est
en adéquation avec celui du LIAFA pour les jeux et leurs applications en théorie des automates et
en vérification. Par exemple, certains des travaux récents sur la vérification des schémas récursifs
d’ordre supérieur dans l’équipe Automates et applications reposent de façon cruciale sur des arguments de sémantique des jeux, tandis que d’autres permettent de s’en passer. Comprendre les liens
entre la sémantique des jeux et les logiques de points fixes pour des structures récursives nécessite
une expertise partagée par les membres des deux laboratoires. Ces questions seront au cœur de la
thèse de C. Grellois co-encadrée par Paul-André Melliès (PPS), Olivier Serre (LIAFA) et Luke
Ong (Oxford University), et débutant en septembre 2012. Notons par ailleurs que la sémantique
des jeux (étudiée à PPS) procède selon les principes de la sémantique des traces en théorie de la
concurrence (étudiée au LIAFA).
Parallélisme et distribué. Le LIAFA et PPS travaillent respectivement sur différents aspects de la
concurrence. Dans ce cadre, ils sont conduits à utiliser les mêmes outils, dont en particulier certains issus de la topologie algébrique. A titre d’exemple, l’accès concurrent à des ressources exclusives est étudié par PPS à partir d’une modélisation utilisant la topologie algébrique orientée
(cf les travaux d’Eric Goubault au CEA). De façon semblable, les algorithmes pour les systèmes
asynchrones à mémoire partagée sont étudiés au LIAFA à partir d’une modélisation de l’exécution
des algorithmes par des subdivisions de complexes simpliciaux. Ce point commun entre PPS et
33
LIAFA est illustré par la participation conjointe de membres des deux laboratoires au Dagstuhl
Seminar 12121 : « Applications of Combinatorial Topology to Computer Science ».
Combinatoire et séries formelles. Les deux laboratoires travaillent chacun sur des thématiques les
amenant à utiliser intensivement la théorie des séries formelles. En particulier, cela transparaı̂t à
PPS au travers de l’étude de la théorie des espèces combinatoires, de laquelle dérive une méthode
systématique pour analyser des structures discrètes au moyen de fonctions génératrices, avec des
applications importantes au calcul des substitutions. Et bien évidemment, les séries formelles sont
un objet quotidien d’étude et d’utilisation par l’équipe Combinatoire du LIAFA, mais également,
dans une moindre mesure, de l’équipe Automates et applications et de l’équipe Modélisation et
vérification. L’identification de ce thème est récente, et n’a pas encore donné lieu à des opérations
communes de la part des deux laboratoires. Il s’agit d’un sujet néanmoins porteur sur lequel
LIAFA et PPS comptent collaborer.
Preuve, certification, vérification. Evidemment, les points de convergence sont nombreux entre les
deux laboratoires sur la thématique générale de la preuve et de la vérification. Cela dit, les détails
révèlent de grandes différences entre les objectifs et méthodologies des deux laboratoires. Il est
possible toutefois d’identifier deux points d’accroche : la vérification de composants logiciels, et
l’étude des graphes de dépendances entre composants logiciels (typiquement LINUX), tous deux
en liaison directe avec les efforts de recherche à PPS relatifs au déploiement de logiciels libres.
Des relations informelles existent entre PPS et LIAFA sur les deux thèmes, impliquant respectivement les équipes Modélisation et vérification et Algorithmique distribué et graphes du LIAFA. Il
conviendra de pousser plus avant ces contacts afin de rendre possibles de réelles interactions entre
les deux laboratoires sur ces deux sujets.
Concurrence. La concurrence est l’un des trois axes transversaux du LIAFA mentionnés ci-dessus dans
son projet. Cette thématique fait évidemment également partie des centres d’intérêts de PPS, en
particulier au travers de l’étude des programmes « multi-threads » ou de la programmation par
événements. Nous avons également mentionné plus haut dans ce rapport combien la concurrence
était au centre des préoccupations du LIAFA, en particulier au travers de la vérification de programmes concurrents et de l’algorithmique distribuée. Les laboratoires PPS et LIAFA ont convenu
d’unir leurs efforts sur ce thème afin de faire de la concurrence un domaine de convergence entre
les deux unités. La forme que pourrait prendre cet effort reste toutefois à arbitrer, entre un groupe
de travail spécifique ou un « chapeau » aux thématiques mentionnées ci-dessus, dont « jeux » et
« parallélisme et distribué ».
En guise de conclusion à cette section, il convient de noter qu’il existe d’autres points d’accroche potentiels entre les deux laboratoires, liés à des activités individuelles de certains membres d’une ou l’autre
des deux unités. Un exemple typique est la conception de protocoles de routage pour les réseaux radio
ad hoc, ou la conception de protocoles P2P. Ces domaines d’intérêt sont au cœur des préoccupations de
l’équipe-projet INRIA GANG au LIAFA. De son côté, et de manière indépendante, Juliusz Chroboczek
(PPS) a déposé un RFC (numéro 6126) auprès de l’IETF en 2011 pour son protocole de routage Babel,
et a conçu des extensions de BitTorrent. Ceci illustre que les potentiels de collaborations entre le LIAFA
et PPS sont nombreux, et ne sont certainement pas limités à la liste ci-dessus.
2.3.2
Séminaire didactique
Plus globalement, les deux laboratoires devraient se doter d’outils visant à donner à chaque membre
du LIAFA et de PPS un niveau convenable de culture et de compétences relatives à chacune des
thématiques nombreuses abordées par les deux unités. Ceci pourrait prendre la forme d’un séminaire
didactique régulier. Nous insistons sur le terme « didactique » car l’objectif serait bien de permettre à
tous d’acquérir des compétences, dans le but d’assurer une cohésion entre l’ensemble des chercheurs et
enseignants-chercheurs des deux laboratoires.
34
2.4
Analyse SWOT
La figure 2.1 résume l’analyse SWOT 4 du projet du laboratoire. Certains points sont détaillés ci-dessous,
sans revenir toutefois sur les points déjà évoqués plus haut dans le document.
Le laboratoire tient à souligner non seulement la difficulté de promotion des Maı̂tres de Conférences,
déjà évoquée plus haut, mais aussi la très grande difficulté d’obtenir des promotions pour les ITA (les
quatre personnels administratifs et techniques sont tous CNRS). Sur le long terme, ces difficultés de
promotion font peser le risque d’une démotivation des personnels concernés. Une autre faiblesse du
laboratoire tient au fait qu’il se situe au cœur de l’Informatique, sans être toutefois un laboratoire
« généraliste ». Ainsi, pèse le risque d’un retard dans la perception de l’importance de thématiques
nouvelles liées à des innovations technologiques. Une certaine veille, comme la présence dans des GdR
plus appliqués, comme par exemple ASR, peut toutefois aider à limiter ce risque. Le relatif peu d’attrait
exprimé par la majorité des membres du laboratoire envers les applications se traduit d’ailleurs par un
faible rendement du LIAFA en terme de valorisation et de développement logiciel. Certes, on ne peut
pas être « au four et au moulin », mais il n’empêche qu’un effort de valorisation serait évidemment
bienvenu, sans pour autant modifier la nature des recherches menées au sein du laboratoire.
La qualité générale des thèses du laboratoire est remarquable. Cela est en partie dû à l’attention toute particulière portée par les membres du laboratoire envers le recrutement de leurs étudiants. Cette politique
de recrutement élitiste des doctorants (qui, certes, pourrait être critiquée) repose en grande partie sur la
qualité des étudiants de master issus du MPRI. Notons en particulier que la thèse d’André Chailloux
(élève du MPRI, thèse au sein de l’équipe Algorithmes et complexité) a obtenu le dernier prix Gilles
Kahn en 2011. Faire reposer le recrutement des doctorants sur un unique master est toutefois une relative menace. Le laboratoire a donc entrepris d’élargir son spectre de recrutements vers l’international,
incluant des co-tutelles au niveau doctorat et l’attraction d’étudiants étrangers afin d’alimenter le MPRI
au niveau master. La présence du LABEX SMP est sur ce point, entre autres, une source d’opportunités
qu’il conviendra de saisir. Le LIAFA se doit néanmoins de rester attentif concernant sa politique de
recrutement de ses doctorants afin de préserver la qualité des doctorants tout en augmentant son taux
d’encadrement (qui demeure relativement faible, malgré une croissance de 1 à 1,2 entre 2007 et 2012).
Le laboratoire dépend majoritairement des programmes de l’ANR, tout particulièrement des programmes « Blancs » et « JCJC », pour l’obtention de ressources propres. La relative étroitesse de ces
sources de financement fait évidemment peser une menace sur les ressources financières du LIAFA.
Quelques équipes ont obtenu des financements européens (par exemple des STREP 5 ). Egalement, le laboratoire peut s’orgueillir d’une certaine réussite auprès de l’ERC lors des récents appels. Il conviendra
de renforcer ces efforts afin de diversifier les sources de financement de l’unité.
Enfin, l’IDEX Sorbonne Paris Cité est mentionné dans le diagramme dans la rubrique « opportunité »,
pour les raisons mentionnées précédemment dans le rapport. Il convient de noter que ce même IDEX
est également partiellement source sinon de menaces au moins de difficultés. Ainsi, la Fondation SMP
est à cheval sur plusieurs IDEX, et la potentielle création d’une unique université regroupant les entités
actuelles de l’IDEX n’ira pas sans peser sur des structures telles que l’UFR d’Informatique de Paris
Diderot, voire ses laboratoires.
4. Force (Strength), Faiblesse (Weakness), Opportunité (Opportunity), Menace (Threat).
5. Specific Targeted Research Projects.
35
–
36
le
n
M
en
ac
vi te
e
so vie ur
ur r d de
ce ’é s
de tud pro
fin ian mo
an ts tio
ce étr ns
m oit IT
en
A
t é
tro
it e
–
ité
–
–
n
tu
PS
or
-P
FA
pp
ité
O
IA
C
tL
ris
en
Pa
em MP e
ch S nn
ro on bo
pp ti or
ra nda S
fo EX
ID
–
–
EXTERNE
F IGURE 2.1 – Analyse SWOT du projet 2014-2018 du LIAFA
NEGATIF
e
fo
no rte
co mb ac
– thé ntin re tivit
vi m u ux é
de sib ati ité pe de
no ilité que et h rso pub
om nn lic
m in
br te
og els atio
eu rn
én CN ns
x ati
éi R
m on
té S
em a
Fo
l
e
b
re
rc
s
–
–
–
t
en el
em ur
dr ult
ca t c ne
en n li
d’ me scip
n
io
ux le di
ot
ta ’iso la
el
le d e e rom
et gici
ib e d
fa qu in iqu p
on lo
– ris se at de dC ati nt
– au form ulté M oris me
in fic les al pe
e
v
f
r
e op
di
ss
u
d
o
el
le
–
v
p
u
ib
pe e dé
Fa
d
–
S W
O T
POSITIF
INTERNE
Part II
37
Chapter 1
1.1
1.1.1
Research areas and main objectives
Development of the team
The current “Algorithms and Complexity” team was part of the “Algorithms and Complexity” team of
LRI until November 1, 2010 when, at our request, it was transferred by a decision of the President of the
CNRS to LIAFA. The combinatorics and graph theory part of the LRI team stayed in LRI, it is the part of
the team whose research concentrates on classical and quantum algorithms and complexity that moved
to LIAFA. The move involved 5 CNRS researchers (Kempe, Kerenidis, Magniez, Rosén and Santha) and
a Professor at Panthéon-Assas (de Rougemont) who performs his research in LIAFA. The situation of S.
Laplante, Professor at Paris-Sud, remained somewhat particular: while an associate member of, and in
practice present at LIAFA, she stayed officially for her research at LRI. We hope that she will move soon
as Professor to Paris Diderot: on May 11 she was ranked 1st for a position by the Selection Committee.
Since the move there were two changes: D. Xiao was hired as a CNRS researcher in October 2011, and
J. Kempe left the team en “détachement” in December 2011.
The move to LIAFA was the result of a long and arduous process that started in 2007. The reasons of
the move were manifold. If we have to summarize them in one sentence, we felt that the quality of our
scientific work could only be kept, and the cohesion of the team could only be safeguarded in Paris. And
if we want to summarize again in one sentence our current situation: we are satisfied with our life in
LIAFA, and while it is too early to assess the global outcome, we feel that in many aspects our objectives
were achieved or are in the process of being achieved. We describe now more in details the outcomes of
the move in the relatively short period since November 2010 in three fields: research, scientific policy,
and teaching.
Being in LIAFA has improved substantially our research environment. The number of our prospective
international visitors has significantly increased with respect to the previous years. Similarly, the quality
of the candidates for our postdoc positions was much higher in 2012 than before: among the more than
forty applicants there were several graduates from the topmost US universities. We strengthened or improved our ties with several research teams in Paris. With Télécom Paris-Tech we keep on co-organizing
the trimestrial “Quantum Information Day in Paris”. We have a joint ANR “Jeunes Chercheurs ” project
with them, and a PhD student is co-advised by the two teams in the framework of this project. With the
cryptography group of the ENS LIENS we co-organize a “cryptography-complexity” day in June 2012.
Our application with the geometry, combinatorics, and algorithms group of the same laboratory for a
joint ANR BLANC grant RDAM has been very recently accepted. We currently have a joint ANR blanc
project with LIP6, entitled “New Technniques in Online Computation (NeTOC)”, 2012-2105. In March
2012 at the Ile de Ré we organized the Ecole de Printemps d’Informatique Théorique on probabilistic
algorithms where the lecturers came, beside from our team, from LIAFA, ENS, and from abroad.
39
CHAPTER 1. RESEARCH REPORT: ALGORITHMS AND COMPLEXITY
Concerning scientific policy, we believe that inside LIAFA we play a dynamic role including various
collaborations with the other teams, and in the Université Paris Diderot we have an increasing visibility. Our weekly seminar regularly attracts persons of the laboratory, and we also often attend the
seminars and working groups of some of the other teams. We had a successful joint application with
the “Distributed Algorithms and Graphs” team for a postdoctoral position at the Fondation Sciences
Mathématiques de Paris (unfortunately the applicant choose an assistant professor position at Stanford).
Nicolas Schabanel, a member of the same team is also part of our new joint LIAFA-LIENS ANR grant
RDAM. With the “Equipe de Logique” of Paris Diderot we led the ANR project VERAP (2007-2011)
on approximate verification and plan to jointly explore new subjects related to the approximate enumeration of solutions. We co-organized in January 2012 at Paris Diderot the annual workshop of the GdR
“Informatique Mathématique”, and with the Fédération de Recherche en Mathématiques de Paris Centre
we organized a two days workshop in May 2012 on quantum information theory with the participation
of computers scientists, physicists and mathematicians.
We teach in two Master programs (M2) associated with Paris Diderot, in the Master “Logique
Mathématique et Fondements de l’Informatique” and in the “Master Parisien de Recherche en Informatique”. Since we moved to Paris we are much closer to the students, our contacts with them became
more frequent, regular and fruitful. We reorganized several of our courses in the MPRI, and we established a rotating teaching including also Nicolas Schabanel. Starting 2013 we plan to teach a joint course
with the ENS LIENS. We also have a new project course for M1 and M2 Pro years at Paris Diderot on
randomized and approximation algorithms. Last, we are involved at Ecole Polytechnique in its teaching
program (L3 and M1).
We would like to shortly assess the main points of the AERES March 2009 evaluation of the team (still
at LRI at that time). We consider that we kept our strong points: our scientific quality, our network
of international collaborations and our attractiveness. We had 12 publications in the SIAM Journal on
Computing, 5 publications in Algorithmica, and we have published 11 papers in IEEE FOCS/ACM
STOC, 6 papers in Conference on Computational Complexity and 7 papers in ICALP. We participated
in 3 EU projects (one integrated, one STREP, one CHISTERA), several international projects (with
Canada, Hungary, Japan and one with various Asian countries), we lead an LEA with Israel and we
participate in an UMI with Japan and in an LIA with Singapore. In quantum computing we belong to
the few best teams in the world. While in classical computing we are not at the same level, our quality
is high, and our work is acknowledged by the community. We have successfully initiated studies in new
models of computing, such as streaming algorithms, and strengthened our position in online algorithms
and algorithmic game theory. The arrival of David Xiao had extremely positive effects on the team: his
expertise in learning theory, complexity and classical cryptography very nicely completed our research
directions. The move to LIAFA made our scientific cohesion stronger: we are a very coherent team, we
know and appreciate each other’s work, and we can together fully concentrate on the domains where we
are the best.
We think that we have successfully addressed at least two of the three critical remarks of the 2009 evaluation. Our scientific influence in LIAFA is certainly much stronger than it was in LRI, we naturally have
common interests with several other teams and, as we described in the outcomes of our move, we have
initiated several joint actions. We believe that we have also seriously strengthened our involvement in the
national computer science research framework. Again, as described above, our move to LIAFA created
for us a more favorable research environment inside Paris Diderot. But our involvement has increased
also independently from the move. We play a leading role in the GDR Informatique Mathématique
and the GDR Information Quantique, Fondements & Applications where we regularly organize yearly
workshops and also participate in meetings outside our immediate workgroups, such as ALEA. We have
worked to expand our presence both locally, for example by organizing events and joint projects with
ENS, as well as nationally, for example speaking at the annual meeting of the Société Mathématiques de
40
France. We also hope that the March 2012 Ecole de Printemps has also contributed to mark our position
as a central player in theoretical computer science community in France.
While it is too early to judge the long term effects of our installation to LIAFA for the formation of
PhD students, we think that we move also here in the right direction. Three new PhD students have
started their doctorate last year, and we have (co-)directed several master theses both from MPRI and
from Canada in the framework of the CSQIP training program. And, of course, we were very proud that
André Chailloux has won the Gilles Kahn prize in 2011.
1.1.2
1.1.2.1
Description of our main scientific results
Classical algorithms and complexity
Property Testing Randomization and also approximation are important tools in algorithmic whose
number of applications increases dramatically with the new challenges of modern computer science.
We are particularly interested in the design of sublinear algorithms, i.e. algorithms that do not read all
of their input. Such algorithms were pioneered by Property Testing, a statistics based approximation
technique to decide whether an input satisfies a given property, or is far to any input satisfying the
property. In this area, we initiated the study of property testing for the edit distance with moves in the
contexts of words [FMR10], XML databases [CJR08] and Markov Decision Processes [RT09].
Streaming and Online Algorithms Another challenge is to handle restrictive accesses to the input.
Streaming algorithms and Online algorithms fit into this setting. We have defined a novel model of online computation with advice, where online algorithms have some partial information about the future.
We have shown the applicability of this model by giving several results for some classical online problems such as Metrical Task Systems and the k-server problem [EFKR11; RR11b]. We also gave online
algorithms, and sometimes offline approximation algorithms, for various problems in communcation
networks and adjacent fields [LPSR09; RR11a; RS11]. In the area of streaming algorithms, we initiated the study of memory space complexity of language recognition [MMN10] with application to large
XML databases [KM12]. We have also studied graph-theoretic problems in the streaming setting, such
as interval selection [EHR12] and maximum matching [KMM12].
Cryptography and Game Theory One of the other challenges brought on by the new pervasive nature of data is the question of trust. Trust can come in the form of cryptographic protocols, which ensure
secrecy and authenticity, or it can come in the form of game-theoretic mechanisms that use money and
utility to incentivize individuals to behave truthfully. We have studied the robustness of the computational problems underlying modern cryptography [HMX10; MX10], the optimal efficiency of various
cryptographic protocols such as Zero Knowledge and bit commitment [GWXY10; Xia11b; Xia12], and
the efficiency of analyzing their behavior as in computing equilibria [HRS08; MRSZ11]. We have also
studied the “converse” of cryptography, relating the complexity of various models of machine learning [Xia10].
Limitations: Query and Communication Complexities We developed the study of the limitations
of the models described above. The query complexity measures only the number of input bits queried
for computing functions. We studied the recursive 3-majority function in this model, and provided the
best-known randomized algorithm and lower bound [MNSX11]. Main other techniques are based on
reduction to problems of communication complexity where information theory plays a central role as
one of the new powerful techniques. We developed general methods to prove lower bounds based on
Kolmogorov arguments [KL09] and information theoretical ones [KLLRX12]. Motivated by streaming
algorithms applications, we also provided new lower bounds to explicit problems [IKLSW12; MMN10].
41
1.1.2.2
Quantum algorithms and complexity
Quantum algorithms The main purpose of quantum computing is to design, for specific problems,
faster quantum algorithms than any known classical procedure. For some class of problems the potential speedup is exponential, in other cases it is polynomial. In the former category we have conceived
fast quantum algorithms for group theoretic questions, often related to the paradigmatic hidden subgroup problem [DISW11a; ISS07; ISS08a; ISS12]. For the latter case our research has concentrated on
quantum query complexity of search algorithms via quantum walks. We have obtained several generic
results about the quantization of classical Markov chains [KMOR10; MNRS07; MNRS09; San08], and
we have applied these results to design specific algorithms for triangle [MSS07], group commutativity testing [MN07] and for constant size subgraph finding [LMS11]. We have also found a surprising
application of quantum walks for Merkle puzzles [BHKKLS11a].
Communication complexity, games, non-locality The common thread in our study of communication complexity has been to study the classical and quantum models side-by-side in order to understand
the similarities and differences between them. We have shown exponential gaps between classical and
quantum models for the Hidden Matching problem [BJK08; GKKRW08; GKRW09]. We have also studied communication complexity from the point of view of quantum non-locality [DKLR11; KKLR11;
KLLRX12; LLR12], and given upper bounds on classically simulating quantum distributions [DLR07].
We have studied the complexity of entangled games [KKMTV11; KKMV09; KRT08; KRT10; KV11]
and shown hardness results on approximating the quantum value of a game.
Cryptography In quantum cryptography, one of the main goals is to study the optimal security parameters for specific fundamental primitives. Moreover, it is important to extend the security proofs
in realistic conditions that take into account the imperfections of the quantum devices. First, we have
found the optimal parameters for coin flipping and bit commitment [CK09; CK11a] and we have studied
a number of other cryptographic primitives, including oblivious transfer, zero knowledge and computational bit commitments [CCKV08; CK08; CKR11; CKS10]. Second, we have studied security in the
device independent model and in the presence of losses and errors [Cha10; PCDK11; SCAKPM11].
1.2
1.2.1
Selected results of significance
Streaming algorithms for large XML databases
In the line of our work in property testing [FMR10; MR07], we investigated streaming algorithms in
the context of XML databases through several papers [CJR08; KM12; MMN10]. Below we describ two
results that were presented at STOC 2010 and ICDT 2012 (best newcomer paper).
We first addressed the problem DYCK of checking matching parentheses, with possibly different types of
parenthesis [MMN10]. This problem is motivated by the concrete problem of checking well-formedness
of XML files. This is also one of the simplest, but still fundamental, non-regular languages. DYCK
has already been addressed in property testing, but nothing was known in the context of streaming
algorithms, except for the simple case of a single type of parenthesis. We presented an optimal one-pass
√
randomized streaming algorithm for DYCK with space O( n), where n is the input size. Surprisingly,
the space requirement shrinks drastically to O((log n)2 ) if we have a second access to the input stream
in reverse.
For the lower bound, we exhibited hard instances of DYCK with length n, that we embedded in a “one√
pass” communication problem with n players. To establish the hardness of the communication problem, we proved a direct sum result using tools from information theory. The primitive instance made
us revisit a standard 2-player communication complexity problem (I NDEX), but in the completely novel
√
point of view of asymmetric communication, and we proved that it requires Ω( n) bits of communication.
42
Then, we studied the problem of validating XML documents of size n against general DTDs in the context of streaming algorithms [KM12]. Because of a reduction to some hard problem in communication
complexity, streaming algorithms were known to require linear memory. Nonetheless, we showed that,
when allowing access to external memory (auxiliary read/write streams), there is a deterministic streaming algorithm that solves this problem with space O(log2 n), a constant number of auxiliary read/write
streams, and O(log n) number of passes.
1.2.2
Quantum cryptographic protocols
Since the discovery of unconditionally secure key distribution by Bennett and Brassard in 1984, a series
of works has investigated what other cryptographic primitives are possible or not in the quantum world.
Two such primitives are Coin Flipping and Bit Commitment. These primitives are fundamental since
most of the cryptographic operations can be based on these primitives.
In Coin Flipping, two parties must agree on a bit that is required to be 0 or 1 with equal probability.
Ideally, we would like that if any party deviates from the protocol, then his cheating probability, i.e. the
probability that he can force the honest player to agree on any particular outcome is no more than 1/2. It
is known that ideal Coin Flipping is impossible without any hardness assumptions, in both the classical
and the quantum setting. In fact, in any classical protocol, the cheating probability is always 1. However,
Aharonov et al. in STOC 2000 provided a quantum protocol where no dishonest player could bias the
coin with probability higher than 0.91. In STOC 2001, Ambainis described an improved protocol whose
cheating probability was at most 3/4. On the other hand, Kitaev in 2003, using a formulation of quantum
coin flipping protocols as semi-definite programs proved a lower bound of 1/2 on the product of the two
cheating probabilities for Alice and√Bob. In other words, no quantum coin flipping protocol can achieve
√
a cheating probability less than 1/ 2 for both Alice and Bob. The question of whether 3/4 or 1/ 2
was ultimately the right bound for quantum coin flipping was finally
√ resolved in our work, where we
showed a quantum protocol that achieves bias arbitrarily close to 1/ 2 [CK09].
The history
√ of Bit Commitment is similar but the final answer is very different. The same gap of 3/4
versus 1/ 2 was also present for quantum bit commitment. Very recently, we proved a stronger lower
bound of 0.739 for the cheating probability of any quantum bit commitment protocol, and we described
a quantum protocol that achieves a cheating probability arbitrarily close to 0.739, hence providing the
optimal value [CK11a].
1.3
Scientific service and influence, honors and prizes
We have a very large network of intensive scientific contacts basically all over the world. The EU
Integrated Project QAP had 35 partners, the EU STREP QCS has 8 partners, and the ANR CHISTERA project has 6 partners. The CSQIP student training program and the STIC-Asie programme both
involve 4 countries. We are co-directing with Tel-Aviv University the LEA French-Israeli Laboratory on
Foundations of Computer Science (FILOFOCS), and we are a participating team in the Japanese-French
UMI JFLI and in the France-Singapore LIA FSQL. We have organized and chaired the 24th IEEE
Conference on Computational Complexity in 2009 in Paris. As described in Section 1.1.1, we play a
key role in the GDR Informatique Mathématique and the GDR Information Quantique, Fondements &
Applications.
We are very proud of several distinctions we have received in the last few years. The “Insignes de Chevalier dans l’Ordre National du Mérite” were attributed to Julia Kempe in 2011, and she has also received
the prize “Femme en Or de la Recherche” in 2010. The thesis of André Chailloux has been awarded in
2011 the Gilles Kahn PhD prize. The contribution of Christian Konrad and Frédéric Magniez to the 15th
International Conference on Database Theory in 2012 [KM12] has obtained the Best Newcomer Paper
Award.
43
1.4
Internal organization
As we have mentioned already, the team is scientifically very coherent. The basis of our arguably very
good relations is our common taste and interest in scientific problems, and our similar approach towards
high quality research. The other important component of these good relations is the mutual personal
trust. While everybody freely selects the subject of her/his research, we naturally have numerous collaborations, and the whole output of the team turns out to be a coherent set in the field of algorithms
and complexity. Of course potential new research areas are regularly discussed, and we times to times
decide to invest collectively in some new domain. This happens usually when we have to deal with new
contracts or with new postdocs/students.
The important decisions are taken collectively. We have a weekly group meeting were all possible
subjects are discussed. In case of diverging opinions we try to pursue the discussion until the emergence
of an option which is agreeable for everyone.
In 2012 we had six national or international projects whose total amount is 1260K euros. We are also
currently applying for several new grants. We always put into each contract the largest possible subset
of the team members that scientifically makes sense. We also try to distribute relatively evenly the
responsibilities of the contracts, each team member has the responsibility of at least one contract in most
moments of time. The contracts are mutualized in the sense that the financing of postdocs, visitors,
travels, etc. by some specific contract is decided (again within the limit of scientific responsibility) at
the weekly group meetings.
Decisions about advising PhD students are taken individually, but of course these are also sometimes
discussed collectively, especially when the student comes from an MPRI course taught by several members of the team. The choice of the postdocs is the result of a long collective process which requires the
work and involvement of all team members (again, we had to choose in 2012 among more than forty
applicants). Short invitations can be made by everyone. Finally, the potential arrival of new team members is discussed very seriously since it concerns the scientific orientations and the smooth functioning
of the team.
44
Chapter 2
Intitulé de l’unité : LIAFA, UMR 7089
Nom du directeur de l’unité : Pierre Fraigniaud
Nom du responsable de l’équipe : Miklos Santha
2.1
Effectifs
2007: 5 chercheurs CNRS, 2 enseignants-chercheurs, 1 postdoc, 6 doctorants
Personnels qui ont quitté l’équipe: J. Kempe (on leave in 2011, 36 mois), N. Vishnoi (CR1 20082009, 7 mois), 8 doctorants (288 mois), 3 postdocs (48 mois)
Recrutement 2011: D. Xiao (CR2)
2.2
Production scientifique
Streaming et test de propriété. A partir de nos travaux sur le test de propriété [FMR10; MR07], nous
avons étudié des algorithmes de streaming pour des bases de données XML dans [CJR08; KM12;
MMN10].
Calcul en-ligne. Nous avons introduit un modèle nouveau de calcul en-ligne avec conseil et montré
son utilitée par des resultats relatifs a des problèmes classiques, comme metrical task system et le
k-server problem [EFKR11; RR11b].
NP-difficulté et cryptographie Nous avons étudié la robustesse de problèmes fondamentaux en cryptographie moderne [HMX10; MX10], l’éfficacité optimale de protocoles cryptographiques nondivulguants ou de mise en gage de bit [GWXY10; Xia11b; Xia12].
Protocoles cryptographiques quantiques. Nous avons trouvé les paramètres optimaux du tirage à pile
ou face et de la mise en gage de bit [CK09; CK11a] et avons étudié d’autres primitives cryptographiques [CCKV08; CK08; CKR11; CKS10]. Nous avons aussi observé une application des
marches aléatoires quantiques aux puzzles de Merkle [BHKKLS11a].
Marches quantiques pour des problèmes de recherche. Nous avons proposé [MNRS07] un cadre
unifié pour des problèmes de recherche définis à partir de marches quantiques, et
prouvé [MNRS09] que le temps d’atteinte d’une marche quantique est la racine carrée du temps
d’atteinte d’une marche classique.
2.3
2.3.1
Bilan quantitatif
Publications
[MMN10] F. Magniez, C. Mathieu, A. Nayak. “Recognizing well-parenthesized expressions in the streaming model”. In:
Proceedings of 42nd ACM Symposium on Theory of Computing (STOC). 2010, pp. 261–270
[EFKR09b] Y. Emek, P. Fraigniaud, A. Korman, A. Rosén. “Online Computation with Advice”. In: Proceedings of 36th
International Colloquium on Automata, Languages and Programming (ICALP). 2009, pp. 427–438
45
CHAPTER 2. FICHE RÉSUMÉ: ALGORITHMES ET COMPLEXITÉ
[MX10] M. Mahmoody, D. Xiao. “On the power of randomized reductions and the checkability of SAT”. In: Proceeedings of
25th IEEE Conference on Computational Complexity (CCC). 2010, pp. 64–75
[CK09] A. Chailloux, I. Kerenidis. “Optimal Quantum Strong Coin Flipping”. In: Proceedings of 50th IEEE Symposium on
Foundations of Computer Science (FOCS). 2009
[MNRS07] F. Magniez, A. Nayak, J. Roland, M. Santha. “Search via quantum walk”. In: Proceedings of 39th ACM Symposium on Theory of Computing (STOC). 2007, pp. 575–584
2.3.2
Logiciels, brevets, rapports, etc.
Habilitation à Diriger des Recherches:
1. Frédéric Magniez, Vérification approchée – Calcul quantique, May 2007
2. Julia Kempe, Quantum Computation, September 2010
3. Iordanis Kerenidis, Interaction in the quantum world, December 2010.
2.3.3
Rayonnement
1. Prix de Thèse Gilles Kahn 2011 de A. Chailloux. Insignes de Chevalier dans l’Ordre National du
Mérite en 2011 et prix “Femme en Or de la Recherche” en 2010 pour J. Kempe
2. I. Kerenidis a reçu un “ERC Starting Independent Researcher Grant” en 2012
3. Organisation de la 24ème Conférence IEEE Computational Complexity en 2009 à Paris
4. Co-direction avec l’Université de Tel Aviv du LEA Laboratoire Franco-Israelien sur les fondements de l’Informatique (FILOFOCS)
5. Large réseau de contacts scientifiques intensifs: Projet Européeen QAP (35 partenaires), EU
STREP QCS (8 partenaires), ANR CHIST-ERA projet (6 partenaires), programme STIC-Asie
(4 pays)
2.3.4
Interactions de l’équipe avec son environnement
1. Implication dans le GDR Informatique Mathématique et le GDR Information Quantique, Fondements & Applications. Co-organisation avec Télécom Paris-Tech du groupe de travail trimestriel
“Quantum Information Day in Paris”
2. Collaborations aver les entreprises Ligaran (Paris, startup sur les Ebooks) et IDQuantique
(Genève, entreprise sur les technologies quantiques pour la communication et la sécurité)
3. S. Laplante. “Le plus grand des hasards : Surprises quantiques”. In: ed. by J.-F. Dars and A.
Papillaut. Belin, 2010. Chap. L’influence de l’informatique, pp. 152–154
4. Plusieurs exposés de vulgarisation (Collège Belgique, Ens Lyon, Fondation Sciences
Mathématiques de Paris).
5. Participation à plusieurs projets et expositions développées par Sylvie Tissot d’Anabole (Paris,
petite entreprise multimédia) sur les représentations du calcul quantique.
2.3.5
Actions de formation
1. Masters (M2) de Paris Diderot: “Logique Mathématique et Fondements de l’Informatique” (1
cours) et “Master Parisien de Recherche en Informatique” (3 cours)
2. Programme d’échange d’édutiants Collaborative student training in Quantum Information Processing entre l’ Europe (3 pays) et le Canada
3. “Ecole des Jeunes Chercheurs en Informatique Mathématique” (2009, co-organisation) et “Ecole
de Printemps d’Informatique Théorique” (2012, organisation)
4. Participation à 2 écoles thématiques sur l’informatique quantique à Montréal (2010)
46
Chapter 3
Laboratory’s name: LIAFA, UMR 7089
Laboratory director’s name: Pierre Fraigniaud
Team leader’s name: Miklos Santha
3.1
Members
2007: 5 CNRS researcher, 2 faculty members, 1 postdoc, 6 PhD students
Permanent members who left the team: J. Kempe (on leave in 2011, 36 month), N. Vishnoi (CR1
2008-2009, 7 months), 8 PhD students (288 months), 3 postdocs (48 months)
Hiring in 2011: D. Xiao (CR2)
3.2
Scientific outcomes
Streaming algorithms and Property Testing. In the line of our work in property testing [FMR10;
MR07], we investigated streaming algorithms in the context of XML databases in several papers [CJR08; KM12; MMN10].
Online computation. We have defined a novel model for online computation with advice and have
shown its applicability for some classical online problems such as metrical task systems and the
k-server problem [EFKR11; RR11b].
NP-hardness and cryptography We have studied the robustness of computational problems underlying modern cryptography [HMX10; MX10], the optimal efficiency of cryptographic protocols
such as zero-knowledge and bit commitment [GWXY10; Xia11b; Xia12].
Quantum cryptographic protocols. We have found the optimal parameters for coin flipping and bit
commitment [CK09; CK11a] and we have studied a number of other cryptographic primitives
[CCKV08; CK08; CKR11; CKS10]. We have also found a surprising application of quantum
walks for Merkle puzzles [BHKKLS11a].
Quantum walks for search problems. We provided [MNRS07] a unified and simple framework for
designing search algorithms via quantum walks, and proved [MNRS09] that the quantum hitting
time of a random walk is the square root of its classical hitting time.
3.3
3.3.1
Quantitative assessment
Publications
[MMN10] F. Magniez, C. Mathieu, A. Nayak. “Recognizing well-parenthesized expressions in the streaming model”. In:
Proceedings of 42nd ACM Symposium on Theory of Computing (STOC). 2010, pp. 261–270
[EFKR09b] Y. Emek, P. Fraigniaud, A. Korman, A. Rosén. “Online Computation with Advice”. In: Proceedings of 36th
International Colloquium on Automata, Languages and Programming (ICALP). 2009, pp. 427–438
[MX10] M. Mahmoody, D. Xiao. “On the power of randomized reductions and the checkability of SAT”. In: Proceeedings of
25th IEEE Conference on Computational Complexity (CCC). 2010, pp. 64–75
47
CHAPTER 3. EXECUTIVE SUMMARY: ALGORITHMS AND COMPLEXITY
[CK09] A. Chailloux, I. Kerenidis. “Optimal Quantum Strong Coin Flipping”. In: Proceedings of 50th IEEE Symposium on
Foundations of Computer Science (FOCS). 2009
[MNRS07] F. Magniez, A. Nayak, J. Roland, M. Santha. “Search via quantum walk”. In: Proceedings of 39th ACM Symposium on Theory of Computing (STOC). 2007, pp. 575–584
3.3.2
Software, patents, reports, etc.
Habilitation à Diriger des Recherches:
3. Iordanis Kerenidis, Interaction in the quantum world, December 2010.
3.3.3
Influence of the team
1. Gilles Kahn PhD prize in 2011 for the thesis of A. Chailloux. “Insignes de Chevalier dans l’Ordre
National du Mérite” in 2011 and prize “Femme en Or de la Recherche” in 2010 to J. Kempe.
2. I. Kerenidis has obtained an ERC Starting Independent Researcher Grant in 2012
3. Organization of the 24th IEEE Conference on Computational Complexity in 2009 in Paris
4. Co-direction with Tel Aviv University of the LEA French-Israeli Laboratory on Foundations of
Computer Science (FILOFOCS)
5. Very large international network of intensive scientific contacts: EU Integrated Project QAP (35
partners), EU STREP QCS (8 partners), ANR CHIST-ERA project (6 partners), STIC-Asie program (4 countries)
3.3.4
Interactions between the team and its environment
1. Key role in the GDR Informatique Mathématique and the GDR Information Quantique, Fondements & Applications. Co-organization with Télécom Paris-Tech of the trimestrial workshop
“Quantum Information Day in Paris”
2. Collaborations with the companies Ligaran (Paris, startup on Ebooks) and IDQuantique (Geneva,
company on quantum technologies for communication and security)
3. S. Laplante. “Le plus grand des hasards : Surprises quantiques”. In: ed. by J.-F. Dars and A.
Papillaut. Belin, 2010. Chap. L’influence de l’informatique, pp. 152–154
4. Several popularization talks (Collège Belgique, Ens Lyon, Fondation Sciences Mathématiques de
Paris).
5. Participation to several projects and expositions developed by Sylvie Tissot from Anabole (Paris,
small multimedia company) on representations of quantum computing.
3.3.5
Teaching
1. Master programs (M2) of Paris Diderot: “Logique Mathématique et Fondements de
l’Informatique” (1 course) and “Master Parisien de Recherche en Informatique” (3 courses)
2. Student exchange program Collaborative student training in Quantum Information Processing
between Europe (3 countries) and Canada
3. “Ecole des Jeunes Chercheurs en Informatique Mathématique” (2009, co-organization) and
“Ecole de Printemps d’Informatique Théorique” (2012, organization)
4. Participation to 2 advanced schools in quantum information processing at Montreal (2010)
48
Chapter 4
4.1
4.1.1
Research objectives
Scientific outlook
Massive data There is already an explosion in the size of the data that algorithms are called upon
to process in everyday real time applications. Examples of such applications occur in bioinformatics
for genome decoding, in Web databases for the search of documents, or in network monitoring. More
advanced settings involve graph structured data such as biological or social networks, E-R schema,
work flows and the Web. Recent network applications use streams defined over the massive graph
infrastructure. For example, the graph vertices represent web pages or IP addresses, and the edges
represent links between web pages or communication activities among IP addresses.
This proliferation of massive data sets brings with it its own set of special computational challenges.
The standard view of computing puts the spotlight on the output rather than on the input. Traditionally,
limited computational resources are leveraged by lowering expectations about the quality of the output,
resorting to, for example, approximation algorithms (producing a sub-optimal output) or randomized
Monte Carlo algorithms (producing a not necessarily correct output).
However, with the “data avalanche” that arises in a wide range of scientific and commercial applications,
dwarfing anything seen before, that standard view is not sufficient to capture the quantity and widely
distributed nature of data now being gathered by diverse institutions and individuals. With such changes
of scale, and with indirect access to input that might not be “truthfully” reported, new structures are
built, and there is a clear need for different models. This social behavior explains the shift in focus
toward the input, prompting new questions in algorithmic design and computational complexity. Thus
some areas have gained increased prominence, sometimes greatly so: sub-linear algorithms, property
testing, streaming algorithms, online computing, distributed computing, and algorithmic game theory.
In most of those areas, the goal is to study some notion of restricted data access, modeled with an appropriate notion of complexity. Then algorithms are designed, giving a trade-off between traditional time
and space complexity on the one hand, and data access complexity on the other hand. Of course this
complements rather than replaces old paradigms: to fight intractability in the new settings, approximation and randomization still come into play.
Quantum information area - Hybrid network Quantum Information Processing has the potential to
revolutionize the future of information technologies. A tremendous research effort by computer scientists, physicists, mathematicians, engineers, has been put into addressing each of the major challenges in
the area, from quantum algorithms and complexity to quantum cryptography, to large-scale realizations
of quantum computers, to error correction. Shor’s algorithm for factoring shows that quantum computers are probably more powerful than classical ones and moreover that most currently used classical
cryptographic systems, such as RSA, are vulnerable against quantum computers. In addition, the ability
49
CHAPTER 4. RESEARCH PROJECT: ALGORITHMS AND COMPLEXITY
to communicate over quantum channels has made it possible to revisit unconditionally secure cryptography. In one of the most celebrated results in quantum computation, Bennett and Brassard showed that
it is possible for two parties to distribute a secret key in a way that is unconditionally secure against
all attacks. We note that there have been real implementations of key distribution over hundreds of
kilometers.
Our long-term vision of the quantum information era is a network of quantum and classical devices,
where individual agents have the ability to communicate efficiently in a variety of ways with trusted
and untrusted parties and securely delegate computational tasks to a number of untrusted large-scale
quantum computing servers.
In such an interconnected world, the notion of security is an imperative. When one is concerned with
the notion of security, it is wise to build systems that are secure not only against current adversaries, but
also against future malicious parties with ever more sophisticated computational abilities, in particular
adversaries with the ability to perform quantum computations and hence break most currently used
cryptosystems. It is, therefore, an urgency to strengthen the foundations of cryptography, in order to
make them adequate for a quantum world.
Moreover, it is necessary that the interaction between agents remains efficient and takes advantage of
the power of quantum information that can drastically reduce the communication overhead for several
distributed computational problems. In order to guarantee the viability and robustness of the network it
is also important to provide the agents with incentives for honest behavior.
The realization of such a complex network of classical and quantum communication must rely on a
solid theoretical foundation that nevertheless is able to foresee and handle the intricacies of real-life
implementations. The study of security and efficiency of quantum communications is inherently related
to the fundamental notions of quantum mechanics, including entanglement and non-locality, as well as
to central notions in classical complexity theory and cryptography.
4.1.2
Our long term scientific goals: Efficiency and Security
The first challenge we will address is how to guarantee efficiency in the novel computational models that
arise from the need of manipulating massive data and from the existence of hybrid classical-quantum
networks. Indeed, the very notion of “efficient” has evolved since the early days of computer science,
where it typically meant polynomial time. Today, “efficient” algorithms must often work in logarithmic
space (as is often the case in streaming), make decisions without seeing the entire input (as in online
algorithms), only see a small constant number of bits of the input (as in property testing), or not see the
true input but only what agents report (as in algorithmic game theory). “Efficiency” also means different
things in quantum settings, where we seek to build algorithms and protocols that are exponentially faster
than their classical counterparts. Our goal is to build classical and quantum algorithms and protocols
that are efficient and will be essential components of the future information era.
The second challenge we will address is how to guarantee security in the future information era. The
integration of computation into more areas of our lives has raised the concern that our data may be
misused or leaked. Embarrassing accidents where private user information is leaked are alarmingly
common, such as when Sony inadvertently lost its users’ credit card information, or when Apple was
revealed to be secretly logging users’ location data on their iPhones. Our goal is to develop cryptography
and privacy techniques that are able to protect against such violations, hence maintaining confidence in
the information infrastructure and promoting the continued growth of online economic activity. Moreover, we would like to look at security against any future adversary, including ones that may possess
quantum computers.
50
4.1.3
Detailed descriptoin of research objectives
In order to achieve our aforementioned long term goals we will proceed by working on three main axes:
Restricted Data Access, Uncertainty and Development of Tools. Each axis is subdivided in a number
of tasks that will be pursued in parallel. All members of the group will work in several such tasks in
collaboration with each other and with other researchers in France and internationally.
4.1.3.1
Restricted data access
Query complexity Even relatively simple functions are poorly understood from the point of view of
query complexity. One function that has been widely studied is the recursive majority of 3 functions. We
gave the best currently-known upper and lower bounds for this function [MNSX11], but these bounds
still not match. We will explore further directions by looking at different strategies to improve the
bounds.
Quantum query complexity is a well established field on his own. We plan to continue working on the
potential applications of quantum walks. In a recent work Belovs has proposed an alternative approach
to construct quantum algorithms using the computational model of a learning graph. While learning
graphs can simulate all known quantum walk based algorithms, it is an open problem if the inverse
simulation is possible. We propose to study in depth the computational power of learning graphs, and
their relationship with quantum walks.
Property testing In property testing, we would like to have a better understanding on the dependence
between the complexity and the approximation parameter. For practical considerations, this dependence
can be at most polynomial, whereas it is often exponential, such as in our previous work on Markov
Decision Processes (MDPs) [RT09].
In the context of quantum computing, property testing can be generalized in two directions either by
allowing quantum algorithms or by considering the (classical) test of quantum devices. We contributed
and plan to pursue to both directions [DMMS07; FMSS09]. The second one is of practical importance.
In a near future, one will buy quantum devices, at least for cryptographic settings. We want to design
simple experiments that ensure the correctness of those equipments.
Streaming algorithms We initiated the study of the space complexity for deciding membership to
a given language, when only sequential access to input is allowed [KM12; MMN10]. But still very
little is known here, especially when the number of passes (and their directions), and (constant) number
of auxiliary read/write streams are parameters. We will pursue our study in order to understand and
characterize this new hierarchy.
We are also interested in graph semi-streaming algorithms, in which the available memory is roughly
linear in the number of vertices. Flows are a family of problems that are pervasive in network applications. We have started studying maximum cardinality matching [KMM12], a special case of flows.
We are also interested graph theoretic problems such as dominant set or independent set, for which we
obtained tight results in the case of sets of intervals [EHR12].
Online algorithms In online algorithms we plan to study, and quantify, the impact of partial information about the future on the performance of the online algorithm, using the model of online compitation
with advice that we have introduced [EFKR11]. We plan to revisit classical online problems, as well as
to study new problems, and to give upper and lower bounds on the attainable competitive ratio in terms
of the number of bits of information about the future that the online algorithm receives together with
each request.
51
4.1.3.2
Uncertainty
Complexity of cryptography In cryptography, we will aim to make the security of cryptographic systems stronger by studying the possibility of building secure cryptography based on NP-hard problems.
In previous work, we provided evidence that there are formal reasons why this goal may be unattainable [HMX10; MX10], and we will seek to extend our previous work for example by studying the related
question of how efficient one can possibly make proofs for UNSAT (the complement of SAT).
Another goal in cryptography is to make cryptographic systems as efficient as possible for the honest
users. Extending our previous work [GWXY10; Xia11b; Xia12], we will also seek to optimize the
efficiency of cryptographic protocols such as zero knowledge proofs and commitment schemes. In
quantum cryptography, we will seek to provide optimal protocols for some fundamental cryptographic
primitives, including oblivious transfer and zero knowledge.
Differential privacy Differential privacy is a rigorous notion of privacy, which states that the output of
an analysis of some database should not reveal too much information about any individual whose data
appears in the database. In continuing ongoing work [Xia11a], we will look at the tradeoffs possible
between differential privacy and accuracy of the output data, incentives that surround differential privacy,
and we will also look at multi-party computation protocols for achieving differential privacy.
Security in realistic conditions We will extend our security proofs of quantum cryptographic primitives to realistic conditions in order to guarantee security of real life implementations of such primitives
with current technology. In addition we will construct protocols for verifying the correctness of quantum
devices.
Algorithmic Game Theory Classical Game theory studies the interaction of many players who take
independent decisions. Natural notions of Equilibria have been introduced in the 1960s and Algorithmic Game theory studies the complexity of these problems and the possible algorithms to reach such
Equilibria. These problems are in NP and coNP, and the complexity classes PLS and PPAD have been
introduced to capture their exact complexity. We study approximate algorithms for Nash Equilibria for
specific classes of games, such as Congestion games [MRSZ11], and fast dynamics which may lead to
such approximate Equilibria.
Quantum Mechanics through a cryptographic lens We would like to understand fundamental notions of quantum mechanics, including entanglement and non-locality, by looking at them through a
cryptographic lens. More precisely, can we unify the fundamental constants that appear on one hand,
in Bell inequality violations, and on the other hand, as the optimal parameters of coin flipping and bit
commitment.
4.1.3.3
Development of Tools
Quantum techniques from quantum nonlocality Since quantum communication is more powerful
than classical communication, quantum lower bounds often require new techniques. Some of the
stronger techniques in communication complexity apply to classical communication only. We would like
to extend these techniques to the quantum case, by using our understanding of quantum non-locality. We
also would like to show some gaps between the classical and quantum methods, in order to understand
the difference between classical and quantum phenomena.
Direct sum theorems Another central question in communication complexity is the direct sum question: given a function f with communication complexity C, how much communication is necessary to
compute n independent copies of f ? This question remains open for the case of randomized communi√
cation complexity; the best known results of Barak et al. shows that roughly Ω( nC) communication
is necessary. As was shown by Braverman and Rao, an inherently related question is whether communication can be compressed. We propose to study these questions by applying tools from various areas
52
of computer science, including information theory and quantum techniques. Furthermore we will seek
to apply any tools developed in the study of direct sums and compressing interactive communication to
the study of streaming algorithms and other limited-data-access models.
Duality of communication and queries The adversary method in quantum query complexity has
been shown to be optimal. Lee et a have shown that the adversay method, in its dual formulation,
coincides with a generalization of the factorization norm method of Linial and Schraibman, a lower
bound for communication complexity. We would like to understand the underpinnings of this result, and
see whether this might lead to optimal bounds in quantum communication complexity as a result. These
results apply to quantum complexity, and a second goal is to prove analogous results for classical query
versus communication complexity.
4.2
Project implementation
Positioning and SWOT analysis (see Figure 4.1) We consider that in the last few years we have
successfully identified the new scientific challenges in information and communication technologies
presented by the arrival of problems on massive data set, the related privacy and security consideration,
and the prospect of unconventional models of computing. We believe that these challenges hold a
tremendous research opportunity, and since they are interconnected, the only way to successfully address
them is to address them simultaneously. The potential threat we can see for a research team in this new
context is that it is not able to identify clearly the relevant problems it has to address, or that it lacks in
competence to do that, and therefore falls behind its competitors.
We think that our double competence in classical and quantum computing is our greatest strength. It is a
quite unique characteristic, and it gives us considerable advantage for tackling new scientific issues. Our
highest priority is excellence. We are confident that in the field of quantum information theory we will
keep our leadership position in quantum computing, complexity, communication and cryptography. If
the opportunity presents itself, we would like to secure our strengths in quantum games and interaction.
In classical algorithmic we very consciously focus our work more and more on input driven computing,
and we had already some important achievements in property testing, online and streaming algorithms.
The recent arrival of David Xiao has considerably reinforced our competences in security. Still, we feel
a relative weakness here in the sense that while our international research status is good in classical
computing, it is not at the same level as our position in quantum computing.
We will try to use, whenever possible and reasonable, a unified approach involving classical and quantum computing. Such a simultaneous approach to algorithmic problems often inspires concepts and
solutions that otherwise most likely would not have been invented or found. Also, our team is very
coherent and we regularly update each other about the latest results in our respective specialities. In
consequence we believe that we can successfully meet the challenge of rightly identifying worthy research subjects and exploiting new opportunities. To raise further our quality in classical computing
we intend to make the highest profit of our national and international collaborations where our partners
have relevant competences. We will also pursue our dynamic postdoc hiring procedure which was rather
successful in 2012.
Partnerships We have a very wide network of international collaborations some of which go back to
more than 20 years. The list of our partners in our current international projects include the following
institutions: University of Latvia Riga, University of Bristol, CWI Amsterdam, Tel Aviv University,
Université Libre de Bruxelles, Institute of Photonic Sciences Barcelona, University of Cambridge, Université de Genève, University of London Royal Holloway, Chinese University of Hong Kong, National
University of Singapore, Tata Institute of Fundamental Research Mumbai. Our partners in the three
CNRS international research unit we participate in are: University of Tokyo, National Institute of Informatics, Keio University, Centre for Quantum Technologies Singapore and Tel Aviv University. We also
53
plan to maintain strong links in the future with the following institutions in North America: UC Berkeley, Rutgers University, Institute for Advanced Study Princeton, Université de Montréal, University of
Waterloo.
The partners in our current national projects are Télécom ParisTech and LIP6 at the Université Pierre et
Marie Curie. Other teams we would like to collaborate with in the future include the LIENS at ENS Ulm.
With the LIENS we are organizing a joint crypto-complexity workshop in June 2012 which features talks
about topics that may lead to further collaboration between the groups. In LIAFA we have the strongest
link with the “Distributed Algorithms and Graphs” team: we regularly attend each other’s seminar, we
started a project on non local correlations, and we will share a course in the MPRI.
We are currently applying for three joint research projects. Our 4 years ANR BLANC proposal “Algorithmic Techniques for Restricted Data Access Models” (RDAM) is jointly filed with the LIENS.
Here we plan to complete our competence in randomized and quantum computing with the competence
of the LIENS in approximation algorithms. Our second proposal “Managing Uncertainty in Informatics” (MUNI) is in collaboration with the Institute for Interdisciplinary Information Sciences (IIIS) at
Tsinghua University, Beijing. It is between the ANR (BLANC International) and the National Natural
Science Foundation of China, and its prospective length is is also 4 years. The purpose of the project is to
build deeper collaborations in questions related to the handling of uncertainty, such as noise in data analysis and machine learning, and secure computing in an adversarial environment. Our third proposal is a
STREP in the framework of the FET Proactive Initiative in Quantum Information Communication and
Technologies. The 3 years project “Quantum Algorithmics” (QALGO) next to LIAFA brings together
research institutes from Latvia, the UK, the Netherlands, Belgium, Israel and Germany. Its main goal
is to find new algorithms for quantum computers and new quantum communication protocols that are
more efficient than the classical ones. Very recently we have learnt that the first and the third proposal
have been accepted, we don’t know yet the result of the second application. Finally we mention that
David Xiao is participating in a proposal for the ANR JCJC led by Damien Vergniaud at ENS, which
will study the role of randomness in cryptography.
Funding We invest considerable energy to secure adequate funding for achieving our scientific goals.
These include maintaining scientific contacts, hiring high quality postdocs and attending international
conferences The total amount we dispose of in our current projects is 1260K euros, and the requested
financing in the projects we are applying for is 950K euros.
54
ke
• ne epi
co w ng
m ch u
pe al p
tit len wit
or g h
s es
in
•
55
T
Th
IC
y
re
at
t
ni
s:
tu
ea
or
ar ,
g
in l
pp
ch es
ut na
O
ar m
se ga and mp tio
o a
re m
w tu ion n c ern
ne an ct ve int
• qu tera dri us ons
g
in put ro ati rin
in ume bor hi
n lla oc
co ostd
p
•
•
EXTERNAL
Figure 4.1: SWOT analysis of the scientific project
NEGATIVE
•
d
in oub
• qu cla le c
le an ss om
• in ade tum ical pe
re qu rs
a t
ce an hip com nd enc
e
nt tu p p
ar m os uti
riv co iti ng
al m on
St
of pu
re
D. tin
ng
Xi g
th
ao
s
es
kn
ea
W
ot
in g n
us tin um
at u nt
st mp ua
ch co in q e
ar al
iz
se ic as s
re ss h am
• cla hig l te
as al
sm
•
S W
O T
POSITIVE
INTERNAL
56
Chapter 5
ACL : Articles in international or national journals
Publications [EFKR10; EFKR11] are joint with team ”Distributed algorithms and graphs”.
[AGIK09]
D. Aharonov, D. Gottesman, S. Irani, J. Kempe. “The Power of Quantum Systems on a
Line”. Communications in Mathematical Physics 287.1 (2009), pp. 41–65.
[AKLLRD07] D. Aharonov, J. Kempe, Z. Landau, S. Lloyd, O. Regev, W. van Dam. “Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation”. SIAM Journal on
Computing 37.1 (2007), pp. 166–194.
[BBLR10b]
L. Becchetti, I. Bordino, S. Leonardi, A. Rosén. “Fully decentralized computation of aggregates over data streams”. SIGKDD Explorations 12.2 (2010), pp. 83–91.
[BJK08]
Z. Bar-Yossef, T. Jayram, I. Kerenidis. “Exponential separation of quantum and classical
one-way communication complexity”. SIAM Journal on Computing 38.1 (2008), pp. 366–
384.
[CKLR11]
P. Carmi, M. Katz, Z. Lotker, A. Rosén. “Connectivity guarantees for wireless networks
with directional antennas”. Computational Geometry 44.9 (2011), pp. 477–485.
[DKLR11]
J. Degorre, M. Kaplan, S. Laplante, J. Roland. “The communication complexity of nonsignaling distributions”. Quantum Information and Computation 11.8 (2011), pp. 649–
676.
[DKTV12]
S. Datta, R. Kulkarni, R. Tewari, N. Vinodchandran. “Space complexity of Bipartite
Matching on bounded genus graphs”. Journal of Computer and System Science 78.3
(2012), pp. 765–779.
[DLR07]
J. Degorre, S. Laplante, J. Roland. “Simulation of bipartite qudit correlations”. Physical
Review A 75.1 (2007), p. 012309.
[DMMS07]
W. van Dam, F. Magniez, M. Mosca, M. Santha. “Self-testing of universal and faulttolerant sets of quantum gates”. SIAM Journal on Computing 37.2 (2007), pp. 611–629.
[EFKR10]
Y. Emek, P. Fraigniaud, A. Korman, A. Rosén. “On the additive constant of the k-server
Work Function Algorithm”. Information Processing Letters 110.24 (2010), pp. 1120–1123.
[EFKR11]
Y. Emek, P. Fraigniaud, A. Korman, A. Rosén. “Online Computation with Advice”. Theoretical Computer Science 412.24 (2011). Special issue of ICALP’09, pp. 2642–2656.
[FISV09]
K. Friedl, G. Ivanyos, M. Santha, Y. Verhoeven. “On the Black-Box Complexity of
Sperner’s Lemma”. Theory of Computing Systems 45.3 (2009), pp. 629–646.
[FMR10]
E. Fischer, F. Magniez, M. de Rougemont. “Approximate Satisfiability and Equivalence”.
SIAM Journal on Computing 39.6 (2010), pp. 2251–2281.
57
CHAPTER 5. LIST OF PUBLICATIONS: ALGORITHMS AND COMPLEXITY
[FMSS09]
K. Friedl, F. Magniez, M. Santha, P. Sen. “Quantum testers for hidden group properties”.
Fundamenta Matematicae 91.2 (2009). Special issue on Machines on Computations and
Universality, pp. 325–340.
[GKKRW08]
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, R. de Wolf. “Exponential Separation for
One-Way Quantum Communication Complexity, with Applications to Cryptography”.
[GKRW09]
D. Gavinsky, J. Kempe, O. Regev, R. de Wolf. “Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity”. SIAM Journal on
Computing 39.1 (2009), pp. 1–24.
[GR10]
E. Gordon, A. Rosén. “Competitive Weighted Throughput Analysis of Greedy Protocols
on DAGs”. ACM Transactions on Algorithms 6.3 (2010).
[HKP11]
P. Hatami, R. Kulkarni, D. Pankratov. “Varations on the sensitivity conjecture”. Theory of
Computing, Graduate Surveys 4 (2011).
[ISS12]
G. Ivanyos, L. Sanselme, M. Santha. “An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups”. Algorithmica 62.1-2 (2012), pp. 480–498.
[JKS10]
R. Jain, H. Klauck, M. Santha. “Optimal direct sum results for deterministic and randomized decision tree complexity”. Information Processing Letters 110.20 (2010), pp. 893–
897.
[Ker09]
I. Kerenidis. “Quantum multiparty communication complexity and circuit lower bounds”.
Mathematical Structures in Computer Science 19.1 (2009). Special issue for TAMC’07,
pp. 119–132.
[KK07]
E. Kashefi, I. Kerenidis. “Statistical Zero Knowledge and quantum one-way functions”.
Theoretical Computer Science 378.1 (2007), pp. 101–116.
[KKLR11]
M. Kaplan, I. Kerenidis, S. Laplante, J. Roland. “Non-Local Box Complexity and Secure
Function Evaluation”. Quantum Information and Computation 11.1 (2011), pp. 40–69.
[KKMTV11] J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, T. Vidick. “Entangled games are hard
to approximate”. SIAM Journal on Computing 40.3 (2011), pp. 848–877.
[KKMV09]
J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick. “Using Entanglement in Quantum
Multi-Prover Interactive Proofs”. Computational Complexity 18.2 (2009), pp. 273–307.
[KL11]
M. Kaplan, S. Laplante. “Kolmogorov complexity and combinatorial methods in communication complexity”. Theoretical Computer Science 412.23 (2011). Special issue of
TAMC’09, pp. 2524–2535.
[Kon11]
C. Konrad. “Two-constraint domain decomposition with Space Filling Curves”. Parallel
Computing 37 (4-5 2011), pp. 203–216.
[KPS07]
J. Kempe, L. Pyber, A. Shalev. “Permutation groups, minimal degrees and quantum computing”. Groups, Geometry, and Dynamics 1.4 (2007), pp. 553–584.
[KR08]
A. Kesselman, A. Rosén. “Controlling CIOQ Switches with Priority Queuing and in Multistage Interconnection Networks”. Journal of Interconnection Networks 9.1/2 (2008),
pp. 53–72.
[KRT10]
J. Kempe, O. Regev, B. Toner. “Unique Games with Entangled Provers are Easy”. SIAM
Journal on Computing 39.7 (2010), pp. 3207–3229.
[Kul11]
R. Kulkarni. “On the power of isolation in planar graphs”. ACM Transactions on Computation Theory 3.1 (2011).
58
[KW12]
I. Kerenidis, S. Wehner. “Long distance two-party quantum crypto made simple”. Quantum Information and Computation 12 (5 2012), pp. 448–460.
[LLMRP07] S. Laplante, R. Lassaigne, F. Magniez, M. de Rougemont, S. Peyronnet. “Probabilistic
abstraction for model checking: An approach based on property testing”. ACM Transaction
on Computational Logic 8.4 (2007), p. 20.
[LM08]
S. Laplante, F. Magniez. “Lower bounds for randomized and quantum query complexity
using Kolmogorov arguments”. SIAM Journal on Computing 38.1 (2008), pp. 46–62.
[LPSR09]
Z. Lotker, B. Patt-Shamir, A. Rosén. “Distributed Approximate Matching”. SIAM Journal
on Computing 39.2 (2009), pp. 445–460.
[MMLC10] L. Magnin, F. Magniez, A. Leverrier, N. Cerf. “Strong No-Go Theorem for Gaussian
Quantum Bit Commitment”. Physical Review A 81.1 (2010), 010302(R).
[MN07]
F. Magniez, A. Nayak. “Quantum Complexity of Testing Group Commutativity”. Algorithmica 48.3 (2007), pp. 221–232.
[MNRS11] F. Magniez, A. Nayak, J. Roland, M. Santha. “Search via quantum walk”. SIAM Journal
on Computing 40.1 (2011), pp. 142–164.
[MNRS12] F. Magniez, A. Nayak, P. Richter, M. Santha. “On the hitting times of quantum versus
random walks”. Algorithmica 63.1 (2012), pp. 91–116.
[MR07]
F. Magniez, M. de Rougemont. “Property testing of regular tree languages”. Algorithmica
49.2 (2007), pp. 127–146.
[MSS07]
F. Magniez, M. Santha, M. Szegedy. “Quantum Algorithms for the Triangle Problem”.
[NRS10]
J. Naor, A. Rosén, G. Scalosub. “Online Time-Constrained Scheduling in Linear and Ring
Networks”. Journal of Discrete Algorithms 8.4 (2010), pp. 346–355.
[PCDK11]
A. Pappa, A. Chailloux, E. Diamanti, I. Kerenidis. “Practical quantum coin flipping”.
Physical Review A 84 (5 2011), p. 052305.
[PCWDK12a] A. Pappa, A. Chailloux, S. Wehner, E. Diamanti, I. Kerenidis. “Multiparty entanglement verification resistant against dishonest parties”. Physical Review Letters (2012).
[Ric07a]
P. Richter. “Almost uniform sampling via quantum walks”. New Journal of Physics 9
(2007), p. 72.
[Ric07b]
P. Richter. “Quantum speedup of classical mixing processes”. Physical Review A 76
(2007), p. 042306.
[RR11a]
H. Räcke, A. Rosén. “Approximation Algorithms for Time-Constrained Scheduling on
Line Networks”. Theory of Computing Systems 49.4 (2011). Special issue of SPAA’09,
pp. 834–856.
[RS11]
A. Rosén, G. Scalosub. “Rate vs. Buffer Size - Greedy Information Gathering on the Line”.
ACM Transactions on Algorithms 7.3 (2011).
[RV08]
M. de Rougemont, A. Vieilleribière. “Approximate Schemas, Source-Consistency and
Query Answering”. International Journal on Intelligent Database Systems 31.2 (2008),
pp. 127–146.
[SCAKPM11] J. Silman, A. Chailloux, N. Aharon, I. Kerenidis, S. Pironio, S. Massar. “Fully Distrustful Quantum Bit Commitment and Coin Flipping”. Physical Review Letters 106.220501
(2011).
59
[SMGPC07]
J. Sudjana, L. Magnin, R. Garcı́a-Patrón, N. Cerf. “Tight bounds on the eavesdropping of
a continuous-variable quantum cryptographic protocol with no basis switching”. Physical
Review A 76 (2007), p. 052301.
[SS09]
M. Santha, M. Szegedy. “Quantum and classical query complexities of local search are
polynomially related”. Algorithmica 55.3 (2009), pp. 557–575.
C-INV : Invited talks
[Ker07a]
I. Kerenidis. “Introduction to Quantum Information Theory”. In: 2nd International Conference on Information Theoretic Security. Vol. 4883. 2007, pp. 146–147.
[Lap07]
S. Laplante. “Quantum vs Classical Theories: Simulating Quantum Correlations with Classical Resources”. In: 3rd Computability in Europe. 2007.
[Mag10]
F. Magniez. “Application of Phase Estimation in Quantum Walks”. In: 5th Conference on
the Theory of Quantum Computation, Communication and Cryptography. 2010.
[San08]
M. Santha. “Quantum Walk Based Search Algorithms”. In: Proceedings of 5th International Conference on Theory and Applications of Models of Computation. 2008, pp. 31–
46.
[San09]
M. Santha. “Quantum Walk Based Search Algorithms”. In: 4th Conference on the Theory
of Quantum Computation, Communication and Cryptography. 2009.
[San10]
M. Santha. “Quantization of random walks: Search algorithms and hitting time”. In: Proceedings of 5th International Computer Science Symposium in Russia (CSR). 2010, p. 343.
[Xia11c]
D. Xiao. “Pseudo-aléa: objets et génération”. In: Journées annuelles de la SMF. 2011.
C-ACTI : International conference proceedings
Publications [EFKR09a; EFKR09b] are joint with team ”Distributed algorithms and graphs”.
[AGIK07]
D. Aharonov, D. Gottesman, S. Irani, J. Kempe. “The Power of Quantum Systems on a
Line”. In: Proceedings of 48th IEEE Symposium on Foundations of Computer Science
(FOCS). 2007, pp. 373–383.
[AKS10]
A. Ambainis, J. Kempe, O. Sattath. “A quantum Lovász Local Lemma”. In: Proceedings
of 42nd ACM Symposium on Theory of Computing (STOC). 2010, pp. 151–160.
[ALPS07]
L. Antunes, S. Laplante, A. Pinto, L. Salvador. “Cryptographic security of individual instances”. In: Proceedings of 1st International Conference on Information Theoretic Security. 2007, pp. 195–210.
[AMRR11]
A. Ambainis, L. Magnin, M. Roetteler, J. Roland. “Symmetry-assisted adversaries for
quantum state generation”. In: Proceedings of 26th IEEE Conference on Computational
Complexity (CCC). 2011, pp. 167–177.
[BBLR10a]
L. Becchetti, I. Bordino, S. Leonardi, A. Rosén. “Fully Decentralized Computation of
Aggregates over Data Streams”. In: Proceedings of 1st International Workshop on Novel
Data Stream Pattern Mining Techniques. 2010, pp. 1–9.
[BHKKLS11a] G. Brassard, P. Høyer, K. Kalach, M. Kaplan, S. Laplante, L. Salvail. “Merkle puzzles
in a quantum world”. In: Proceedings of 31st International Conference on Cryptology
(CRYPTO). 2011, pp. 385–404.
[CCKV08] A. Chailloux, D. Florin Ciocan, I. Kerenidis, S. Vadhan. “Interactive and Noninteractive
Zero Knowledge are Equivalent in the Help Model”. In: Proceedings of 5th Theory of
Cryptography Conference (TCC). 2008, pp. 501–534.
60
[Cha10]
A. Chailloux. “Improved loss tolerant quantum coin flipping”. In: Proceedings of 10th
Asian Conference on Quantum Information Science. 2010.
[CJR08]
H. Cheng, L. Jun, M. de Rougemont. “Approximate validity of XML Streaming Data”. In:
Proceedings of 9th International Conference on Web-age Information Management. 2008,
pp. 149–156.
[CK08]
A. Chailloux, I. Kerenidis. “Increasing the Power of the Verifier in Quantum Zero Knowledge”. In: Proceedings of 28th Conference on Foundations of Software Technology and
Theoretical Computer Science (FSTTCS). 2008, pp. 95–106.
[CK09]
A. Chailloux, I. Kerenidis. “Optimal Quantum Strong Coin Flipping”. In: Proceedings of
50th IEEE Symposium on Foundations of Computer Science (FOCS). 2009.
[CK11a]
A. Chailloux, I. Kerenidis. “Optimal bounds for quantum bit commitment”. In: Proceedings of 52nd IEEE Symposium on Foundations of Computer Science (FOCS). 2011,
pp. 354–362.
[CKR11]
A. Chailloux, I. Kerenidis, B. Rosgen. “Quantum Commitments from Complexity Assumptions”. In: Proceedings of 38th International Colloquium on Automata, Languages
and Programming (ICALP). 2011, pp. 73–85.
[CKS10]
A. Chailloux, I. Kerenidis, J. Sikora. “Lower bounds for Quantum Oblivious Transfer”. In:
Proceedings of 30th Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS). 2010, pp. 157–168.
[DGKT12]
S. Datta, A. Gopalan, R. Kulkarni, R. Tewari. “Improved bounds for Bipartite Matching
on surfaces”. In: Prooceedings of 29th Symposium on Theoretical Aspects of Computer
Science (STACS). 2012.
[DKLR09]
J. Degorre, M. Kaplan, S. Laplante, J. Roland. “The communication complexity of nonsignaling distributions”. In: Proceedings of 34th International Symposium on Mathematical Foundations of Computer Science (MFCS). 2009, pp. 270–281.
[EFKR09a]
Y. Emek, P. Fraigniaud, A. Korman, A. Rosén. “On the Additive Constant of the k-server
Work Function Algorithm”. In: Proceedings of 7th Workshop on Approximation and Online Algorithms. 2009, pp. 128–134.
[EFKR09b]
Y. Emek, P. Fraigniaud, A. Korman, A. Rosén. “Online Computation with Advice”. In:
Proceedings of 36th International Colloquium on Automata, Languages and Programming
(ICALP). 2009, pp. 427–438.
[EHR12]
Y. Emek, M. Halldórsson, A. Rosén. “Space-Constrained Interval Selection”. In: Proceedings of the 39th International Colloquium on Automata, Languages and Programming
(ICALP). To appear. 2012.
[GK11]
S. Gharibian, J. Kempe. “Approximation Algorithms for QMA-Complete Problems”.
In: Proceedings of 26th IEEE Conference on Computational Complexity (CCC). 2011,
pp. 178–188.
[GKKRW07a] D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, R. de Wolf. “Exponential separations
for one-way quantum communication complexity, with applications to cryptography”. In:
Proceedings of 39th ACM Symposium on Theory of Computing (STOC). 2007, pp. 516–
525.
[GWXY10]
S. Gordon, H. Wee, D. Xiao, A. Yerukhimovich. “On the round complexity of zeroknowledge proofs from one-way permutations”. In: Proceedings of 1st International Conference on Cryptology and Information Security in Latin America. 2010.
61
[HMX10]
I. Haitner, M. Mahmoody, D. Xiao. “A new sampling protocol and applications to basing
cryptographic primitives on NP”. In: Proceeedings of 25th IEEE Conference on Computational Complexity (CCC). 2010, pp. 76–87.
[HR07]
C. Hess, M. de Rougemont. “A Model of Uncertainty for Near-Duplicates in Document
Reference Networks”. In: Proceedings of 11th European Conference on Digital Libraries.
2007, pp. 449–453.
[HRS08]
S. Hémon, M. de Rougemont, M. Santha. “Approximate Nash Equilibria for Multi-player
Games”. In: Proceedings of 1st International Symposium on Algorithmic Game Theory.
2008, pp. 267–278.
[HS07a]
C. Hess, K. Stein. “Efficient Calculation of Personalized Document Rankings”. In: Proceedings of 20th International Joint Conference on Artificial Intelligence (IJCAI). 2007,
pp. 2778–2783.
[HS07b]
C. Hess, K. Stein. “Personalized Document Rankings by Incorporating Trust Information
From Social Network Data into Link-Based Measures”. In: Proceedings of IJCAI 2007
Workshop on Text-Mining & Link-Analysis. 2007.
[ISS07]
G. Ivanyos, L. Sanselme, M. Santha. “An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups”. In: Proceedings of 24th Symposium on Theoretical
Aspects of Computer Science (STACS). 2007, pp. 586–597.
[ISS08a]
G. Ivanyos, L. Sanselme, M. Santha. “An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups”. In: Proceedings of 8th Latin American Symposium on
Theoretical Informatics (LATIN). 2008, pp. 759–771.
[JKKSSZ10a] R. Jain, I. Kerenidis, G. Kuperberg, M. Santha, O. Sattath, S. Zhang. “On the Power of
a Unique Quantum Witness”. In: Proceedings 1st Symposium on Innovation in Computer
Science (ICS). 2010, pp. 470–481.
[JKM12]
S. Jeffery, R. Kothari, F. Magniez. “Improving Quantum Query Complexity of Boolean
Matrix Multiplication Using Graph Collision”. In: Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP). To appear. 2012.
[Ker07b]
I. Kerenidis. “Quantum multiparty communication complexity and circuit lower bounds”.
In: Proceedings of 4th Conference on Theory and Applications of Models of Computation
(TAMC). 2007, pp. 306–317.
[KK10]
R. Kasher, J. Kempe. “Two-source Extractors Secure Against Quantum Adversaries”. In:
Proceedings of 14th International Workshop on Randomization and Computation. 2010,
pp. 656–669.
[KKLR09]
M. Kaplan, I. Kerenidis, S. Laplante, J. Roland. “Non-Local Box Complexity and Secure
Function Evaluation”. In: Proceedings of 29th Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS). 2009.
[KKMTV08] J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, T. Vidick. “Entangled games are hard
to approximate”. In: Proceedings of 49th IEEE Symposium on Foundations of Computer
Science (FOCS). 2008, pp. 447–456.
[KKMV08]
J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick. “Using Entanglement in Quantum
Multi-Prover Interactive Proofs”. In: Proceedings of 23rd IEEE Conference on Computational Complexity (CCC). 2008, pp. 211–222.
[KL09]
M. Kaplan, S. Laplante. “Kolmogorov complexity and combinatorial methods in communication complexity”. In: Proceedings of 6th Conference on Theory and Applications of
Models of Computation (TAMC). 2009, pp. 261–270.
62
[KLLRX12] I. Kerenidis, S. Laplante, V. Lerays, J. Roland, D. Xiao. “Lower bounds on information
complexity via zero-communication protocols and applications”. In: Proceedings of 53rd
Annual Symposium on Foundations of Computer Science (FOCS). 2012.
[KM12]
C. Konrad, F. Magniez. “Validating XML Documents in the Streaming Model with External Memory”. In: Proceedings of 15th International Conference on Database Theory
(ICDT). 2012.
[KMM12]
C. Konrad, F. Magniez, C. Mathieu. “Maximum Matching in Semi-Streaming with Few
Passes”. In: Proceedings of 15th International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX). To appear. 2012.
[KMOR10]
H. Krovi, F. Magniez, M. Ozols, J. Roland. “Finding is as easy as detecting for quantum
walks”. In: Proceedings of 37st International Colloquium on Automata, Languages and
Programming (ICALP). 2010, pp. 540–551.
[KR10]
J. Kempe, O. Regev. “No Strong Parallel Repetition with Entangled and Non-signaling
Provers”. In: Proceeedings of 25th IEEE Conference on Computational Complexity (CCC).
2010, pp. 7–15.
[KRT08]
J. Kempe, O. Regev, B. Toner. “Unique Games with Entangled Provers are Easy”. In:
Proceedings of 49th IEEE Symposium on Foundations of Computer Science (FOCS). 2008,
pp. 457–466.
[KV11]
J. Kempe, T. Vidick. “Parallel repetition of entangled games”. In: Proceedings of 43rd
ACM Symposium on Theory of Computing (STOC). 2011, pp. 353–362.
[KZ12]
I. Kerenidis, S. Zhang. “A quantum protocol for sampling correlated equilibria unconditionally and without a mediator”. In: Proceedings of 7th Theory of Quantum Computation,
Communication and Cryptography (TQC). 2012.
[LLR12]
S. Laplante, V. Lerays, J. Roland. “Classical and quantum partition bound and detector inefficiency”. In: Proceedings of the 39th International Colloquium on Automata, Languages
and Programming (ICALP). 2012.
[LPSR07]
Z. Lotker, B. Patt-Shamir, A. Rosén. “Distributed approximate matching”. In: Proceedings
of 26th ACM Symposium on Principles of Distributed Computing (PODC). 2007, pp. 167–
174.
[MMN10]
F. Magniez, C. Mathieu, A. Nayak. “Recognizing well-parenthesized expressions in the
streaming model”. In: Proceedings of 42nd ACM Symposium on Theory of Computing
(STOC). 2010, pp. 261–270.
[MNRS07] F. Magniez, A. Nayak, J. Roland, M. Santha. “Search via quantum walk”. In: Proceedings
of 39th ACM Symposium on Theory of Computing (STOC). 2007, pp. 575–584.
[MNRS09] F. Magniez, A. Nayak, P. Richter, M. Santha. “On the hitting times of quantum versus
random walks”. In: Proceedings of 20th ACM-SIAM Symposium on Discrete Algorithms
(SODA). 2009, pp. 86–95.
[MNSX11] F. Magniez, A. Nayak, M. Santha, D. Xiao. “Improved bounds for the randomized decision tree complexity of recursive majority”. In: Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP). 2011, pp. 317–329.
[MRSZ11]
F. Magniez, M. de Rougemont, M. Santha, X. Zeitoun. “The complexity of approximate
Nash equilibrium in congestion games with negative delays”. In: Proceedings of 7th Workshop on Internet and Network Economics (WINE). 2011, pp. 266–277.
63
[MX10]
M. Mahmoody, D. Xiao. “On the power of randomized reductions and the checkability of
SAT”. In: Proceeedings of 25th IEEE Conference on Computational Complexity (CCC).
2010, pp. 64–75.
[PCWDK12b] A. Pappa, A. Chailloux, S. Wehner, E. Diamanti, I. Kerenidis. “Multiparty entanglement verification resistant against dishonest parties”. In: Proceedings of 7th Theory of
Quantum Computation, Communication and Cryptography (TQC). 2012.
[Ric08b]
P. Richter. “The quantum complexity of Markov chain Monte Carlo”. In: Proceedings of
3rd Conference on Computability in Europe (CiE). 2008, pp. 511–522.
[Rou09]
M. de Rougemont. “The value of sponsored ads for XML documents”. In: Proceedings of
9th International Conference on Electronic Business. 2009.
[RR09]
H. Räcke, A. Rosén. “Approximation algorithms for time-constrained scheduling on line
networks”. In: Proceedings of 21st ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). 2009, pp. 337–346.
[RR11b]
M. Renault, A. Rosén. “On online algorithms with advice for the k-server problem”. In:
Proceedings of 9th Workshop on Approximation and Online Algorithms. (Invited to the
Special issue of WAOA2011). 2011.
[RS07]
A. Rosén, G. Scalosub. “Rate vs. buffer size: greedy information gathering on the line”.
In: Proceedings of 19th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA). 2007, pp. 305–314.
[RT09]
M. de Rougemont, M. Tracol. “Statistical Analysis for Probabilistic Processes”. In: Proceedings of 24th IEEE Symposium on Logic in Computer Science (LICS). 2009, pp. 299–
308.
[RV07]
M. de Rougemont, A. Vieilleribière. “Approximate Data Exchange”. In: Proceedings of
11th International Conference on Database Theory (ICDT). 2007, pp. 44–58.
[RV10]
M. de Rougemont, A. Vieilleribière. “Approximate Structural Consistency”. In: Proceedings of 36th International Conference on Current Trends in Theory and Practice of Computer Science. 2010, pp. 685–696.
[Xia10]
D. Xiao. “Learning to create is as hard as learning to appreciate”. In: Proceedings of 23rd
International Conference on Learning Theory (COLT). 2010, pp. 516–518.
[Xia11b]
D. Xiao. “(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure
against Selective Opening Attacks”. In: Proceedings of 8th Theory of Cryptography Conference (TCC). 2011, pp. 541–558.
[Xia12]
D. Xiao. “Round-optimal black-box statistically binding selective-opening secure commitments”. In: Proceedings of 5th International Conference on Cryptology in Africa
(AFRICACRYPT). To appear. 2012.
C-COM : International or national conferences without proceedings
[BHKKLS11b] G. Brassard, P. Høyer, K. Kalach, M. Kaplan, S. Laplante, L. Salvail. “Merkle Puzzles
in a Quantum World”. In: First Annual Conference on Quantum Cryptography. 2011.
[BHKKLS12] G. Brassard, P. Høyer, K. Kalach, M. Kaplan, S. Laplante, L. Salvail. “Merkle Puzzles
in a Quantum World”. In: 15th Workshop on Quantum Information Processing. Featured
talk. 2012.
[CK10]
A. Chailloux, I. Kerenidis. “Optimal Quantum Strong Coin Flipping”. In: 13th Workshop
on Quantum Information Processing. Plenary talk. 2010.
64
[CK11b]
A. Chailloux, I. Kerenidis. “Optimal bounds for quantum bit commitment”. In: 14th Workshop on Quantum Information Processing. Featured talk. 2011.
[DISW11b]
T. Decker, G. Ivanyos, M. Santha, P. Wocjan. “Hidden Symmetry Subgroup Problems”.
In: 15th Workshop on Quantum Information Processing. Contributed talk. 2011.
[DKRL08]
J. Degorre, M. Kaplan, J. Roland, S. Laplante. “The complexity of simulating nonsignaling distributions”. In: 11th Workshop on Quantum Information Processing. Contributed talk. 2008.
[GK12]
S. Gharibian, J. Kempe. “Hardness of approximation for quantum problems”. In: 15th
Workshop on Quantum Information Processing. Contributed talk. 2012.
[GKKRW07b] D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, R. de Wolf. “Exponential separations for
one-way quantum communication complexity, with applications to cryptography”. In: 10th
Workshop on Quantum Information Processing. Featured talk. 2007.
[ISS08b]
G. Ivanyos, L. Sanselme, M. Santha. “An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups”. In: 12th Workshop on Quantum Information Processing.
Featured talk. 2008.
[JKKSSZ10b] R. Jain, I. Kerenidis, G. Kuperberg, M. Santha, O. Sattath, S. Zhang. “On the Power
of a Unique Quantum Witness”. In: 13th Workshop on Quantum Information Processing.
Contributed talk. 2010.
[KMOR11]
H. Krovi, F. Magniez, M. Ozols, J. Roland. “Finding is as easy as detecting for quantum
walks”. In: 14th Workshop on Quantum Information Processing. Featured talk. 2011.
Participation under invitation to scientific meetings
Singapore Workshop on Quantum Algorithms and Complexity Theory, Singapore, November 2008. I.
Kerenidis, S. Laplante, F. Magniez, M. Santha (organizer).
Dagstuhl 2nd DYNAMO Workshop: Dynamic Communication Networks, Dagstuhl seminar, June 2009.
A. Rosén.
Santa Barbara Quantum Information Science, Kavli Institue for Theoretical Physics, Santa Barbara,
Septembre 2009. F. Magniez.
Tokyo International Conference on Quantum Information and Technology, National Institute of Informatics, Tokyo, December 2009. A. Chailloux, I. Kerenidis, M. Santha.
Dagstuhl Scheduling, Dagstuhl seminar, February 2010. A. Rosén.
Dagstuhl Packing and Scheduling Algorithms for Information and Communication Services, Dagstuhl
seminar, February 2011. A. Rosén.
DIMACS DIMACS Workshop on Competitive Algorithms for Packet Scheduling, Buffering and Routing
in the Internet, DIMACS workshop, July 2011. A. Rosén (co-organizer).
Dagstuhl Quantum Cryptanalysis, Dagstuhl seminar, September 2011. F. Magniez, L. Magnin.
Montreal Workshop on Quantum Computer Science, Université de Montréal, 2011. S. Laplante.
Bristol 2nd Heilbronn Quantum Algorithms Day, University of Bristol, February 2012. M. Santha.
Waterloo Recent Progress in Quantum Algorithms, Institute for Quantum Computing, Waterloo,
Canada (Ontario), April 2012. F. Magniez.
Dortmund Streaming Algorithms and Related Topics, TU Dortmund University, Germany, July 2012.
C. Konrad, F. Magniez.
Aarhus Workshop on Synergies in Lower Bounds, Aarhus University, Denmark. June 28 – July 1, 2011.
D. Xiao.
65
Tsingua Trends in Theoretical Cryptography, IIIS Tsinghua University, China. January 7-9, 2011. D.
Xiao.
DO : Editing of journals and other works
[MN09]
F. Magniez, A. Nayak, eds. Special issue in Quantum Computation, Algorithmica 55(3).
Springer, 2009.
OS : Scientific works
[KV10]
J. Kempe, T. Vidick. “Quantum Information, Computation and Cryptography”. In: ed. by
F. Benatti, M. Fannes, R. Floreanini, and D. Petritis. Vol. 808. Springer Lecture Notes in
Physics. Springer, 2010. Chap. Quantum Algorithms, pp. 309–342.
PV : Popularization works
[Lap10]
S. Laplante. “Le plus grand des hasards : Surprises quantiques”. In: ed. by J.-F. Dars and
A. Papillaut. Belin, 2010. Chap. L’influence de l’informatique, pp. 152–154.
AP : Other works
[DISW11a]
T. Decker, G. Ivanyos, M. Santha, P. Wocjan. Hidden Symmetry Subgroup Problems. Tech.
rep. 1107.2189. arXiv, 2011.
[IKLSW12]
G. Ivanyos, H. Klaux, T. Lee, M. Santha, R. de Wolf. New bounds on the classical
and quantum communication complexity of some graph properties. Tech. rep. 1204.4596.
arXiv, 2012.
[Kul10]
R. Kulkarni. Perfect matching in bipartite planar graphs is in UL. Tech. rep. 201. ECCC,
2010.
[LMS11]
T. Lee, F. Magniez, M. Santha. A learning graph based quantum query algorithm for finding constant-size subgraphs. Tech. rep. 1109.5135. arXiv, 2011.
[MX12]
Mohammad Mahmoody, David Xiao. Languages with efficient Zero Knowledge PCPs are
in SZK. Tech. rep. TR12-052. ECCC, 2012.
[Ric07c]
P. Richter. Two remarks on the local Hamiltonian problem. Tech. rep. arXiv:0712.4274.
ArXiv, 2007.
[Ric08a]
P. Richter. “Quantum algorithms for triangle finding”. In: Encyclopedia of Algorithms.
Springer, 2008.
[RS08]
P. Richter, M. Szegedy. “Quantization of Markov chains”. In: Encyclopedia of Algorithms.
Springer, 2008.
[Xia11a]
D. Xiao. Is privacy compatible with truthfulness? Tech. rep. 2011/005. Cryptology ePrint
Archive, 2011.
66
Chapter 6
6.1
Composition and team organization
Leader : Miklos Santha
6.1.1
Current members
6.1.1.1
1.
2.
3.
4.
5.
6.
Permanent members (2012)
Iordanis Kerenidis, CR1 CNRS, HDR
Frédéric Magniez, DR2 CNRS
Adi Rosén, DR2 CNRS
Michel de Rougemont, Pr1 (Université Panthéon-Assas)
Miklos Santha, DR1 CNRS
David Xiao, CR2 CNRS
6.1.1.2
Ph.D students and post-doctoral researchers (2012)
PhD Students.
1. Nathanaël François
2. Christian Konrad
3. Virgine Lerays
4. Anna Pappa
5. Marc Renault
6. Xavier Zeitoun
Postdocs.
1. Raghav Kulkarni (2 years)
6.1.1.3
Others (2012)
1. Sophie Laplante, PR2 (LRI, Université Paris-Sud), associate member
2. Julia Kempe, DR2, currently on leave
We also list the students that are currently doing an internship in our group as Master students (2nd year)
in France.
1. Krzysztof Gogolewski, MPRI
2. Mathieu Laurière, MPRI
67
CHAPTER 6. APPENDIX: ALGORITHMS AND COMPLEXITY
6.1.2
6.1.2.1
Former members
Permanent members (2007-2011)
1. Nisheeth Vishnoi 2008-09, CR1 CNRS, now at Microsoft Research India, Bangalore
2. Julia Kempe, 2007, CR1 CNRS, and 2010-11, DR2 CNRS, on leave.
6.1.2.2
Ph.D students and post-doctoral researchers (2007-2011)
PhD Students.
1. Julien Degorre, 2003-2007, now postdoc at Centre for Quantum Technologies, National University of Singapore
2. Luc Sanselme, 2004-2008, now Professor of Mathematics in Nancy at “classes préparatoires”
3. Marc Kaplan, 2005-2009, now postdoc at Télécom ParisTech, Paris
4. Claudia Hess, 2003-2007, now Researcher at Systec-CAx, Germany
5. Adrien Vieilleribière, 2003-2008, now postdoc at Ligaran (startup on Ebooks), Paris
6. Mathieu Tracol, 2006-2009, now postdoc at Institute of Science and Technology, Vienne, Autriche
7. André Chailloux, 2007-11, now postdoc at University of California, Berkeley
8. Loı̈ck Magnin, 2007-11, now postdoc at Centre for Quantum Technologies, National University
of Singapore
Postdocs.
1. Troy Lee, 2006–07, now at CQT, Singapore
2. Peter Richter, 2007-08, now at Goldman Sachs
3. David Xiao, 2009-2011, now CR2 in the team
6.1.2.3
Long-term visitors (2007-2011)
1. Takeshi Koshiba, April 2010 - March 2011, Saitama University, Japan
2. Michael McGettrick, May 2009 - October 2009, National University of Ireland, Galway (UK)
6.1.2.4
Others (2007-2011)
First we list the students that made an internship in our group while they were Master students (2nd
year) in France.
1. André Chailloux, MPRI, 2007
2. Loı̈ck Magnin, ENS Lyon, 2007
3. Mauricio Soto, MPRI, 2007
4. Anna Pappa, MPRI, 2007
5. Thomas Largilliers, MPRI, 2007
6. Omar Fawzi, MPRI, 2008
7. Marc Renault, MPRI, 2010.
8. Nathanaël François, MPRI, 2011
9. Virginie Lerays, M2 Logique Paris 7, 2011
10. Karolina Soltys, MPRI, 2011
68
11. Suppartha Podder, MPRI, 2011
12. Vincent Vong, MPRI, 2011
In addition we hosted several students from University of Waterloo, Canada (Ontario), for 4-month
visits. Indeed, we were leader of a student exchange program between Europe and Canada (CSQIP)
between 2008 and 2011. This grant supported Master and PhD students exchanges. Below is the list of
students with their respective starting period of visit:
1. Jamie Sikora (January 2010)
2. Stacey Jeffery (January 2010 and September 2011)
3. Sevag Gharibian (July 2010)
4. Ansis Rosmanis (September 2010)
5. Sarvagya Upadhyay (January 2011)
We also hosted IIT (Kanpur) students from India for 3-month visits.
1. B. Bhuvneshwar (2010)
2. S. Kumar (2010)
6.1.3
Visitors
1. Ashish Goel, Stanford, USA
2. Gábor Ivanyos, SZTAKI, Budapest, Hungary
3. Zvi Lotker, Ben-Gurion University, Israel
4. Claire Mathieu, Brown University, Providence, USA (Rhode Island)
5. Dieter van Melkebeek, University of Wisconsin, Madison, USA
6. Ashwin Nayak, Institute for Quantum Computing, University of Waterloo, Canada (Ontario)
7. Boaz Patt-Shamir, Tel-Aviv University, Israel
8. Oded Regev, Tel Aviv University, Israel
9. Pranab Sen, Tata Institute for Fundamental Research, Mumbai, India
10. Umesh Vazirani, University of California, Berkeley, USA
11. Ronald de Wolf, CWI, Amsterdam, The Netherlands
6.1.4
6.1.4.1
Team organization
Funding and resource management
See Section 1.4
6.1.4.2
Team Seminar
Available at
LRI http://www.liafa.univ-paris-diderot.fr/algocomp/index.php?n=
Main.LRI-Seminar
LIAFA http://www.liafa.univ-paris-diderot.fr/web9/manifsem/
listmanifannee_fr.php?typecongres=10
69
6.1.4.3
Participation in the scientific community and administrative responabilities
Participation in international scientific activities.
LIA Japanese - French Laboratory for Informatics (JFLI) 2009-2011, M. Santha (scientific leader for
“Quantum Computing”)
UMI Participating team in Japanese - French Laboratory for Informatics (JFLI) since 2011, I. Kerenidis
(coordinator for LIAFA)
LIA Participating team in France-Singapore Quantum Physics and Information Lab (FSQL) since 2010,
M. Santha (coordinator for LIAFA)
LEA Co-director of the French-Israeli Laboratory on Foundations of Computer Science (FILOFOCS),
a CNRS LEA between LIAFA and Tel-Aviv University (2012-2015, extendable for another 4
years). Adi Rosén.
Participation in national and local scientific activities.
DIGITEO Labs Member of the Programme Committee, 2007 (M. Santha).
GDR Research group (GDR) Informatique Mathématique. First, we are involved in its steering commitee within the axis Logique et Compexité (F. Magniez, since 2009). Second, we lead two of its
research groups (GT): GT Complexité et Modèles Finis (M. de Rougemont until 2010) and GT
Informatique Quantique (2006-09: F. Magniez, 2009-: I. Kerenidis and S. Laplante).
GDR GDR Information et Communication Quantique (J. Kempe until 2007, then I. Kerenidis until
2009), and then GDR Information Quantique, Fondements & Applications (I. Kerenidis since
2010)
UFR Conseil Scientifique UFR Informatique Paris Diderot 7 (since 2011). I. Kerenidis
ED Member of the conseil de l’école doctorale, Université Paris-Sud 11. M. de Rougemont (until
2010), S. Laplante (2011-)
6.2
6.2.1
Grants and research projects
Management of international projects
MarieCurie (2006-2008) FP6 Marie Curie International Reintegration Grant MIRG-CT-2005-036557
Quantum Information and Applications to communication, cryptography and classical computer
science (QCCC), I. Kerenidis, 80 KEUR.
QACT (2007-08) Quantum algorithms and complexity theory, France-Canada Research Foundation,
coordinator F. Magniez. Canadian partner: University of Waterloo (Ontario). Amount: 14 KEUR.
HSP (2008-09) Hidden subgroup problem, CNRS - Hungarian Academy joint project with the Rényi
Institute, coordinator M. Santha. Amount: 7 KEUR.
QCTFS (2008-10) Quantum Computation: Theory and Feasibility, Strategic France (CNRS) - Japan
(JST) Cooperative Program. French Partners: Univ Paris-Sud (coordinator I. Kerenidis), Univ
Grenoble, Telecom ParisTech. Japanese Partners: NII Tokyo, Univ Tokyo, Kyoto Univ, Saitama
Univ. Amount: 90 KEUR.
CSQIP (2008-11) Collaborative student training in Quantum Information Processing, Transatlantic
Exchange Partnerships, EU-Canada programme. EU partners: Ecole Polytechnique, Université
Paris-Sud (coordinator F. Magniez), University of Erlangen (Germany), University of Innsbruck
(Austria). Canadian partners: University of Waterloo (Ontario), University of Calgary (Alberta).
Amount for Europe: 138 KEUR.
70
STIC-Asie (2010-2012) MAEE-CNRS STIC-Asie Programme Foundations of Quantum Information
and Computation, French Partner: LIAFA (coordinator I. Kerenidis). Asia partners: Centre for
Quantum Technologies (Singapore), Tata Institute for Fundamental Research (India), Chinese
University of Hong Kong (Hong Kong). Amount: 42 KEUR.
6.2.2
Management of national projects
ALGOQP (2005-08) Quantum and Probabilistic Algorithms, ANR Blanc, coordinator S. Laplante.
Amount: 280 KEUR.
VERAP (2008-11) Approximate Verification of Probabilistic Systems, ANR Sesur, 117 KEUR, coordinator M. de Rougemont. Partner: Equipe de Logique Mathématique (Université Paris Diderot).
Amount: 160 KEUR.
QRAC (2009-12) Quantum and Randomized Algorithms and Complexity, ANR program DEFIS, coordinator F. Magniez, 420 KEUR.
CRYQ (2010-13) Cryptographie quantique, ANR JCJC, coordinator I. Kerenidis, 195 KEUR.
NeTOC (2012-15) New Techniques in Online Computation, ANR Blanc, coordinator A. Rosen, Partner:
LIP6. Amount: 132 KEUR.
RDAM (2013-16) Algorithmic Techniques for Restricted Data Access Models, ANR Blanc (accepted
in july 2012), coordinator F. Magniez. Partners: “Distributed Algorithms and Graphs” team of
LIAFA and ENS LIENS. Amount: 355 KEUR (subject to further adjustments).
6.2.3
Participation in international projects
QAP (2005-10) Qubit Applications, EU 6th Framework Integrated Project IST-2003-015848 with 35
scientific and industrial partners: http://www.qubitapplications.com/Partners/
list.asp. Coordinator M. Santha, amount: 165 KEUR. Principal investigator: Ian Walmsley,
University of Oxford.
QCS (2011-13) Quantum Computer Science, FET ICT Open Call Strep FP7-ICT-2009-255961, coordinator M. Santha, 264 KEUR, http://www.lu.lv/qcs/. EU partners: University of Latvia,
CNRS LIAFA, University of Bristol, CWI (Netherlands), Tel Aviv University, Université Libre
de Bruxelles, Institute of Photonic Sciences (Spain), University of Cambridge (United Kingdom).
Principal Investigator: Andris Ambainis, University of Latvia.
DIQIP (2012-14) Device-Independent Quantum Information Processing, ANR CHIST-ERA, coordinator S. Laplante, 207 KEUR. EU partners: Institute of Photonic Sciences (Spain), GAP-Optique
and ETH (Switzerland), Université Paris-Sud, Université Libre de Bruxelles, University of Bristol,
University of London Royal Holloway. Principal Investigator: Antonio Acin, Institute of Photonic
Sciences, Barcelona, Spain.
6.2.4
Participation in local projects
PPF Programme Publi-Formations “Information Quantique” at Université Paris-Sud (2006-09). F.
Magniez (responsible for the team).
6.2.5
6.3
Participation in local projects
Research administration
6.3.1
6.3.1.1
Editorial duties
Editorial board member
IJQI International Journal of Quantum Information, M. Santha since 2008
71
ToCT ACM Transactions on Computation Theory, S. Laplante since 2007.
Algorithmica Special issue on Quantum Computation in Algorithmica, F. Magniez (guest editor), 2009
6.3.2
6.3.2.1
Management of scientific conferences
Steering committee member
FCT Fundamentals of Computation Theory M. Santha since 1999
QIP Quantum Information Processing M. Santha 2002-07.
STACS Symposium on Theoretical Aspects of Computer Science. M. Santha 2002-08, Adi Rosén 2009present.
6.3.2.2
Program committee member
AQIS 7th Asian Conference on Quantum Information Science, Kyoto, 2007, J. Kempe and M. Santha
STACS 24th Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, S.
Laplante
WAOA 5th Workshop on Approximation and Online Algorithms, Eilat, Israel, 2007, Adi Rosén
CiE 3rd Computability in Europe, Siena, 2007, J. Kempe. 2008, S. Laplante.
STACS 25th Symposium on Theoretical Aspects of Computer Science, Bordeaux, 2008, F. Magniez
CiE 4th Computability in Europe, Athens, 2008, S. Laplante
SCN 8th Conference on Security and Cryptography for Networks, Boston, USA, 2008, Adi Rosén
APPROX 15th International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems, Amalfi, Italy, 2008, Adi Rosén
PODC 27th AnnualSymposium on Principles of Distributed Computing, Toronto, Canada, 2008 Adi
Rosń
TAMC 6th Annual Conference on Theory and Applications of Models of Computation, Xian, 2009, M.
Santha
STACS 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, 2009, Adi Rosén
TQC 5th Conference on Theory of Quantum Computation, Communication and Cryptography, Leeds,
2010, M. Santha
AQIS 10th Asian Conference on Quantum Information Science, Tokyo, 2010, J. Kempe and M. Santha
QIP Quantum Infomration Processing, Zurich, 2010, J. Kempe and I. Kerenidis
IPDPS 24th International Parallel & Distributed Processing Symposium, Atlanta, USA, 2010, Adi
Rosén
SEA 9th International Symposium on Experimental Algorithms, Ischia Islans (Napoli), Italy, 2010, Adi
Rosén
QIP Quantum Infomration Processing, Singapore, 2011, I. Kerenidis
TQC 6th Conference on Theory of Quantum Computation, Communication and Cryptography, Madrid
2011, M. Santha
CSR 5th International Computer Science Symposium in Russia, St. Petersburg, 2011, M. Santha
STOC 43rd ACM Symposium on Theory of Computing, San Jose, USA (California), 2011, F. Magniez
SOFSEM 38th International Conference on Current Trends in Theory and Practice of Computer Science, Czech Republic, 2012, F. Magniez
72
STACS 29th Symposium on Theoretical Aspects of Computer Science, Paris, 2012, M. de Rougemont
CCC 27th Conference on Computational Complexity, Porto, Portugal, 2012, J. Kempe
STACS 30th Symposium on Theoretical Aspects of Computer Science, Kiel, 2013, I. Kerenidis
6.3.3
6.3.3.1
Organization of scientific events
Local arrangements committee chair
CCC 24th IEEE Conference on Computational Complexity, Paris, 2009. S. Laplante, chair.
6.3.3.2
Local arrangements committee member
We mostly organized French scientific events, mainly hosted by the GDR Informatique Mathématique,
or by the Telecom-ParisTech and LIAFA collaboration.
GDR-IM Journées annuelles du GDR Informatique Mathématique, Paris, 2012 (F. Magniez)
GDR-IM/GT-IQ Journées du GT Informatique Quantique, Paris, January 2008 (F. Magniez), September 2008 (F. Magniez), September 2010 (I. Kerenidis), May 2011 (I. Kerenidis), May 2012
Journées communes avec la Fédération de Recherche en Mathématiques de Paris centre (I. Kerenidis)
QUPA Quantum Information in Paris workshops, Paris, May 2009, October 2009, February 2010, May
2010, September 2010, February 2011, May 2011, September 2011, April 2012 (I. Kerenidis)
We did also participate to the organization of international events.
QACT Workshop on Quantum Algorithms and Complexity Theory, Singapore, November 2008, M.
Santha
CCC 24th IEEE Conference on Computational Complexity, Paris, 2009, full group
Qmath Quantum Information, Hradec Kralove, Czech Republic, 2010, J. Kempe
DIMACS DIMACS Workshop on Competitive Algorithms for Packet Scheduling, Buffering and Routing
in the Internet, DIMACS center, Rutgers University, July 2011. A. Rosén.
FILOFOCS French - Israeli Workshop on Foundations of Computer Science, Paris, May 2012. A.
Rosén.
6.3.4
6.3.4.1
Participation in scientific juries and committees
International
ICT-FET Expert 2007-2012, M. Santha
NSERC Natural Sciences and Engineering Research Council of Canada Evaluation Group, Computer
Science, 2010–2013, S. Laplante.
6.3.4.2
National
ANR Comité d’évaluation DEFIS 2008.
6.3.4.3
Commissions of specialists
Orsay Chaire INRIA/Université Paris-Sud, 2010, F. Magniez (head of the committee)
INRIA Concours CR2-CR1 INRIA Saclay, 2009, F. Magniez
Orsay Université Paris-Sud, 2007-09, F. Magniez, A. Rosén
Lille Université Lille, 2011, M. de Rougemont
Nancy Université Nancy, 2012, M. de Rougemont
73
6.4
Teaching, advising, and evaluation activities
6.4.1
6.4.1.1
Theses and HdR defended
Habilitations à diriger les recherches
3. Iordanis Kerenidis, Interaction in the quantum world, December 2010
6.4.1.2
Doctoral theses
1. Julien Degorre, Quantifier la non-localité, September 2007, Université Paris-Sud. Advisors: S.
Laplante et M. Santha. Now postdoc at Centre for Quantum Technologies, National University of
Singapore.
2. Luc Sanselme, Algorithmes quantiques dans les groupes nilpotents, December 2008, Université
Paris-Sud. Advisor: M. Santha. Now professor of Mathematics in “classes préparatoires”.
3. Marc Kaplan, Méthodes combinatoires et algebriques en complexité de la communication,
Septembre 2009, Université Paris-Sud. Advisor: S. Laplante. Now postdoc at Télécom ParisTech.
4. Claudia Hess, Trust-based Digital Libraries, 2007, Université Paris-Sud and Bayreuth, CoAdvisor: M. de Rougemont. Now Researcher at Systec-CAx in Münich.
5. Adrien Vieilleribière, Transformations de mots, d’arbres et de statistiques , 2008, Université ParisSud, Advisor: M. de Rougemont. Now postdoc at Ligaran, Paris.
6. Mathieu Tracol, Vérification approchée de systèmes probabilistes, 2009, Université Paris-Sud.
Advisor: M. de Rougemont. Now postdoc at Institute of Science and Technology, Vienna, Austria.
7. André Chailloux, Quantum coin flipping and bit commitment: optimal bounds, pratical constructions and computational security, June 24, 2011, Université Paris-Sud. Advisor: I. Kerenidis Now
postdoc at University of California, Berkeley.
8. Loı̈ck Magnin, Two-player interaction in quantum computing: cryptographic primitives and query
complexity, December 5, 2011, Université Paris-Sud. Advisors (co-tutelle): Nicolas Cerf (Université Libre de Bruxelles) and F. Magniez. Now postdoc at Centre for Quantum Technologies,
National University of Singapore.
6.4.2
Thesis reports
1. Aurelien Bocquet, ’Modèles de sécurité réalistes pour la distribution quantique de clés’, Telecom
ParisTech, 2011.
2. Yann Strozecki, Complexité d’énumération et décomposition de matroı̈des, Université Paris VII,
Décembre 2010
6.4.3
6.4.3.1
Teaching
University courses at M2R level
MPRI Advanced Algorithms, in the Paris Computer Science Master’s Programme (MPRI), every year,
F. Magniez, M. de Rougemont, A. Rosén, M. Santha
MPRI Quantum information and applications, in the Paris Computer Science Master’s Programme
(MPRI), every year, I. Kerenidis, S. Laplante, F. Magniez, M. Santha
74
MPRI Randomness in Complexity, in the Paris Computer Science Master’s Programme (MPRI), since
2011, I. Kerenidis, S. Laplante, M. Santha, D. Xiao
ENS-Lyon New computation paradigms: physics-like models of computation, efficient algorithmics,
int the ENS-Lyon Computer Science Master’s Programme (MIF), 2010, F. Magniez
LMFI Approximate Verification and Complexity, Master Paris-Diderot, Logique Mathématique et
Fondements de l’Informatique, since 2011, M. de Rougemont
6.4.3.2
Special thematic programs and specialist courses
EJCJC “Ecole des Jeunes Chercheurs en Informatique Mathématique”, Clermont-Ferrand, 2009. Organization and course in quantum computing. F. Magniez
SMS-NATO Advanced School in “Quantum Information Processing and Quantum Cryptography”,
Montreal, Canada, 2010. J. Kempe and M. Santha.
ALEA Journées ALEA, école thématique du CNRS. “Le pseudo-aléa: objets et génération.” CIRM,
Université Aix-Marseille I, 2012. D. Xiao.
EPIT “Ecole de Printemps d’Informatique Théorique”, 2012. Organization and courses in randomized algorithms, approximation algorithms, streaming algorithms, communication complexity,
and quantum computing. I. Kerenidis and F. Magniez (chair).
6.4.3.3
Popularization
Collège Belgique Lecture in quantum computing, 2009. F. Magniez
ENS Lyon Invited lecture, Alan Turing’s Heritage, 2012. S. Laplante
Fondation Sciences Mathématiques de Paris. Invited talk: Les preuves, revisitées. Mathematics in
motion, 2012. D. Xiao.
Projects & expositions J. Kempe, I. Kerenidis and S. Laplante were consulted to several projects and
expositions developed by Sylvie Tissot, from Anabole (Paris, small multimedia company):
Quantum design: Project for visual representation of quantum states and quantum circuits
http://www.anabole.com/quantum-design/
Harmonices quanti:
Project for auditive representation of quantum states,
http://harmonices-quanti.com
Fête de la Science: Presentation of a software for quantum computing at LRI, 2009 and 2010
Gaı̂té Lyrique: Exhibition 2062 of the quantum-design software, 2012.
6.4.3.4
Technology transfer
Ligaran Cooperation and expertise with Ligaran (Paris, startup on Ebooks) on tree transducers (XSLT),
approximate validity and correctors. M. de Rougemont.
IDQuantique Collaboration with the company IDQuantique (Geneva, company on quantum technologies for communication and security) on extending the functionalities of their commercial Clavis2
Quantum Key Distribution product to include the Coin Flipping and Bit Commitment primitives.
Experiment is under way at the quantum optics laboratory at Telecom ParisTech. I. Kerenidis.
75
76
Partie III
77
Chapitre 1
L’équipe ”Algorithmes et combinatoire” qui existait au 1er janvier 2007, s’est scindée en 2010 en
deux équipes. Ce rapport ne concerne pour 2007-2010 que les membres de l’équipe ”Algorithmes et
combinatoire” qui sont maintenant membres de l’équipe ”Algorithmique distribuée et graphes” et pour
2011-2012 les membres de l’équipe ”Algorithmique distribuée et graphes”.
1.1
1.1.1
Thématique générale et principaux objectifs
Introduction
Les recherches de l’équipe couvrent le spectre complet de l’algorithmique des graphes (incluant tous
les aspects liés à la théorie des graphes) à l’algorithmique distribuée en passant par les applications
aux réseaux. Ainsi l’équipe possède une forte expertise en algorithmique pour les décompositions de
graphes, et en conception et analyse d’algorithmes conçus pour des familles spécifiques de graphes.
Elle couvre par ailleurs la plupart des thématiques de l’algorithmique distribuée, du développement de
protocoles distribués pour les réseaux (routage, étiquetage, coloration, spanners, etc.) à la tolérance aux
pannes (consensus, élection de leader, détecteurs de défaillances, etc.).
Une partie des membres de l’équipe sont membres de l’équipe projet Inria ”Gang” ( Networks, graphs
and algorithms) dont l’objectif est le développement de méthodes algorithmiques pour la conception et
le contrôle des réseaux à grande échelle.
Au cours de ces 5 années, l’équipe ”Algorithmique distribuée et graphes” a beaucoup évolué et s’est
considérablement renforcée.
L’arrivée de Pierre Fraigniaud en janvier 2007 par une mutation depuis le LRI, de Carole Delporte et de
Hugues Fauconnier en octobre 2007 par un changement d’équipe au sein du LIAFA, et enfin le recrutement de Amos Korman (CR CNRS), ont permis de constituer une forte composante ”algorithmique
distribuée”, cette composante s’est encore renforcée par l’arrivée en 2008 de Nicolas Schabanel (mutation CNRS Chili) et en 2010 de Fabien Mathieu (CDD Inria). Ainsi les deux sous communautés du
calcul distribué : calcul tolérant aux pannes et calcul réseau sont particulièrement bien représentées.
La thématique algorithmique des graphes s’est renforcée par l’arrivée en 2007 de Mathieu Raffinot
(mutation CNRS Russie) et les aspects plus liés à la théorie des graphes se sont renforcés en 2008
par les recrutements de Nicolas Trotignon (CR CNRS) et Jean-Sébastien Sereni (CR CNRS). L’équipe
a connu deux départs celui d’Emmanuel Lebhar (CR CNRS) qui a d’abord quitté le LIAFA pour le
laboratoire CNRS du Chili et ensuite le CNRS, Nicolas Trotignon (CR CNRS) en 2011 pour le LIP.
En conclusion, composée en janvier 2007 de 8 membres, l’équipe a été fortement renforcée et compte
maintenant 14 permanents ce qui lui donne un formidable potentiel scientifique. En effet, même si
chaque chercheur de l’équipe possède un domaine de recherche qui lui est propre, l’un des atouts principaux de l’équipe réside dans le partage des thématiques générales et les discussions à l’issue du séminaire
débouchent souvent sur des publications communes.
79
CHAPITRE 1. RAPPORT SCIENTIFIQUE : ALGORITHMES DISTRIBUÉS ET GRAPHES
1.1.2
Thèmes de recherche
Algorithmique des graphes. Dans de nombreux domaines tels que la chimie, la biologie, les réseaux
de télécommunications ou encore les réseaux sociaux, des modèles à base de graphes sont utilisés quotidiennement en recherche. De même les graphes constituent des outils importants et très utilisés de
modélisation pour l’informatique elle-même. En effet malgré la simplicité apparente de leur définition,
les graphes capturent une large part de la complexité algorithmique. Il est donc très important de bien
comprendre la structure des graphes et en particulier les décompositions combinatoires afin d’utiliser
des modélisations pertinentes à base de graphes (i.e. des modélisations sur lesquelles les algorithmes de
résolution sont efficaces). Ainsi les recherches de l’équipe sur l’algorithmique des graphes ont deux objectifs principaux : le premier concerne la compréhension de la complexité structurelle des graphes via
des décompositions de graphes et les invariants de graphes associés, tandis que le deuxième est centré
sur la conception d’algorithmes efficaces sur les graphes même de très grande taille et l’étude des outils
algorithmiques nécessaires. Sur ces thèmes l’équipe collabore régulièrement avec D. Corneil (Toronto),
F. Dragan (Kent, USA), M. C. Golumbic (Haifa), B. Reed (Montréal), J. L. Szwarcfiter (Rio) et Y. Wu
(Shanghai) . . .
Tolérance aux pannes. De l’Internet aux ordinateurs multi-coeurs, la plupart des applications peuvent
être considérées comme des applications distribuées et doivent gérer la concurrence, la synchronisation
et la communication entre les diverses entités qui les composent. Ces applications doivent être robustes
dans le sens où le service rendu doit pouvoir être assuré même en présence de défaillances de certains
composants. Rappelons qu’un des problèmes essentiels est le fait qu’il est impossible de réaliser le
consensus entre des processus asynchrones dès que l’un de ces processus peut tomber en panne. D’une
manière générale, ce résultat d’impossibilité est central et défini une frontière, différente de celle de la
calculabilité classique, entre ce qui est possible et ce qui ne l’est pas. Nos recherches ont pour objectif
de contourner ce résultat d’impossibilité pour réaliser des applications tolérantes aux pannes. Sur ce
thème, l’équipe collabore au sein des ANR et par des publications avec le LRI, le Lip6 et Asap (INRIARennes) et collabore régulièrement avec M. Aguilera (Microsoft USA), R. Guerraoui (EPFL), S. Toueg
(U. Toronto), E. Gafni (UCLA), ...
Protocoles distribués pour les réseaux. La conception de protocoles distribués pour les réseaux soulève
à la fois des problèmes d’algorithmique distribuée et de conception de structures de données distribuées,
voire les deux en même temps. Si le problème roi reste celui du routage, il est relié à de nombreux
problèmes fondamentaux comme la conception d’étiquetage de distances, la coloration, le calcul de
spanner, etc... Les domaines d’applications des travaux de l’équipe ont principalement trait à la conception de protocoles pour Internet ou les réseaux pair-à-pair, à l’analyse de différents types de réseaux
sociaux (graphe du web, petits mondes, etc. . . ) et à la résolution de problèmes algorithmiques issus de la bio-informatique. On vise particulièrement à visiter l’interface entre les solutions théoriques
connues et les contraintes de l’algorithmique des grands réseaux. Sur ce thème, l’équipe collabore au
sein des ANR et par des publications avec le LRI, le LIP6 et le LABRI et collabore régulièrement avec
S. Kutten(Technion), A. Pelz (Ottawa), D. Peleg (Weismann), S. Rajsbaum (UNAM), R. Wattenhofer
(ETZH),...
1.2
Exemples de résultats significatifs
Théorie structurelle des graphes et coloration. L’équipe a obtenu plusieurs avancées intéressantes,
comme la résolution d’une conjecture de B. Reed sur la coloration fractionnaire [Ser10a], la solution
asymptotique de la conjecture de Griggs et Yeh [HRS12], l’avancée sur la conjecture de Bermond et
Thomassen [LPS09] ou encore les résultats sur la coloration circulaire des graphes cubiques [KMMS10]
et ceux des graphes de largeur d’arborescence bornée [KKSS10].
L’équipe a aussi développé des axes plus mathématiques. Ils concernent d’abord la théorie extrémale
80
des graphes avec notamment l’utilisation des algébres de drapeaux pour produire des avancées sur des
questions extrémales de graphes, mais aussi des problèmes de géométrie discrète [KMS12].
Aspects algorithmiques des décompositions de graphes. L’équipe a mis un point final (au moins pour
elle) à l’algorithmique de la décomposition modulaire des graphes en proposant un algorithme linéaire
très simple [TCHP08]. Les familles partitives qui sont sous-jacentes à la décomposition modulaire se retrouvent naturellement dans la décomposition de graphes en arbres, et notamment dans la décomposition
en coupes, introduite par Cunningham en 1982, qui est une généralisation de la décomposition modulaire. A partir du travail de Elias Dahlhaus en 2000 [J. Algorithms 36(2) : 205-240], on a mis en évidence
une sous-routine de l’algorithme principal qui permet de calculer des classes de recouvrement d’ensembles [CHLMRR08] et finalement réussi à construire un algorithme linéaire compréhensible pour la
décomposition en coupes qui emprunte certaines intuitions à Dalhlaus mais les complémente avec de
nouvelles. Ces travaux sont publiés dans SIAM Journal of Discrete Mathematics [CMR12]. Par ailleurs
on a étudié l’algorithmique des décompositions en 2-join et le calcul des paires homogènes, mais hélas
dans ces cas on est encore loin des algorithmes optimaux [HMM12].
Réseaux phylogénétiques et graphes cordaux. On a obtenu la solution d’une conjecture de phylogénie,
vieille de 20 ans de M. Steels, en fait un résultat d’impossibilité [HT11]. Ce résultat fut obtenu en
traduisant le problème sur la classe des graphes cordaux et en utilisant notre connaissance de la structure
de ces graphes [HS09c; HS11; HS12]. Concernant les applications à la biologie, nous avons étudié
dans la cadre de la thèse de Thu Hien To, des problèmes liés à des généralisations de la phylogénie,
lorsque la hiérarchie recherchée n’est plus un arbre mais possède quelques cycles. Enfin depuis 2010,
l’équipe a démarré une collaboration avec deux biologistes E. Bapteste et P. Lopez du Laboratoire (SAE)
Systématique, Adaptation, Evolution UMR CNRS 7138 et Université Paris 6. Cette collaboration porte
sur l’analyse des réseaux phylogénétiques et certaines des questions traitées dans la thèse de Thu Hien
To en sont issues. Cette collaboration a obtenu le soutien de la ville de Paris (2 années de post-doctorat).
Détecteur de défaillances. Les détecteurs de défaillances, introduits par Chandra et Toueg (J. ACM
96), sont des oracles distribués qui ne dépendent que des défaillances des processus. En déterminant
pour un problème donné le détecteur de défaillances minimal, on détermine l’information sur les
défaillances nécessaire et suffisante pour résoudre ce problème. Nous avons contribué de manière significative à déterminer le détecteur minimal de plusieurs primitives essentielles [DGFGT08; DGFGT09b;
DGFT09c; DGFT11]. En particulier, Chandra, Hadzilacos et Toueg (J. ACM 96) avaient découvert le
plus faible détecteur de défaillances pour résoudre le consensus dans un système par message, si une
majorité de processus sont corrects, laissant la question ouverte dans le cas d’un nombre quelconque de
pannes. Quinze ans plus tard, nous avons apporté une réponse à cette question [DGFG10], ce résultat a
été publié dans J. ACM en 2010.
Spanners et routage. Le calcul de spanner constitue l’un des problèmes fondamentaux liés à celui du
routage. En effet, toutes les constructions connues de routage compact résolvent de manière implicite
ce problème plus simple. Un spanner est un sous-graphe préservant les distances (voir Peleg et Ullman
[PODC’87]). Il existe un compromis entre la taille du spanner et son étirement (c’est-à-dire dans quelle
mesure les distances sont étirées dans le spanner en comparaison avec celles du graphe). Dans [DGPV08]
et [DGPV09], nous proposons des algorithmes distribués de calcul de spanner de petite taille avec faible
étirement. Ceci peut-être considéré comme un premier pas vers un algorithme distribué de routage compact [FLV08]. Dans le cadre des étiquetages informatifs [CFIKP09], nous avons résolu un problème
ouvert depuis plus de 20 ans [FK10a].
Petits-mondes. Les expériences en sciences sociales de Milgram dans les années 60 ont non seulement
révélé que les gens étaient à quelques poignées de mains les uns des autres (en moyenne 6) mais surtout qu’ils étaient capables de trouver des chemins très courts en se basant uniquement sur leur vision
extrêmement parcellaire du réseau social. Kleinberg (2000) a proposé un premier modèle algorithmique
81
basé sur une grille permettant de comprendre ce phénomène. L’équipe a poursuivi ses travaux sur ce
domaine en étendant et précisant considérablement son modèle et en obtenant ainsi une connaissance
bien plus profonde du phénomène des petits-monde et de ses applications au domaine de l’informatique distribuée. On a démontré que l’on pouvait transformer n’importe quel graphe en petit-monde par
l’ajout d’un unique lien aléatoire par nœud : [FG08; FG10b; FGKLL07; FGKLL09] pour les graphes
arbitraires, [LS08] pour les graphes admettant un plongement dans un espace euclidien de faible distorsion. La borne établie par [FG10b] réalise par ailleurs la borne inférieure précédemment établie dans
[FLL10a]. Nous avons également démontré que la loi sur le degré des nœuds a un impact significatif
sur les performances du routage [FG09]. La plupart des résultats présentent des bornes inférieures et
supérieures en adéquation. Nous avons également proposé un cadre d’analyse permettant de caractériser
totalement les algorithmes de recherche optimaux dans les modèles de Kleinberg [GS11]. Nous avons
également proposé et analysé le premier modèle dynamique naturel engendrant un petit-monde combinant marches aléatoires et oubli [CFL08a]. Nous avons enfin proposé une technique pour extraire les
liens longue-distance d’un graphe et valider ainsi le modèle de Kleinberg [FLL10b].
Réseaux sociaux. Avec la multiplication des données d’interactions représentables sous forme de
graphes à de très larges échelles (millions, milliards de sommets), l’analyse de la structure et de la dynamique globales de tels graphes est au cœur d’une intense activité de recherche interdisciplinaire. A cette
échelle, un défi majeur consiste à dépasser le stade de l’analyse globale pour produire une connaissance
utile sur les individus qui constituent ces réseaux. En effet [LPBSDHV08; RP11] montrent l’importance
des dynamiques locales dans la formation des liens et qu’il est possible d’identifier, au moyen de propriétés structurelles sur les graphes, et avec des algorithmes performants [SP09a], plusieurs gammes de
comportements individuels [BCPP09; PPBCP08; RP11; SSP12].
Distribution de contenu. La distribution de contenu via le pair-à-pair (P2P) est une solution efficace
à des problèmes industriels qui soulèvent de nombreuses questions théoriques. En utilisant le concept
de source (des pairs qui possèdent le contenu à distribuer et qui aident à sa dissémination), [Mat11]
montre que la bande passante disponible par utilisateur pouvait être ajustée pour répondre à peu près à
toutes les requêtes. Un brevet [MP08], est déposé sur cette méthode de distribution. Dans [BMMPV08;
BMMPV09a; BMMPV09b], on a répondu en partie aux problèmes posés par la vidéo à la demande tels
que : à quel utilisateur se connecter pour visionner (sans délai de pré-chargement) un film stocké ? Où
stocker les films ? En combien d’exemplaires ?
1.3
Animation scientifique, rayonnement, prix et récompenses
Comme en témoigne le nombre et la qualité des chercheurs invités et des co-auteurs, le réseau scientifique de l’équipe tant international que national est étendu et d’une très grande qualité.
Les membres de l’équipe participent à de nombreux comités de programme (dont la présidence du comité de programme de PODC en 2011) et comités de pilotage dans des conférences de référence de leurs
thématiques (PODC, DISC, WG, STACS). Ils participent aussi activement à l’animation scientifique
française par le biais des ANR et la participation continue à des comités de programme de conférences
nationales (Algotel, Jdir), mais aussi un soutien à la communauté Algérienne (COSI conférence annuelle
sur l’optimisation et les systèmes d’information).
Jean-Sébastien Sereni est à l’initiative et coresponsable de STRUCO, laboratoire européen associé du
CNRS dont les thèmes principaux sont la théorie des graphes, l’informatique théorique et la vérification.
L’équipe de recherche de ce LEA comprend également des chercheurs issus d’autres instituts, comme
l’IHESS et l’ENS (à Paris), le projet Mascotte (Sophia Antipolis), l’université de Bohème de l’ouest
(Plzen) et celle de Brno.
L’équipe est très fière de plusieurs distinctions obtenues ces dernières années, en particulier de la
Médaille d’Argent 2012 pour l’Institut des sciences informatiques et de leurs interactions (INS2I) qui
82
a été décernée à Pierre Fraigniaud, ainsi que trois prix du ”meilleur article” dont deux dans DISC une
conférence très sélective en algorithmique distribuée et enfin du prix de l’article le plus cité dans TCS
pour la période 2005-2010.
L’équipe tient à la vulgarisation de ses recherches. Laurent Viennot est éditeur scientifique de
)i(nterstices, un site de vulgarisation porté par Inria, le CNRS et les universités, et des membres de
l’équipe ont écrit plusieurs articles dans cette revue ainsi que dans d’autres magasines de vulgarisation (Le Monde supplément Sciences & Techno, Sciences & Avenir, La recherche, L’explosion des
mathématiques). Tous les ans à la fête de la sciences on propose des ateliers et des conférences.
Les recherches sur les réseaux sociaux ont permis d’établir des liens étroits avec Linkfluence et OrangeLabs (une thèse CIFRE a été réalisée avec chacun de ces partenaires) et de participer à la startup
Move&Play sur le partage de données personnelles. Un brevet [MP08] sur l’utilisation d’un ensemble
de clients privilégiés pour une diffusion collaborative a été déposé en 2008.
1.4
Fonctionnement interne
L’équipe partage avec les autres équipes les personnels administratifs et techniques (4 personnes) du
LIAFA et avec d’autres équipes Inria un personnel administratif (non présent au LIAFA).
La plupart des membres de l’équipe fait partie de l’équipe projet INRIA Gang (10 membres sont communs, 1 chercheur est uniquement à Gang, 2 chercheurs et 1 enseignant-chercheur sont uniquement
au LIAFA). L’équipe projet Gang a été favorablement évaluée en mars 2012, lors de l’évaluation de
la thématique INRIA Réseaux et Système. Cette affiliation INRIA, nous permet de collaborer naturellement avec les autres équipes projet du thème Réseaux et Système et de bénéficier d’une bonne
infrastructure technique.
L’équipe a un séminaire hebdomadaire qui couvrent toutes ses thématiques. Des sous groupes se retrouvent dans des groupes de travail plus pointus. Celui sur la décomposition de graphes qui a été actif
pendant deux ans a particulièrement bien réussi puisqu’il a donné lieu, entre autres, à une publication
dans SIAM Journal of Discrete Mathematics.
Les membres de l’équipe sont très actifs dans les demandes de financement sur projet tant nationaux
qu’internationaux et ils ont un bon taux de réussite. L’équipe bénéficie de plus d’un excellent environnement : l’Ecole Doctorale Science mathématique, la fondation Sciences Math de Paris, l’Université Paris
Diderot, l’Ile de France, la ville de Paris ainsi que l’ANR, le CNRS et INRIA (via notre équipe Gang)
et a aussi des liens avec des entreprises (OrangeLabs, LinkFluence, Thales). L’équipe s’adresse à toutes
ces sources pour financer des doctorants, des post doctorants, des chercheurs invités et des missions en
s’organisant afin que ses demandes ne rentrent pas en concurrence.
On a ainsi obtenu par ces différentes sources l’équivalent de 15 années de Post Doc, 34 mois de chercheurs invités et 14 financements de thèses (dont 2 thèses CIFRE). Depuis 2007, les ressources sur projet
ont augmenté de plus de 100% et on a ainsi pour 2012 environ 300Ke de financement. Les financements
associés à un projet vont naturellement aux participants du projet. Jusqu’à maintenant les financements
obtenus couvrent les besoins de chaque membre de l’équipe.
1.5
Formation par la recherche
L’algorithmique distribuée et la théorie des graphes forment un ensemble de quatre cours cohérents dans
le master recherche en informatique (ex MPRI). Les enseignants de l’équipe participent à d’autres cours
de niveau Master 2 dans d’autres universités et dans d’autres grandes écoles (Centrale, ENPC, ENS
Lyon, INSA, X).
Durant la période concernée par ce rapport, 13 étudiants en stage de M2 ont été accueillis, 14 doctorants
ont commencé une thèse et 11 thèses ont été soutenues dans l’équipe.
83
Toutes les thèses sont financées : grandes écoles, allocation doctorale du ministère, projet (ANR, Ile de
France), CIFRE... La durée moyenne d’une thèse est de 3,5 ans.
En plus des dispositifs mis en place par l’Ecole Doctorale et le LIAFA (séminaire des doctorants, école
de printemps), le séminaire de l’équipe, les groupes de travail, les nombreux chercheurs invités, les séries
de cours organisés sur un thème donné (le lemme de régularité de Szemerédi, Structure des graphes épars
(i.e. la récente théorie de J. Nešetřil et P. Ossona de Mendez), preuve complète du théorème PCP...)
contribuent à la formation des doctorants.
Enfin, les doctorants sont impliqués dans les projets ANR et participent aux journées de travail de ceuxci ce qui leur permet de se former et de présenter leurs travaux tout en s’intégrant au réseau de recherche
national.
84
Chapitre 2
Nom du Directeur de l’unité : Pierre Fraigniaud
Nom du responsable de l’équipe : Carole Delporte-Gallet
2.1
Effectifs
2007 : 3 chercheurs (2 CNRS, 1 INRIA), 5 enseignants-chercheurs, 6 postdoc, 7 doctorants.
2012 : 7 chercheurs (5 CNRS, 2 INRIA), 7 enseignants-chercheurs, 2 postdoc, 9 doctorants.
Personnels qui ont quitté l’équipe : Emmanuel Lebhar (septembre 2009, 32 mois), Nicolas Trotignon
(de septembre 2008 à mars 2011, 31 mois).
Recrutement : 2007 : Carole Delporte (Changement d’équipe), Hugues Fauconnier (Changement
d’équipe), Amos Korman (CR2), Mathieu Raffinot (Mutation). 2008 : Nicolas Schabanel (Mutation), Jean-Sébastien Séreni (CR2), Nicolas Trotignon (CR1). 2010 : Fabien Mathieu (Chercheur
CDD INRIA).
2.2
Décomposition de graphes. Notre équipe a une longue (et fructueuse) tradition de recherche sur la
thématique de la décomposition de graphes [CHLMRR08; HP10]. Nous avons atteint deux objectifs majeurs : un algorithme linéaire simple pour la décomposition modulaire [TCHP08] et un
algorithme linéaire pour la décomposition en coupes [CMR12].
Détecteurs de défaillances. Nous avons réalisé un important travail sur les plus faibles détecteurs de
défaillances [DGFGT08; DGFT09b; DGFT09c; DGFT11] et clôt un problème ouvert depuis plus
de 20 ans pour le consensus [DGFG10].
Petits-mondes. Nous avons eu un rôle moteur dans l’analyse des graphes petits-mondes de Kleinberg [CFL08a; FGKLL07; FGKLL09; FKL10; FLL10a; FLL10b; LS08] et sans doute clôt ce
sujet en proposant un cadre d’analyse très simple et en établissant les performances optimales
exactes des algorithmes de routage distribués pour ce modèle [GS11].
Theorie structurelle des graphes et coloration. Nous avons obtenu plusieurs avancées significatives
sur la coloration des graphes [KKSS10; KMMS10; LPS09; Ser10a], et apporté une solution
asymptotique à la conjecture de Griggs et Yeh [HRS12].
Spanner et routage. Nous avons proposé plusieurs algorithmes efficaces pour le calcul distribué de
spanners avec faible étirement [DGPV08; DGPV09] et des algorithmes distribués de routage
compact [FLV08]. Dans le cadre des étiquetages informatifs [CFIKP09], nous avons résolu un
problème ouvert depuis plus de 20 ans [FK10a].
85
CHAPITRE 2. FICHE RÉSUMÉ : ALGORITHMES DISTRIBUÉS ET GRAPHES
2.3
2.3.1
Bilan quantitatif
Publications
Journaux : 117 ; Conf. Int. avec CL : 133 ; Conf. Int. Inv. : 19.
[CMR12] Pierre Charbit, Fabien Montgolfier, Mathieu Raffinot. “Linear Time Split Decomposition Revisited”. SIAM Journal
on Discrete Mathematics 26.2 (2012), pp. 499–514. DOI: 10.1137/10080052X. URL: http://link.aip.or
g/link/?SJD/26/499/1
[DGFG10] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. “Tight failure detection bounds on atomic object
implementations.” J. ACM 57.4 (2010)
[GS11] George Giakkoupis, Nicolas Schabanel. “Optimal path search in small worlds: dimension matters.” In: Proceedings
of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. ACM, 2011,
pp. 393–402
[HRS12] Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni. “Griggs and Yeh’s Conjecture and L(p, 1)-labelings.” SIAM
J. Discrete Math. 26.1 (2012), pp. 145–168
[FK10a] Pierre Fraigniaud, Amos Korman. “An optimal ancestry scheme and small universal posets.” In: Proceedings of the
42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM,
2010, pp. 611–620
2.3.2
Brevet ”Utilisation d’un ensemble de clients privilégiés pour une diffusion collaborative de
contenu” [MP08].
Habilitation à Diriger des Recherches :
1. Christophe Prieur, Réseaux sociaux, algorithmes, identités, automne 2012.
2. Nicolas Schabanel, Systèmes complexes & Algorithmes, 26 février 2010.
3. Nicolas Trotignon, Structure des classes de graphes définies par l’exclusion de sous-graphes induits, 15 décembre 2009.
2.3.3 Rayonnement
1. Médaille d’Argent 2012 de l’Institut des sciences informatiques et de leurs interactions (INS2ICNRS). Prix de l’article le plus cité de TCS pour la période 2005-2010 (2010) et 3 prix du
”meilleur article” (DISC (2009 et 2011), ICDCN (2009)).
2. Co-direction, avec l’Université de Charles de Prague, du LEA Laboratoire Franco-Tchéque sur la
théorie des graphes, l’informatique théorique et la vérification (STRUCO).
3. Large réseau scientifique international : invitation de chercheurs étrangers (34 mois cumulés), 57
participations à des comités de programme, présidence du comité de programme de PODC, 10
projets bilatéraux, Projet Europeen COST Dynamo (36 partenaires).
4. Acteur dynamique de la recherche française : 13 participations aux comités de programme nationaux, co-présidence du comité de programme d’Algotel, 9 projets ANR.
5. Trois quarts des membres de l’équipe sont membres de l’équipe projet INRIA GANG.
2.3.4 Interactions de l’équipe avec son environnement
1. Contrat avec le musée des science de Santiago du Chili (Museo Interactivo Mirador) pour le
développement et la réalisation de l’ attraction ”Fenêtre sur l’infini”.
2. Participation à la création de la startup Move&Play sur le partage de données personnelles.
(lauréate 2007 et 2008 du concours national OSEO d’aide à la création d’entreprises de technologies innovantes).
3. Réalisation de deux services web de visualisation liés à la couverture médiatique de la campagne
présidentielle (l’un lauréat du concours Dataviz 2012 de Google France, et l’autre intégré sur
lemonde.fr).
2.3.5 Actions de formation
1. Masters de Paris Diderot dont “Master de Recherche en Informatique (ex MPRI)” (4 cours).
2. Série de cours à destination des chercheurs sur la ”Preuve complète du théorème PCP”.
3. Cours à l’Ecole Polytechnique, ENPC, ENS Lyon, Centrale Paris, INSA Lyon.
86
Chapitre 3
Name : LIAFA, UMR 7089
Leader : Pierre Fraigniaud
Leader of the team : Carole Delporte
3.1
Members
2007 : 3 researchers (2 CNRS, 1 INRIA), 5 teaching researchers, 6 postdoc, 7 PhD students.
2012 : 7 researchers (5 CNRS, 2 INRIA), 7 teaching researchers, 2 postdoc, 9 PhD students.
Persons who left the team : Emmanuel Lebhar (september 2009, 32 mo.), Nicolas Trotignon (from
september 2008 to march 2011, 31 mo.).
New members : 2007 : Carole Delporte (team change), Hugues Fauconnier (team change), Amos Korman (CR2), Mathieu Raffinot (lab change). 2008 : Nicolas Schabanel (lab change), Jean-Sébastien
Séreni (CR2), Nicolas Trotignon (CR1). 2010 : Fabien Mathieu (INRIA non-permanent researcher).
3.2
Scientific outcomes
Graph decompositions. Our team has a fruitful and longstanding research tradition in graph decomposition [CHLMRR08; HP10]. We have matched two major objectives : a simple linear time
algorithm for modular decomposition [TCHP08] and a linear-time algorithm for cut decomposition [CMR12].
Failure detectors We have achieved an important work on the weakest failure detectors [DGFGT08;
DGFT09b; DGFT09c; DGFT11] and answered a question on consensus which was open for 20
years [DGFG10].
Smallworlds. We have a leading role in the analysis of Kleinberg’s models for the smallworld phenomenon [CFL08a; FG08; FG09; FG10b; FGKLL07; FGKLL09; FLL10a; FLL10b; LS08]; in
particular, we have provided a simple framework for the analysis the optimal performances of
routing algorithms in this model [GS11].
Structural graph theory and Colouring. We have proposed several significant improvements on
graph colouring [KKSS10; KMMS10; LPS09; Ser10a], and obtained an asymptotic solution to
Griggs and Yeh’s conjecture [HRS12].
Routing. We have proposed efficient distributed algorithms for the computation of sparse spanners with
low stretch [DGPV08; DGPV09]. Concerning informative labeling schemes, the most studied
problem in the literature [CFIKP09] has finally been closed by the team in [FK10a].
87
CHAPITRE 3. EXECUTIVE SUMMARY : DISTRIBUTED ALGORITHMS AND GRAPHS
3.3
3.3.1
Publications
Journals : 117 ; Int. Conf. with PC : 133 ; Inv. Int. Conf. : 19.
[CMR12] Pierre Charbit, Fabien Montgolfier, Mathieu Raffinot. “Linear Time Split Decomposition Revisited”. SIAM Journal
on Discrete Mathematics 26.2 (2012), pp. 499–514. DOI: 10.1137/10080052X. URL: http://link.aip.or
g/link/?SJD/26/499/1
[DGFG10] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. “Tight failure detection bounds on atomic object
implementations.” J. ACM 57.4 (2010)
[GS11] George Giakkoupis, Nicolas Schabanel. “Optimal path search in small worlds: dimension matters.” In: Proceedings
of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. ACM, 2011,
pp. 393–402
[HRS12] Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni. “Griggs and Yeh’s Conjecture and L(p, 1)-labelings.” SIAM
J. Discrete Math. 26.1 (2012), pp. 145–168
[FK10a] Pierre Fraigniaud, Amos Korman. “An optimal ancestry scheme and small universal posets.” In: Proceedings of the
42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM,
2010, pp. 611–620
3.3.2
Patent ”Using privileged users set for collaborative content broadcast” [MP08].
Habilitation à Diriger des Recherches (Tenures) :
1. Christophe Prieur, Réseaux sociaux, algorithmes, identités, automn 2012.
2. Nicolas Schabanel, Systèmes complexes & Algorithmes, february 26, 2010.
3. Nicolas Trotignon, Structure des classes de graphes définies par l’exclusion de sous-graphes induits, december 15, 2009.
3.3.3 Influence of the team
1. 2012 Silver medal from the CNRS Institut des Sciences Informatiques et de leurs Interactions
(INS2I-CNRS). Top cited article award in TCS for 2005-2010 (2010) and three best paper awards
(DISC (2009 et 2011), ICDCN(2009)).
2. Co-direction (together with Charles University in Prague) of the LEA, the French-Czech lab on
Graph Theory, Theoretical Computer Science and Verification (STRUCO).
3. Large international scientific network : invitations of foreign researchers (34 mo. in total), 57 participations to program committees, PODC program committee chair, 10 bilateral projects, European
project COST Dynamo (36 partners).
4. Active actor on the French research stage : 13 participations to national program committees,
co-chair of Algotel program committee, 9 ANR grants.
5. 3/4 of the team members belong also to the INRIA GANG team.
3.3.4 Interactions between the team and its environment
1. Financial agreement with Museo Interactivo Mirador (Santiago de Chile science museum) for the
realization of the permanent interactive exhibition ”Encuentra el infinito”.
2. We have participated to the creation of a startup-up company on personal data sharing. The company has received grants in 2007 and 2008 from the national OSEO funding contest.
3. Realization of two visualization web services for the media coverage of the French presidential
campaign (one won the Google France Dataviz 2012 competition and the other was integrated to
the lemonde.fr website).
3.3.5 Teaching
1. Paris Diderot Masters, in particular “Master de Recherche en Informatique (ex MPRI)” (4
courses).
2. Series of lectures addressed to researchers ”Complete proof of the PCP Theorem”.
3. Lectures at the École Polytechnique, ENPC, ENS Lyon, Centrale Paris, INSA Lyon.
88
Chapitre 4
Le distribué a acquis une certaine maturité mais il prend aussi une importance croissante dans les nouvelles technologies et les usages actuels de l’informatique. Il se développe dans plusieurs directions tant
au sein des ordinateurs qu’au sein des grands réseaux tant sur des aspects techniques que sur des aspects
sociaux. Ce phénomène devrait se renforcer et de nouveaux domaines de recherche émerger au cours
des dix prochaines années.
4.1
Objectifs scientifiques
L’explosion du distribué ne permettra pas aux membres de l’équipe, dans sa composition actuelle, d’en
couvrir tous les aspects. Par ailleurs, l’élargissement du spectre des recherches risque d’éloigner plus
encore thématiquement ceux-ci. Cette évolution est amplifiée par le départ de Nicolas Trotignon auquel
va s’ajouter celui de Jean-Sébastien Sereni qui a demandé une mutation au LORIA pour rapprochement de conjoints 1 . Ils travaillaient sur des thématiques relevant de la théorie des graphes. Il ne restera
prochainement plus que deux membres ayant pour thématique principale la théorie des graphes or les
interactions du reste de l’équipe avec ce thème théorique (cf. les publications communes) étaient l’une
des spécificités de notre équipe.
Dans ces conditions (l’auto-évaluation du projet scientifique de l’équipe est résumé dans le diagramme
MOFF Figure 4.1) l’équipe a identifié plusieurs défis scientifiques, détaillés ci dessous, sur lesquels elle
va travailler dans les cinq prochaines années.
Ceux ci concernent des recherches fondamentales et appliquées d’algorithmique distribuée et de théorie
des graphes ainsi que des recherches relevant de la bio-informatique. Ces dernières sont en continuité
avec des travaux déjà réalisés (sous section 4.1.3) et des travaux débutés tout récemment (sous section
4.1.4).
4.1.1
Théorie de la calculabilité et de la complexité du calcul distribué.
Le calcul distribué soulève de nombreuses questions de calculabilité et de complexité. Par exemple, pour
les problèmes liés aux calculs tolérants aux pannes, les résultats classiques d’impossibilité ne sont pas
liés à la puissance de calcul des processus. Ces résultats d’impossibilité ont une forme d’indécidabilité
qui est fondamentalement différente de celle du calcul séquentiel. De la même manière, dans le calcul
réseau, la possibilité de résoudre localement certaines tâches ne dépend pas de la puissance de chacun
des processus.
L’objectif est d’établir les fondements scientifiques d’une théorie de la calculabilité et de la complexité
du calcul distribué.
Une difficulté à laquelle nous devons faire face est de concilier les deux sous communautés du calcul
1. Jean-Sébastien Sereni est affecté au LORIA à partir du 1er janvier 2013.
89
EXTERNE
F IGURE 4.1 – Analyse MOFF du projet scientifique
90
en
ac
D
es
de épe
pr s fi nd
ov n an
en an c
an ce e im
ce me p
de nts ort
l’A en ant
e
N
R
M
NEGATIVE
s
té
t
ni
en
tu
em du
or
nn te
pp
iro an
O
nv ss
es
l’e roi es rn
de c l de
é ce ns o
lit an da m
ua rt é es
Q po u gi
– Im strib olo
di chn
te
–
–
F
–
IN
Fo RI
na rt A-G
tio tis a
na su ng
le de
s
et co
in llab
te o
rn ra
at tio
Fo
io n
na s
rc
le
es
s
–
la
de
it
ue
fa
iq
u
at te
td
ém ui
en
th la s
m
te tre la
la ec e s à
éc sp nt d he
d’
p
e du me ra
qu ur se s g
ris ge lis e
s
– lar ib e d ts
r
a
i
f
se
af or pa
es
– thé dé
bl
de
ai
F F
O M
POSITIVE
CHAPITRE 4. PROJET SCIENTIFIQUE : ALGORITHMES DISTRIBUÉS ET GRAPHES
INTERNE
distribué : calcul tolérant aux pannes et calcul réseau, qui ont chacune développé des modèles de calcul
distribué. La première est plus intéressée par les problèmes liés à l’asynchronisme et la deuxième par les
problèmes liés au réseau. Les différents travaux auxquels s’attaquent ces deux communautés impliquent
différents objectifs : la calculabilité est au centre de la première tandis que la complexité est au centre
de la seconde.
L’équipe avec des spécialistes des deux courants principaux du calcul distribué est particulièrement bien
armée pour relever ce défit.
Pour atteindre notre objectif, on se propose de réaliser les tâches suivantes :
– Formaliser les problèmes oui/non pour lesquels les calculs distribués seront interprétés comme une
sortie binaire unique : oui ou non, dans le contexte du calcul distribué. Ces problèmes aspirent à
jouer pour le calcul distribué un rôle analogue à celui joué par des problèmes de décision dans le
contexte du calcul séquentiel.
– Revisiter les différentes notions d’oracles, qu’ils soient explicites (par exemple, des détecteurs de
défaillances) ou implicites (par exemple, des informations a priori) utilisés dans le calcul distribué,
pour les spécifier en terme de classes de décidabilité/complexité basées sur des oracles.
– Comparer des classes de complexité et de décidabilité correspondant à la capacité de résoudre
des problèmes oui/non, ou de résoudre ces problèmes dans un certain temps. Cette tâche exige
d’introduire de nouvelles notions de réductions entre problèmes.
– Identifier l’impact du non déterminisme sur le calcul distribué. En particulier, nous voulons
mieux comprendre le manque apparent d’impact du non déterminisme dans le contexte du calcul tolérant aux pannes, apparemment en contraste avec l’impact énorme du non déterminisme
dans le contexte de calcul réseau. Egalement, nous pensons que le non déterminisme permettra la
comparaison de classes de complexité définies dans le contexte de tolérance aux pannes avec des
classes de complexité définies dans le contexte du calcul de réseau.
– Enfin on étudiera des nouveaux paradigmes de calcul, y compris, le calcul distribué quantique
(thèse Eger Arfaoui) et la théorie algorithmique des jeux (par exemple, des jeux de construction
de réseau).
On aura donc à faire face et à résoudre plusieurs problèmes extrêmement stimulants. Pour se faire, on
a pris soin de rassembler dans l’ANR DISPLEXITY (ANR Blanche 2012-2016) outre prés de la moitié
des chercheurs de notre équipe des chercheurs français choisis parmi les leaders du calcul distribué
(ASAP INRIA Rennes, LABRI Bordeaux). On compte aussi sur notre réseau international (E. Gafni
(UCLA), R. Guerraoui (EPFL), A. Pelz (Ottawa), D. Peleg (Weismann), S. Rajsbaum (UNAM), S.
Toueg (Toronto)...) pour mener à bien ce projet. Le succès de ces recherches aboutira à un accroissement
significatif de la connaissance actuelle et de la compréhension du calcul distribué.
4.1.2
Grands réseaux
Algorithmique du Pair-à-Pair
La distribution de contenu via le pair-à-pair (P2P) est une solution efficace à des problèmes industriels
qui soulève de nombreuses questions théoriques. Depuis les premières applications de diffusion de fichiers (filesharing) bien des progrès ont été faits. Ainsi on peut mettre en oeuvre de la vidéo à la demande
(Vod) via un réseau P2P. Un tel service est en effet possible en utilisant les capacités de stockage et la
connectivité des modems évolués (”boxs”). Sa mise en oeuvre pose des problèmes tels que : à quel
utilisateur se connecter pour visionner (sans délai de pré-chargement) un film stocké ? Où stocker les
films ? En combien d’exemplaires ? Augmenter le nombre de copies améliore la qualité du service, mais
diminue le nombre maximal de films offerts. Nous avons déjà montré qu’un nombre constant de copies
91
(indépendant du nombre d’utilisateurs) suffit. Mais la mise en oeuvre d’un tel mécanisme soulève de
nouvelles questions en particulier à qui se connecter (arbitrage entre la longueur et la largeur des arbres
de diffusion à construire), la tolérance aux pannes ( la déconnexion impromptue d’un pair risquant de
déstabiliser le flux), l’incitation à la coopération, etc...
Les mécanismes ”à la bittorrent” d’incitation à la coopération par échange de bande passante (tit-fortat algorithm) soulèvent d’intéressants problèmes. Les mécanismes para-économiques mis en jeux ne
sont pas le thème de l’équipe ; par contre ils nous ont amené à l’étude des systèmes de préférences.
La donnée est un ensemble d’acteurs pouvant tirer profit de collaborations mutuelles, mais avec des
capacités limités. Etant donné l’utilité attendue de chaque collaboration, et les connaissances partielles,
il faut déterminer qui collaborera avec qui. C’est une extension de la théorie des mariages (Gale Shapley)
dont l’étude peut encore se révéler très riche.
Ce travail se fait en lien étroit avec l’équipe-projet INRIA Gang, dont sont membres toutes les personnes
du LIAFA impliquées. Des contacts sont établis avec la start-up Cleverscale (fondée par Anh-Tuan Gai
qui a travaillé avec l’équipe durant son doctorat), s’intéressant aux réseaux de distribution de contenu
(CDN).
Modélisation et algorithmique des réseaux sociaux
L’étude des réseaux sociaux sur le web est un des grands enjeux techniques et sociaux des années à venir.
Tout d’abord, l’évolution du web est aujourd’hui tournée vers les mécanismes de recommandation en
temps réel portés par les réseaux sociaux. Or, les outils algorithmiques en la matière sont encore balbutiants et obscurs. Par ailleurs, étudier l’évolution rapide des pratiques de sociabilité en ligne nécessite
d’enrichir par de nouvelles méthodes la recherche en sciences sociales. Ces deux questions sont au cœur
du projet interdisciplinaire Algopol (ANR Contenu et interactions, 2012–2015).
Sur le plan des méthodes, la mise au point d’algorithmes alternatifs tels que des algorithmes de streaming, pour les calculs de motifs, semble une piste très prometteuse compte tenu de la structure très
locale des réseaux sociaux.
Durant ces dix dernières années, un très grand nombre de données ont été collectées sur la dynamique de
réseaux de natures très différentes (Facebook, Twitter, contacts dans les hopitaux, écoles, conférences,
etc.). Durant le PEPS DynaDraw, on a démontré que l’algorithmique standard échoue à capturer la nature
des graphes dynamiques : l’approche en-ligne est souvent trop pessimiste pour obtenir des résultats
probants et inversement, l’application d’algorithmes hors-ligne à chaque pas de temps conduit à des
solutions instables au cours du temps (principalement à cause de la faible densité de ces graphes à
chaque instant).
En connaissant l’ensemble de la dynamique, l’objectif est de rechercher une solution stable dans le temps
réagissant aux changements brutaux du réseau.
Nous projetons d’étudier dans un premier temps le problème de la partition en clusters d’un graphe dynamique au cours du temps. Nous nous proposons d’introduire une fonction objectif cherchant à la fois
à maximiser la qualité de la partition (approche classique) tout en incluant un prix pour les modifications de la solution au cours du temps. Une première approche consiste à payer pour chaque sommet
changeant de composante, une autre consiste à étudier différentes mesures d’entropie du changement.
Si l’approche par programmation linéaire semble bien adaptée pour le premier cas, la programmation
convexe pourrait être nécessaire dans le second. Le problème de la décomposition en clusters est motivé par celui du dessin des graphes dynamiques, un véritable enjeu pour la compréhension des données
collectées actuellement que nous souhaitons aborder à terme. Ces travaux seront financés par l’ANR
RDAM qui vient d’être acceptée.
92
4.1.3
Algorithmique de graphes
Les grands théorèmes de décomposition des graphes (par exemple ceux liés à la théorie des graphes parfaits) utilisent des notions comme les décompositions en 2-join, ou de paire homogène (généralisation de
la décomposition modulaire), et enfin de skew-partition. On sait encore peu de chose sur l’algorithmique
liée à ces décompositions et nous en avons commencé l’étude (thèse Antoine Mamcarz).
L’objectif est de construire une théorie des parcours de graphes.
Nous avons prolongé l’étude démarrée par D. Corneil (Toronto) qui a obtenu de nouvelles caractérisations des parcours classiques de graphes. Nos premiers résultats mettent en évidence les propriétés gloutonnes d’un parcours récemment découvert (le parcours lexicographique en profondeur).
Nous espérons mieux comprendre ces phénomènes et formaliser les idées d’algorithmes multi-parcours
(thèse Jérémie Dusart). Nous travaillons également sur les calculs du diamètre et des centres de très
grands graphes en proposant des algorithmes capables de donner un résultat exact même sur des très
grands graphes. Nous envisageons de nous attaquer au problème de l’approximation du flot maximum
dans un graphe. En effet les algorithmes exacts polynomiaux disponibles sont trop lourds pour être utilisés sur de très grands graphes. Pour ce faire nous baserons notre approche sur des parcours de graphes
successifs et la comparerons avec celles issues de la théorie spectrale des graphes (nombreuses collaboration sur ce thème avec D. Corneil (Toronto), P. Crescenzi (Florence), R. Grossi (Pise), et l’équipe
projet Mascotte (Sophia)).
Enfin nous continuerons notre collaboration avec une équipe des biologistes de Paris 6 (E. Bapteste,
P. Lopez) sur des algorithmes de graphes pour l’étude de l’évolution des génomes de virus. A ce jour
nous avons proposé une heuristique de partionnement de graphes dont nous allons publier les résultats
en biologie.
4.1.4
Bioinformatique
Ces cinq dernières années, de nouvelles techniques de séquençage dites “haut débit” sont apparues avec
de nouveaux défis en terme d’assemblage et de recherche de motifs. Différents types de séquenceurs
existent, les principaux étant le 454, le Solexa et le Solid. Ils ont en commun de générer d’énormes
quantités de données qu’il faut rechercher dans des banques de données (typiquement GeneBank), mapper sur un génome (i.e. localiser les occurrences de chaque séquence avec erreurs dans un génome (de
1Mo à 10Go), ou encore les comparer entre elles. Pour donner un exemple, un “run” de 454 génère en
24h un million de séquences de 500 à 600 bases, un “run” de Solexa génère 50 Go de données en 3 jours.
Cette volumétrie est appelée à augmenter de manière exponentielle au cours des prochaines années. En
outre, les recherches de motifs à effectuer devraient résister à un taux de similarité faible, de l’ordre de
80%, ce qui est loin d’être le cas actuellement.
Le Génoscope possède plusieurs sorte de séquenceurs et participe au projet TARA d’étude du plancton
marin. Ce projet doit mener au séquençage de 2000 échantillons d’ensembles de protistes (petits eucaryotes unicellulaires) sur trois ans, chaque échantillon étant séquencé par un “run” d’un des séquenceurs
(ou parfois de plusieurs). La quantité de données à manipuler est donc faramineuse.
Relever ce défi nécessite l’association de techniques fines en algorithmique mais aussi des techniques
de parallélisme SIMD sur processeurs classiques (avec du code SSE par exemple) ou GPU (Graphic
Processing Unit), dont l’apport exact doit être évalué. C’est sur ce défi que porte le projet Mappi en
collaboration des membres du Genoscope (Evry) qui s’occupent du projet TARA, de l’équipe d’H.
Touzet du LIFL (Lille) et de l’équipe de D. Lavenier à l’IRISA (Rennes).
Ce projet commencé en 2011 a porté ses premiers fruits, à la fois sur des problèmes de métagénomique à Rennes, sur des problèmes de recherche de bases d’ARN à Lille et sur des recherches en
indexation compacte et en recherche d’expressions régulières particulières approchées au LIAFA (thèse
93
D. Belazzougui).
4.2
Mise en œuvre du projet
Comme on l’a vu au long de la section précédente, on a mis en place les moyens humains et financiers
pour atteindre nos objectifs scientifiques. On compte sur les forces de l’équipe mais tirant parti de notre
réseau de collaborations, on a pris soin de s’associer au travers d’ANR et d’autres projets (projet bilatéraux, pics, peps....) à d’autres équipes et personnalités tant françaises qu’étrangères et d’inclure dans
les ANR des moyens humains en doctorants et post doctorants. Au cours de l’avancée des recherches
sur les thèmes présentés ci dessus, on pense, intégrer d’autres doctorants et post doctorants en faisant
des demandes de bourses à l’Ecole Doctorale, à la Fondation, à la Ville de Paris....
D’un point de vue financier, les résultats des demandes faites en 2012, ne sont pas encore tous connus
mais l’équipe dispose actuellement pour 2013 d’un budget d’environ 200 Ke (hors financement du
laboratoire) ce qui lui assure un budget suffisant pour son financement. Actuellement les financements
proviennent pour la plupart de l’ANR, et un effort doit être fait pour obtenir des financements européens.
Au cours de la période du présent rapport, des liens se sont consolidés avec des entreprises (LinkFluence,
OrangeLab, Thales...) et se sont concrétisés par un brevet, deux thèses CIFRE (une soutenue en 2010 et
une en cours), des publications communes, la participation à la création de la startup Move&Play... Par
les développements techniques et sociaux actuels et le domaine d’expertise de l’équipe, on est dans un
contexte particulièrement favorable au développement de collaborations avec des entreprises. Les projets
de recherche sur les grands réseaux présentés section 4.1.2 en seront le coeur. Ils devraient conduire à
la pérennisation de thèses CIFRE au sein de notre équipe, à des implications plus ou moins importantes
dans des startups, à des partenariats pour des brevets, des développements....
Le transfert des technologies ne se fait pas seulement via les thèses et les collaborations directes de chercheurs avec les entreprises mais aussi via les étudiants formés. L’équipe est active tant au sein du master
professionnel que du master de recherche de l’université. Quatre cours dans le master recherche, en un
ensemble cohérent, forment les étudiants aux recherches de l’équipe. Dans le master professionnel, les
thématiques de l’équipe sont centrales au parcours SRI (environ 50 étudiants par an) et le seront encore
plus dans l’évolution de celui-ci dans le prochain quinquennal en un parcours IMPAIRS (l’Information
et la Mobilité : leurs Programmations, leurs Algorithmes pour l’Internet, la Répartition et les Systèmes).
94
Chapitre 5
ACL : Articles dans des revues internationales ou nationales
Les publications [EFKR10; EFKR11] sont communes avec l’équipe ”Algorithmes et complexité”.
[CJKPT08] avec l’équipe ”Automates et applications”.
[ADGFT08]
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg.
“On implementing omega in systems with weak reliability and synchrony assumptions.”
Distributed Computing 21.4 (2008), pp. 285–314.
[BBGGJS11] Éric Bertin, Guillaume Beslon, Olivier Gandrillon, Sébastian Grauwin, Pablo Jensen,
Nicolas Schabanel. “Les complexités : point de vue d’un institut des systèmes complexes”.
Hermès 60 (2011), pp. 145–150.
[BBPV11]
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. “Theory and practice
of monotone minimal perfect hashing.” ACM Journal of Experimental Algorithmics 16
(2011).
[BCCGK09]
Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler. “On
the convergence of population protocols when population goes to infinity.” Applied Mathematics and Computation 215.4 (2009), pp. 1340–1350.
[BCF11]
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud. “Parsimonious flooding in dynamic graphs.” Distributed Computing 24.1 (2011), pp. 31–44.
[BCHP08]
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul. “A Simple Linear Time
LexBFS Cograph Recognition Algorithm.” SIAM J. Discrete Math. 22.4 (2008), pp. 1277–
1296.
[BCMR08]
Anne Bergeron, Cedric Chauve, Fabien Montgolfier, Mathieu Raffinot. “Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of
Graphs.” SIAM J. Discrete Math. 22.3 (2008), pp. 1022–1039.
[BCPP09]
Jean-Samuel Beuscart, Dominique Cardon, Nicolas Pissard, Christophe Prieur. “Pourquoi
partager mes photos de vacances avec des inconnus? Les usages de Flickr”. Réseaux 154
(2009).
[BFFS07]
Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. “Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.” Theory Comput. Syst. 40.2 (2007),
pp. 143–162.
[BFNV08]
Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial. “Distributed chasing of network intruders.” Theor. Comput. Sci. 399.1-2 (2008), pp. 12–37.
[BH12]
Yacine Boufkhad, Thomas Hugel. “Estimating satisfiability.” Discrete Applied Mathematics 160.1-2 (2012), pp. 61–80.
95
CHAPITRE 5. LISTE DES PUBLICATIONS : ALGORITHMES DISTRIBUÉS ET GRAPHES
[BJHT11]
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon. “Finding an induced subdivision
of a digraph”. Electronic Notes in Discrete Mathematics 37 (2011), pp. 9–14.
[BLMBSKCMMNST11] Robert Birke, Emilio Leonardi, Marco Mellia, Arpad Bakay, Tivadar Szemethy, Csaba Kiràly, Renato Lo Cigno, Fabien Mathieu, Luca Muscariello, Saverio Niccolini,
Jan Seedorf, Giuseppe Tropea. “Architecture of a network-aware P2P-TV application: the
NAPA-WINE approach.” IEEE Communications Magazine 49.6 (2011), pp. 154–163.
[BLS10]
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni. “Two proofs of the
Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree.” Discrete Mathematics 310.3 (2010), pp. 557–560.
[BXH09]
Binh-Minh Bui-Xuan, Michel Habib. “Unifying the representation of symmetric crossing families and weakly partitive families.” Electronic Notes in Discrete Mathematics
34 (2009), pp. 329–333.
[BXHLM09]
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien Montgolfier. “Algorithmic aspects of a general modular decomposition theory.” Discrete Applied Mathematics
157.9 (2009), pp. 1993–2009.
[BXHP08]
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. “Competitive graph searches.”
Theor. Comput. Sci. 393.1-3 (2008), pp. 72–80.
[BXHR12]
Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao. “Tree-representation of set families
and applications to combinatorial decompositions.” Eur. J. Comb. 33.5 (2012), pp. 688–
711.
[CDEHV08b] Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès. “Notes
on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and
graphs.” Electronic Notes in Discrete Mathematics 31 (2008), pp. 231–234.
[CDEHVX12] Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang
Xiang. “Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic
Graphs.” Algorithmica 62.3-4 (2012), pp. 713–732.
[CFIKP08]
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. “Labelguided graph exploration by a finite automaton.” ACM Transactions on Algorithms 4.4
(2008).
[CFIKP09]
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg. “Labeling
Schemes for Tree Representation.” Algorithmica 53.1 (2009), pp. 1–15.
[CHLMRR08] Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien Montgolfier,
Mathieu Raffinot, Michaël Rao. “A note on computing set overlap classes.” Inf.
Process. Lett. 108.4 (2008), pp. 186–191.
[CHLRR12]
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics.
“Polynomial-time recognition of clique-width ≤ 3 graphs.” Discrete Applied Mathematics 160.6 (2012), pp. 834–865.
[CHS09]
Ricardo Corrêa, Frédéric Havet, Jean-Sébastien Sereni. “About a Brooks-type theorem for
improper colouring”. Australas. J. Combin. 43 (2009), pp. 219–230.
[CJKPT08] Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé.
“Finding a vector orthogonal to roughly half a collection of vectors.” J. Complexity 24.1
(2008), pp. 39–53.
[CMR08]
Pierre Charbit, Fabien Montgolfier, Mathieu Raffinot. “A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs.” SIAM J. Discrete Math. to appear (2008).
96
[CMR11]
Julien Clément, Stéphane Messika, Brigitte Rozoy. “Observer des algorithmes autostabilisants. Vers une évaluation du coût”. Technique et Science Informatiques 30.1 (2011),
pp. 35–57.
[CMR12]
Pierre Charbit, Fabien Montgolfier, Mathieu Raffinot. “Linear Time Split Decomposition
Revisited”. SIAM Journal on Discrete Mathematics 26.2 (2012), pp. 499–514. DOI: 10.1
137/10080052X. URL: http://link.aip.org/link/?SJD/26/499/1.
[CS07]
Pierre Charbit, Alex D. Scott. “Infinite Locally Random Graphs.” Internet Mathematics
3.3 (2007), pp. 321–331.
[CS08]
Pierre Charbit, Andràs Sebö. “Cyclic orders: Equivalence and duality.” Combinatorica
28.2 (2008), pp. 131–143.
[CS11a]
Pierre Charbit, Jean-Sébastien Sereni. “The fractional chromatic number of Zykov products of graphs.” Appl. Math. Lett. 24.4 (2011), pp. 432–437.
[CS11b]
David Coudert, Jean-Sébastien Sereni. “Characterization of graphs and digraphs with
small process numbers.” Discrete Applied Mathematics 159.11 (2011), pp. 1094–1109.
[CT07]
Pierre Charbit, Stéphan Thomassé. “Graphs with Large Girth Not Embeddable in the
Sphere.” Combinatorics, Probability & Computing 16.6 (2007), pp. 829–832.
[CTY07]
Pierre Charbit, Stéphan Thomassé, Anders Yeo. “The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.” Combinatorics, Probability & Computing 16.1 (2007),
pp. 1–4.
[DGDF10b] Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier. “Stabilizing leader
election in partial synchronous systems with crash failures.” J. Parallel Distrib. Comput.
70.1 (2010), pp. 45–58.
[DGF11]
Carole Delporte-Gallet, Hugues Fauconnier. “Objets partagés et détecteurs
défaillances.” Technique et Science Informatiques 30.7 (2011), pp. 841–871.
de
[DGFG10]
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. “Tight failure detection
bounds on atomic object implementations.” J. ACM 57.4 (2010).
[DGFGP07] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon. “The
perfectly synchronized round-based model of distributed computing.” Inf. Comput. 205.5
(2007), pp. 783–815.
[DGFGT11] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. “The
disagreement power of an adversary.” Distributed Computing 24.3-4 (2011), pp. 137–147.
[DGFT11]
Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. “The minimum information
about failures for solving non-local tasks in message-passing systems.” Distributed Computing 24.5 (2011), pp. 255–269.
[DGHS07]
Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter. “On
transitive orientations with restricted covering graphs.” Inf. Process. Lett. 101.3 (2007),
pp. 119–125.
[DH11]
Arnaud Durand, Michel Habib. “Complexity issues for the sandwich homogeneous set
problem.” Discrete Applied Mathematics 159.7 (2011), pp. 574–580.
[DKKS10]
Zdenek Dvorak, Tomàs Kaiser, Daniel Kràl’, Jean-Sébastien Sereni. “A note on antisymmetric flows in graphs.” Eur. J. Comb. 31.1 (2010), pp. 320–324.
[DPT09]
Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon. “The Four-in-a-Tree Problem in
Triangle-Free Graphs”. Graphs and Combinatorics 25.4 (2009), pp. 489–502.
97
[EFKR10]
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. “On the additive constant of
the k-server Work Function Algorithm.” Inf. Process. Lett. 110.24 (2010), pp. 1120–1123.
[EFKR11]
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. “Online computation with advice.” Theor. Comput. Sci. 412.24 (2011), pp. 2642–2656.
[EK11]
Yuval Emek, Amos Korman. “New bounds for the controller problem.” Distributed Computing 24.3-4 (2011), pp. 177–186.
[FFN09]
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse. “Nondeterministic Graph Searching:
From Pathwidth to Treewidth.” Algorithmica 53.3 (2009), pp. 358–373.
[FGIP09]
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. “Distributed computing with advice: information sensitivity of graph coloring.” Distributed Computing 21.6
(2009), pp. 395–403.
[FGKLL09] Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker.
“Universal augmentation schemes for network navigability.” Theor. Comput. Sci. 410.2123 (2009), pp. 1970–1981.
[FIP08a]
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc. “Impact of memory size on graph exploration capability.” Discrete Applied Mathematics 156.12 (2008), pp. 2310–2319.
[FIP08b]
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc. “Tree exploration with advice.” Inf. Comput. 206.11 (2008), pp. 1276–1287.
[FIP10]
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc. “Communication algorithms with advice.” J. Comput. Syst. Sci. 76.3-4 (2010), pp. 222–232.
[FKL10]
Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar. “Local MST Computation with
Short Advice.” Theory Comput. Syst. 47.4 (2010), pp. 920–933.
[FLL10a]
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. “A Lower Bound for Network Navigability.” SIAM J. Discrete Math. 24.1 (2010), pp. 72–81.
[FLL10b]
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. “Recovering the long-range links in
augmented graphs.” Theor. Comput. Sci. 411.14-15 (2010), pp. 1613–1625.
[FN08]
Pierre Fraigniaud, Nicolas Nisse. “Monotony properties of connected visible graph searching.” Inf. Comput. 206.12 (2008), pp. 1383–1393.
[GMN10]
Bruno Gaume, Fabien Mathieu, Emmanuel Navarro. “Building Real-World Complex Networks by Wandering on Random Graphs”. Information - Interaction - Intelligence 10.1
(2010), pp. 73–91. URL: http://hal.inria.fr/hal-00668017.
[HKLP07]
Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul. “Can transitive orientation make sandwich problems easier?” Discrete Mathematics 307.16 (2007), pp. 2030–
2041.
[HKMS09]
Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni. “Circular choosability.” Journal of Graph Theory 61.4 (2009), pp. 241–270.
[HKS09]
Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni. “Improper coloring of unit disk
graphs.” Networks 54.3 (2009), pp. 150–164.
[HKSS08]
Jan Hladkỳ, Daniel Kràl, Jean-Sébastien Sereni, Michael Stiebitz. “List colorings with
measurable sets.” Journal of Graph Theory 59.3 (2008), pp. 229–238.
[HKSS10]
Frédéric Havet, Daniel Kràl’, Jean-Sébastien Sereni, Riste Skrekovski. “Facial colorings
using Hall’s Theorem.” Eur. J. Comb. 31.3 (2010), pp. 1001–1019.
[HL09]
Michel Habib, Vincent Limouzy. “On some simplicial elimination schemes for chordal
graphs.” Electronic Notes in Discrete Mathematics 32 (2009), pp. 125–132.
98
[HP10]
Michel Habib, Christophe Paul. “A survey of the algorithmic aspects of modular decomposition.” Computer Science Review 4.1 (2010), pp. 41–59.
[HRS12]
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni. “Griggs and Yeh’s Conjecture and
L(p, 1)-labelings.” SIAM J. Discrete Math. 26.1 (2012), pp. 145–168.
[HS09a]
Michel Habib, Juraj Stacho. “A Decomposition Theorem for Chordal Graphs and its Applications.” Electronic Notes in Discrete Mathematics 34 (2009), pp. 561–565.
[HS09b]
Michel Habib, Juraj Stacho. “Linear Algorithms for Chordal Graphs of Bounded Directed
Vertex Leafage.” Electronic Notes in Discrete Mathematics 32 (2009), pp. 99–108.
[HS12]
Michel Habib, Juraj Stacho. “Reduced clique graphs of chordal graphs.” Eur. J. Comb.
33.5 (2012), pp. 712–735.
[HSS08]
Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski. “3-Facial Coloring of Plane
Graphs.” SIAM J. Discrete Math. 22.1 (2008), pp. 231–247.
[KK07b]
Amos Korman, Shay Kutten. “Distributed verification of minimum spanning trees.” Distributed Computing 20.4 (2007), pp. 253–266.
[KK09]
Amos Korman, Shay Kutten. “A note on models for graph representations.” Theor. Comput. Sci. 410.14 (2009), pp. 1401–1412.
[KKMS09]
František Kardoš, Daniel Král’, Jozef Miškuf, Jean-Sébastien Sereni. “Fullerene graphs
have exponentially many perfect matchings”. J. Math. Chem. 46.2 (2009), pp. 443–447.
[KKP10]
Amos Korman, Shay Kutten, David Peleg. “Proof labeling schemes.” Distributed Computing 22.4 (2010), pp. 215–233.
[KKS10]
Frantisek Kardos, Daniel Kràl’, Jean-Sébastien Sereni. “The Last Fraction of a Fractional
Conjecture.” SIAM J. Discrete Math. 24.2 (2010), pp. 699–707.
[KKSS10]
Alexandr V. Kostochka, Daniel Kràl’, Jean-Sébastien Sereni, Michael Stiebitz. “Graphs
with bounded tree-width and large odd-girth are almost bipartite.” J. Comb. Theory, Ser. B
100.6 (2010), pp. 554–559.
[KMMS09]
Daniel Kràl, Edita Màcajovà, Jàn Mazàk, Jean-Sébastien Sereni. “Circular edge-colorings
of cubic graphs with girth six.” Electronic Notes in Discrete Mathematics 34 (2009),
pp. 525–529.
[KMMS10]
Daniel Kràl’, Edita Màcajovà, Jàn Mazàk, Jean-Sébastien Sereni. “Circular edgecolorings of cubic graphs with girth six.” J. Comb. Theory, Ser. B 100.4 (2010), pp. 351–
358.
[KMPRSS09] Daniel Kràl, Edita Màcajovà, Ondrej Pangràc, André Raspaud, Jean-Sébastien Sereni,
Martin Skoviera. “Projective, affine, and abelian colorings of cubic graphs.” Eur. J. Comb.
30.1 (2009), pp. 53–69.
[KMS08]
Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni. “Improper colouring of (random) unit
disk graphs.” Discrete Mathematics 308.8 (2008), pp. 1438–1454.
[KMS12]
Daniel Kràl’, Lukàs Mach, Jean-Sébastien Sereni. “A new lower bound based on Gromov’s
method of selecting heavily covered points.” Discrete and Computation Geometry (2012),
to appear.
[Kor07c]
Amos Korman. “General compact labeling schemes for dynamic trees.” Distributed Computing 20.3 (2007), pp. 179–193.
[Kor10]
Amos Korman. “Labeling schemes for vertex connectivity.” ACM Transactions on Algorithms 6.2 (2010).
99
[KP07b]
Amos Korman, David Peleg. “Labeling schemes for weighted dynamic trees.” Inf. Comput.
205.12 (2007), pp. 1721–1740.
[KP08a]
Amos Korman, David Peleg. “Compact separator decompositions in dynamic trees and
applications to labeling schemes.” Distributed Computing 21.2 (2008), pp. 141–161.
[KP08b]
Amos Korman, David Peleg. “Dynamic routing schemes for graphs with low local density.” ACM Transactions on Algorithms 4.4 (2008).
[KPR10]
Amos Korman, David Peleg, Yoav Rodeh. “Constructing Labeling Schemes through Universal Matrices.” Algorithmica 57.4 (2010), pp. 641–652.
[KPSŠ09]
Daniel Král’, Ondřej Pangrác, Jean-Sébastien Sereni, Riste Škrekovski. “Long cycles in
fullerene graphs”. J. Math. Chem. 45.4 (2009), pp. 1021–1031.
[KR08c]
Roman Kolpakov, Mathieu Raffinot. “New algorithms for text fingerprinting.” J. Discrete
Algorithms 6.2 (2008), pp. 243–255.
[KSS08]
Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski. “Total-Coloring of Plane
Graphs with Maximum Degree Nine.” SIAM J. Discrete Math. 22.4 (2008), pp. 1462–
1479.
[KSS09]
Daniel Kràl, Jean-Sébastien Sereni, Michael Stiebitz. “A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs.” SIAM J. Discrete Math. 23.3 (2009), pp. 1465–
1483.
[KSS11]
Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlı́k. “Every Plane Graph of Maximum
Degree 8 has an Edge-Face 9-Coloring.” SIAM J. Discrete Math. 25.2 (2011), pp. 514–
533.
[LLMT07]
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon. “Detecting induced subgraphs”. Electronic Notes in Discrete Mathematics 29 (2007), pp. 207–211.
[LLMT09]
Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon. “Detecting induced subgraphs”. Discrete Applied Mathematics 157.17 (2009), pp. 3540–3551.
[LMRT09]
Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon. “Coloring Artemis graphs”. Theor. Comput. Sci. 410.21-23 (2009), pp. 2234–2240.
[LPBSDHV08] Renaud Lambiotte, Christophe Prieur, Vincent Blondel, Zbigniew Smoreda, Cristobald Dekerchove, Etienne Huens, Paul Vandooren. “Geographical dispersal of mobile
communication networks”. Physica A: Statistical Mechanics and its Applications 387.21
(2008), pp. 5317–5325.
[LPS09]
Nicolas Lichiardopol, Attila Pò, Jean-Sébastien Sereni. “A Step toward the Bermond–
Thomassen Conjecture about Disjoint Cycles in Digraphs.” SIAM J. Discrete Math. 23.2
(2009), pp. 979–992.
[LSSY10]
Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu. “Equitable Coloring
of Sparse Planar Graphs.” SIAM J. Discrete Math. 24.4 (2010), pp. 1572–1583.
[LT10]
W. Liu, Nicolas Trotignon. “The k-in-a-tree problem for graphs of girth at least k”. Discrete
Applied Mathematics 158.15 (2010), pp. 1644–1649.
[MLH08]
Clémence Magnien, Matthieu Latapy, Michel Habib. “Fast computation of empirically
tight bounds for the diameter of massive graphs.” ACM Journal of Experimental Algorithmics 13 (2008).
[MPS08]
Tobias Müller, Attila Pò, Jean-Sébastien Sereni. “Lower bounding the boundary of a graph
in terms of its maximum or minimum degree.” Discrete Mathematics 308.24 (2008),
pp. 6581–6583.
100
[MPS11]
Tobias Müller, Attila Pò, Jean-Sébastien Sereni. “Graphs with Four Boundary Vertices.”
Electr. J. Comb. 18.1 (2011).
[MS09]
Tobias Müller, Jean-Sébastien Sereni. “Identifying and Locating-Dominating Codes in
(Random) Geometric Networks.” Combinatorics, Probability & Computing 18.6 (2009),
pp. 925–952.
[MTV08]
Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic. “Algorithms for Square-3PC(.,
.)-Free Berge Graphs”. SIAM J. Discrete Math. 22.1 (2008), pp. 51–71.
[NS08]
Serguei Norine, Jean-Sébastien Sereni. “Graphs with full rank 3-color matrix and few 3colorings.” J. Comb. Theory, Ser. B 98.5 (2008), pp. 1115–1116.
[PL11]
Pascal Pons, Matthieu Latapy. “Post-processing hierarchical community structures: Quality improvements and multi-scale view.” Theor. Comput. Sci. 412.8-10 (2011), pp. 892–
900.
[PSS09]
Christophe Prieur, Alina Stoica, Zbigniew Smoreda. “Extraction de réseaux égocentrés
dans un (très grand) réseau social”. Bull. de Méthodologie Sociol 101.January (2009),
pp. 5–28.
[RP11]
Stéphane Raux, Christophe Prieur. “Stabilité globale et diversité locale dans la dynamique
des commentaires de Flickr.” Technique et Science Informatiques 30.2 (2011), pp. 155–
180.
[RST09]
Damien Regnault, Nicolas Schabanel, Eric Thierry. “Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority.” Theor. Comput. Sci.
410.47-49 (2009), pp. 4844–4855.
[RST10]
Damien Regnault, Nicolas Schabanel, Eric Thierry. “On the analysis of ”simple” 2D stochastic cellular automata.” Discrete Mathematics & Theoretical Computer Science 12.2
(2010), pp. 263–294.
[Sch12a]
Nicolas Schabanel. “Randomness + Determinism = Progresses: Why random processes
could be favored by evolution”. Edition spéciale sur la conférence ”Chance at the heart of
the cell” de Progress in Biophysics and Moleculer Biology (2012). À paraı̂tre.
[Ser08]
Jean-Sébastien Sereni. “Randomly colouring graphs (a combinatorial view).” Computer
Science Review 2.2 (2008), pp. 63–95.
[SS11]
Jean-Sébastien Sereni, Matej Stehlı́k. “Edge-face coloring of plane graphs with maximum
degree nine.” Journal of Graph Theory 66.4 (2011), pp. 332–346.
[Tro08a]
Nicolas Trotignon. “Decomposing Berge graphs and detecting balanced skew partitions”.
J. Comb. Theory, Ser. B 98.1 (2008), pp. 173–225.
[TV10]
Nicolas Trotignon, Kristina Vuskovic. “A structure theorem for graphs with no cycle with
a unique chord and its consequences”. Journal of Graph Theory 63.1 (2010), pp. 31–67.
[TV11]
Nicolas Trotignon, Kristina Vuskovic. “On Roussel-Rubio-type lemmas and their consequences”. Discrete Mathematics 311.8-9 (2011), pp. 684–687.
C-INV : Conférences invitées
[Fra07a]
Pierre Fraigniaud. Informative Labeling Schemes. Exposé invité 15th European Symposium on Algorithms, ESA 2007, Eilat, Israel. 2007.
[Fra10a]
Pierre Fraigniaud. Informative Labeling Schemes. Exposé invité 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, Bordeaux, France. 2010.
101
[Fra10b]
Pierre Fraigniaud. Informative Labeling Schemes. Exposé invité 13th International Conference on Database Theory, ICDT 2010, Lausanne, Switzerland. 2010.
[Fra10c]
Pierre Fraigniaud. On distributed computational complexities: are you Volvo-driving or
NASCAR-obsessed? Exposé invité 29th ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland. 2010.
[Hab08a]
Michel Habib. Chordal graphs and minimal separators revisited. Exposé invité, Colloquium in honor to 60th Marty Golombic’s birthday, Haifa. 2008.
[Hab08b]
Michel Habib. Efficient computation of diameter and suboptimal algorithms on graphs.
Exposé invité session plénière commune Roadef – SMAI, Clermont-Ferrand. 2008.
[Hab09a]
Michel Habib. δ-hyperbolicity of graphs. Exposé invité, 9th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. 2009.
[Hab09c]
Michel Habib. Diameter and center computations in networks. Conférencier invité session
plénière, Cologne Twente Workshop, Paris. 2009.
[Hab11b]
Michel Habib. Revisiting graph searches. Exposé invité session plénière: International
Conference on Discrete Mathematics & Computer Science, DIMACOS 2011, Mohamadia Maroc. 2011.
[Hab12]
Michel Habib. On the power of graph searching. Exposé invité International Conference
on Integration of AI and OR Techniques in Constraint Programming for Combinatorial
Optimization Problems (CPAIOR 2012), Nantes. 2012.
[Sch07]
Nicolas Schabanel. Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study
of Asynchronous 2D Minority. Invited talk at Int. Workshop on foundations of Computer
Science: Combinatorial Algorithms and Discrete Structures (WFOCOS). Maresias Beach
Hotel, Brazi, June 2007.
[Sch08a]
Nicolas Schabanel. “Encuentra el infinito: Escher y la geometrı́a imposible”. Conférence
invitée à l’occasion de l’innauguration de l’attraction Encuentra el infinito au Museo interactivo Mirardo (MIM) de Santiago du Chili, Chili. Sept. 2008.
[Sch08b]
Nicolas Schabanel. “On stochastic cellular automata”. Conférence invitée pour le 60ème
anniversaire de Philippe Flajolet à l’École normale supérieure, Paris. Dec. 2008.
[Sch09c]
Nicolas Schabanel. Non-clairvoyant scheduling. Dagstuhl Event 09232 ”2nd Dynamo
Workshop: Dynamic Communication Networks”, organisé par Pierre Fraigniaud. Dagstuhl, Deutcschland, June 2009.
[Sch10c]
Nicolas Schabanel. “Open problem: Structural lower bounds for precedence constraints
in the Edmonds’ non-clairvoyant setting”. In: Proc. of Dagstuhl Seminars n◦ 10071. Feb.
2010, p. 2.
[Sch11e]
Nicolas Schabanel. Complex systems from a computer science point of view. Invited talk at
Int. Conf. Dynamics of Complex systems (Disco), Valparaı́so de Chile. Nov. 2011.
[Sch11f]
Nicolas Schabanel. On stochastic cellular Automata. Plenary invited talk at 17th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2011,
Santiago de Chile,Chile. Nov. 2011.
[Sch11g]
Nicolas Schabanel. Why evolution should make the random choice. Invited conference at
the Int. Conf. Chance at the Heart of the Cell, La Doua. Nov. 2011.
[Ser11]
Jean-Sébastien Sereni. Points fortement couverts, combinatoire et algèbres de drapeaux.
Conférence plénière. 2011.
102
C-ACTI : Communications avec actes de conférences internationales
Les publications [EFKR09a; EFKR09b] sont communes avec l’équipe ”Algorithmes et complexité”,
[CDGFS11a] avec l’équipe ”Modélisation et Vérification”.
[ABAST08]
Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé. “Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.” In: Algorithm Theory - SWAT
2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4,
2008, Proceedings. Vol. 5124. Lecture Notes in Computer Science. Springer, 2008, pp. 41–
52.
[ADGF08b] Mohssen Abboud, Carole Delporte-Gallet, Hugues Fauconnier. “Agreement and consistency without knowing the number of correct processes”. In: Conférence Internationale
sur les NOuvelles TEchnologies de la REpartition (Notere). Lyon, France, 2008.
[ADGFHW07] Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin,
Josef Widder. “Clock Synchronization in the Byzantine-Recovery Failure Model.” In:
Principles of Distributed Systems, 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings. Vol. 4878. Lecture Notes
in Computer Science. Springer, 2007, pp. 90–104.
[ADGFT09]
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg.
“Partial synchrony based on set timeliness.” In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada,
August 10-12, 2009. ACM, 2009, pp. 102–110.
[AF12]
Heger Arfaoui, Pierre Fraigniaud. “What can be computed without communications?” In:
19th International Colloquium on Structural Information and Communication Complexity
(SIROCCO). Springer, LNCS, 2012.
[BBCK10]
Joffroy Beauquier, Janna Burman, Julien Clément, Shay Kutten. “On utilizing speed in
networks of mobile agents”. In: PODC. ACM, 2010, pp. 305–314.
[BBPV10]
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. “Fast Prefix Search
in Little Space, with Applications.” In: Algorithms - ESA 2010, 18th Annual European
Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I. Vol. 6346. Lecture
Notes in Computer Science. Springer, 2010, pp. 427–438.
[BBR09]
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel. “New Encodings of Pseudo-Boolean
Constraints into CNF.” In: Theory and Applications of Satisfiability Testing - SAT 2009,
12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Vol. 5584. Lecture Notes in Computer Science. Springer, 2009, pp. 181–194.
[BBV10]
Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna. “Dynamic Z-Fast Tries.” In: String
Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los
Cabos, Mexico, October 11-13, 2010. Proceedings. Vol. 6393. Lecture Notes in Computer
Science. Springer, 2010, pp. 159–172.
[BCCKR11]
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie.
“Computing with Pavlovian Populations.” In: Principles of Distributed Systems - 15th
International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings. Vol. 7109. Lecture Notes in Computer Science. Springer, 2011, pp. 409–420.
[BCF09]
Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud. “Parsimonious flooding in dynamic graphs.” In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. ACM,
2009, pp. 260–269.
103
[Bel10a]
Djamal Belazzougui. “Succinct Dictionary Matching with No Slowdown.” In: Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June
21-23, 2010. Proceedings. Vol. 6129. Lecture Notes in Computer Science. Springer, 2010,
pp. 88–100.
[Bel10b]
Djamal Belazzougui. “Worst Case Efficient Single and Multiple String Matching in the
RAM Model.” In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010,
London, UK, July 26-28, 2010, Revised Selected Papers. Vol. 6460. Lecture Notes in Computer Science. Springer, 2010, pp. 90–102.
[BF09]
Hervé Baumann, Pierre Fraigniaud. “Sub-linear Universal Spatial Gossip Protocols.” In:
Structural Information and Communication Complexity, 16th International Colloquium,
SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers. Vol. 5869.
Lecture Notes in Computer Science. Springer, 2009, pp. 44–56.
[BFHV12]
Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, R. Verclos. “The Worst
Case Behavior of Randomized Gossip.” In: Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. Vol. 7287. Lecture Notes in Computer Science. Springer, 2012, pp. 330–345.
[BH10]
Yacine Boufkhad, Thomas Hugel. “Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold.” In: Theory and Applications of Satisfiability Testing - SAT
2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Vol. 6175. Lecture Notes in Computer Science. Springer, 2010, pp. 99–112.
[BM07]
Toufik Bennouas, Fabien Montgolfier. “Random web crawls.” In: Proceedings of the 16th
International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May
8-12, 2007. ACM, 2007, pp. 451–460.
[BMMPV08] Yacine Boufkhad, Fabien Mathieu, Fabien Montgolfier, Diego Perino, Laurent Viennot.
“Achievable catalog size in peer-to-peer video-on-demand systems.” In: Proceedings of
the 7th international conference on Peer-to-peer systems, IPTPS’08, Tampa, FL, USA,
February 25-26, 2008. USENIX, 2008, p. 4.
[BMMPV09a] Yacine Boufkhad,
Fabien Mathieu,
Fabien Montgolfier,
Diego Perino,
Laurent Viennot. “An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability.” In: 23rd IEEE International Symposium on Parallel and Distributed Processing,
IPDPS 2009, Rome, Italy, May 23-29, 2009. IEEE, 2009, pp. 1–10.
[BMMPV09b] Yacine Boufkhad,
Fabien Mathieu,
Fabien Montgolfier,
Diego Perino,
Laurent Viennot. “Fine Tuning of a Distributed VoD System.” In: Proceedings of
the 18th International Conference on Computer Communications and Networks, IEEE
ICCCN 2009, San Francisco, California, August 3-6, 2009. IEEE, 2009, pp. 1–7.
[BN11a]
Djamal Belazzougui, Gonzalo Navarro. “Alphabet-Independent Compressed Text Indexing.” In: Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken,
Germany, September 5-9, 2011. Proceedings. Vol. 6942. Lecture Notes in Computer
[BN11b]
Djamal Belazzougui, Gonzalo Navarro. “Improved Compressed Indexes for Full-Text Document Retrieval.” In: String Processing and Information Retrieval, 18th International
Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Vol. 7024. Lecture Notes in Computer Science. Springer, 2011, pp. 386–397.
104
[BR11]
Djamal Belazzougui, Mathieu Raffinot. “Approximate Regular Expression Matching with
Multi-strings.” In: String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Vol. 7024. Lecture
[BRS08]
Florent Becker, Eric Rémila, Nicolas Schabanel. “Time Optimal Self-assembly for 2D and
3D Shapes: The Case of Squares and Cubes.” In: DNA Computing, 14th International
Meeting on DNA Computing, DNA 14, Prague, Czech Republic, June 2-9, 2008. Revised
Selected Papers. Vol. 5347. Lecture Notes in Computer Science. Springer, 2008, pp. 144–
155.
[BXH08]
Binh-Minh Bui-Xuan, Michel Habib. “A Representation Theorem for Union-Difference
Families and Application.” In: LATIN 2008: Theoretical Informatics, 8th Latin American
Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings. Vol. 4957. Lecture Notes in
Computer Science. Springer, 2008, pp. 492–503.
[BXHLM07]
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien Montgolfier. “Unifying
Two Graph Decompositions with Modular Decomposition.” In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007,
Proceedings. Vol. 4835. Lecture Notes in Computer Science. Springer, 2007, pp. 52–64.
[CDEHV08a] Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès. “Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.”
In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park,
MD, USA, June 9-11, 2008. ACM, 2008, pp. 59–68.
[CDGFS11a] Julien Clément, Carole Delporte-Gallet, Hugues Fauconnier, Mihaela Sighireanu. “Guidelines for the Verification of Population Protocols.” In: 2011 International Conference on
Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24,
2011. IEEE Computer Society, 2011, pp. 215–224.
[CDTFP07]
Dominique Cardon, Hélène Delaunay-Téterel, Cédric Fluckiger, Christophe Prieur. “Sociological typology of personal blogs”. In: Proceedings of the Second International Conference on Weblogs and Social Media, ICWSM 2007. The AAAI Press, 2007, pp. 2–3.
[CFL08a]
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar. “Networks Become Navigable as Nodes Move and Forget.” In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings,
Part I: Tack A: Algorithms, Automata, Complexity, and Games. Vol. 5125. Lecture Notes
[CFL08b]
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar. “Opportunistic Spatial Gossip over Mobile Social Networks”. In: 1st ACM Workshop on Online Social Networks
(WOSN). 2008.
[CHKMNT12] Yannick Carlinet, The Dang Huynh, Bruno Kauffmann, Fabien Mathieu, Ludovic Noirie, Sébastien Tixeuil. “Four Months in DailyMotion: Dissecting User Video Requests”. In:
TRAC 2012 - 3rd International Workshop on TRaffic Analysis and Classification. Limassol,
Cyprus, Aug. 2012. URL: http://hal.inria.fr/hal-00692095.
[CHMNS09]
David Coudert, Florian. Huc, Dorian Mazauric, Nicolas Nisse, Jean-Sébastien. Sereni.
“Reconfiguration of the routing in WDM networks with two classes of services”. In: Proceedings of the 13th international conference on Optical Network Design and Modeling.
ONDM’09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 146–151.
105
[DGDF07]
Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier. “Robust Stabilizing Leader Election.” In: Stabilization, Safety, and Security of Distributed Systems, 9th International Symposium, SSS 2007, Paris, France, November 14-16, 2007, Proceedings. Vol. 4838.
[DGDF10a] Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier. “Approximation of Timeliness.” In: Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings.
Vol. 6366. Lecture Notes in Computer Science. Springer, 2010, pp. 435–451.
[DGDFL10] Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Mikel Larrea. “Algorithms for Extracting Timeliness Graphs.” In: Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June
pp. 127–141.
[DGDFPT08] Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam
Toueg. “With Finite Memory Consensus Is Easier Than Reliable Broadcast.” In: Principles
of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings. Vol. 5401. Lecture Notes in Computer Science. Springer, 2008, pp. 41–57.
[DGF09]
Carole Delporte-Gallet, Hugues Fauconnier. “Two Consensus Algorithms with Atomic
Registers and Failure Detector Omega.” In: Distributed Computing and Networking, 10th
International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009. Proceedings. Vol. 5408. Lecture Notes in Computer Science. Springer, 2009, pp. 251–262.
[DGFFPT07] Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling, Lucia Draque Penso,
Andreas Tielmann. “From Crash-Stop to Permanent Omission: Automatic Transformation
and Weakest Failure Detectors.” In: Distributed Computing, 21st International Symposium,
DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings. Vol. 4731. Lecture
[DGFG08]
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. “Sharing is harder than
agreeing.” In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of
Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. ACM, 2008,
pp. 85–94.
[DGFGK10] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec.
“Brief announcement: byzantine agreement with homonyms.” In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
Thira, Santorini, Greece, June 13-15, 2010. ACM, 2010, pp. 74–75.
[DGFGK11] Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov. “Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.” In: Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011.
[DGFGK12] Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov. “Wait-Freedom
with Advice.” In: Proceedings of the Thirty First Annual ACM Symposium on Principles
of Distributed Computing, PODC 2012, Madeira, Portugal, July 16-18, 2012. ACM, 2012.
[DGFGKRTT11] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The. “Byzantine agreement with homonyms.” In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing,
PODC 2011, San Jose, CA, USA, June 6-8, 2011. ACM, 2011, pp. 21–30.
106
[DGFGR07] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert. “Secretive
Birds: Privacy in Population Protocols.” In: Principles of Distributed Systems, 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 1720, 2007. Proceedings. Vol. 4878. Lecture Notes in Computer Science. Springer, 2007,
pp. 329–342.
[DGFGT08] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. “The
Weakest Failure Detector for Message Passing Set-Agreement.” In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 2224, 2008. Proceedings. Vol. 5218. Lecture Notes in Computer Science. Springer, 2008,
pp. 109–120.
[DGFGT09a] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann.
“The Disagreement Power of an Adversary.” In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings. Vol. 5805.
[DGFGT09b] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann.
“The disagreement power of an adversary: extended abstract.” In: Proceedings of the 28th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary,
Alberta, Canada, August 10-12, 2009. ACM, 2009, pp. 288–289.
[DGFT09a]
Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann. “Fault-Tolerant Consensus in Unknown and Anonymous Networks.” In: 29th IEEE International Conference on
Distributed Computing Systems (ICDCS 2009), 22-26 June 2009, Montreal, Québec, Canada. IEEE Computer Society, 2009, pp. 368–375.
[DGFT09b]
Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. “Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems.” In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September
pp. 358–359.
[DGFT09c]
Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. “The Minimum Information
about Failures for Solving Non-local Tasks in Message-Passing Systems.” In: Principles
of Distributed Systems, 13th International Conference, OPODIS 2009, Nı̂mes, France, December 15-18, 2009. Proceedings. Vol. 5923. Lecture Notes in Computer Science. Springer, 2009, pp. 115–128.
[DGFTFK09] Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann, Felix C. Freiling, Mahir Kilic. “Message-efficient omission-tolerant consensus with limited synchrony.” In:
23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009,
Rome, Italy, May 23-29, 2009. IEEE, 2009, pp. 1–8.
[DGFTT12a] Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The. “Byzantine Agreement
with Homonyms in Synchronous Systems.” In: Distributed Computing and Networking
- 13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012.
[DGFTT12b] Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The. “Homonyms with forgeable identifiers”. In: 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO). Springer, LNCS, 2012.
[DGPV08]
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot. “On the locality of distributed
sparse spanner construction.” In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August
18-21, 2008. ACM, 2008, pp. 273–282.
107
[DGPV09]
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot. “Local Computation of Nearly
Additive Spanners.” In: Distributed Computing, 23rd International Symposium, DISC
2009, Elche, Spain, September 23-25, 2009. Proceedings. Vol. 5805. Lecture Notes in
[EFKKP12]
Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg. “Notions of
Connectivity in Overlay Networks”. In: 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO). Springer, LNCS, 2012.
[EFKR09a]
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. “On the Additive Constant
of the k-Server Work Function Algorithm.” In: Approximation and Online Algorithms,
7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009.
Revised Papers. Vol. 5893. Lecture Notes in Computer Science. Springer, 2009, pp. 128–
134.
[EFKR09b]
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. “Online Computation with
Advice.” In: Automata, Languages and Programming, 36th International Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Vol. 5555. Lecture
[EK09a]
Yuval Emek, Amos Korman. “Brief announcement: new bounds for the controller problem.” In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. ACM, 2009,
pp. 340–341.
[EK09b]
Yuval Emek, Amos Korman. “New Bounds for the Controller Problem.” In: Distributed
Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25,
2009. Proceedings. Vol. 5805. Lecture Notes in Computer Science. Springer, 2009, pp. 22–
34.
[EK10]
Yuval Emek, Amos Korman. “Efficient threshold detection in a distributed environment:
extended abstract.” In: Proceedings of the 29th Annual ACM Symposium on Principles of
Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010. ACM, 2010,
pp. 183–191.
[EKS11]
Yuval Emek, Amos Korman, Yuval Shavitt. “Approximating the Statistics of various Properties in Randomly Weighted Graphs.” In: Proceedings of the Twenty-Second Annual
ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California,
USA, January 23-25, 2011. SIAM, 2011, pp. 1455–1467.
[FG08]
Pierre Fraigniaud, Cyril Gavoille. “Polylogarithmic network navigability using compact
metrics with small stretch.” In: SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008.
ACM, 2008, pp. 62–69.
[FG09]
Pierre Fraigniaud, George Giakkoupis. “The effect of power-law degrees on the navigability of small worlds: [extended abstract].” In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada,
August 10-12, 2009. ACM, 2009, pp. 240–249.
[FG10a]
Pierre Fraigniaud, George Giakkoupis. “On the bit communication complexity of randomized rumor spreading.” In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15,
2010. ACM, 2010, pp. 134–143.
108
[FG10b]
Pierre Fraigniaud, George Giakkoupis. “On the searchability of small-world networks with
arbitrary underlying structure.” In: Proceedings of the 42nd ACM Symposium on Theory
of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM, 2010,
pp. 389–398.
[FGIP07]
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc. “Distributed Computing
with Advice: Information Sensitivity of Graph Coloring.” In: Automata, Languages and
Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 913, 2007, Proceedings. Vol. 4596. Lecture Notes in Computer Science. Springer, 2007,
pp. 231–242.
[FGKLL07] Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker.
“Universal augmentation schemes for network navigability: overcoming the sqrt(n)barrier.” In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. ACM,
2007, pp. 1–7.
[FK09]
Pierre Fraigniaud, Amos Korman. “On randomized representations of graphs using short
labels.” In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ACM,
2009, pp. 131–137.
[FK10a]
Pierre Fraigniaud, Amos Korman. “An optimal ancestry scheme and small universal posets.” In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010,
Cambridge, Massachusetts, USA, 5-8 June 2010. ACM, 2010, pp. 611–620.
[FK10b]
Pierre Fraigniaud, Amos Korman. “Compact Ancestry Labeling Schemes for XML Trees.”
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. SIAM, 2010, pp. 458–
466.
[FKL07]
Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar. “Local MST computation with
short advice.” In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007.
ACM, 2007, pp. 154–160.
[FKLS12]
Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni. “Collaborative Search
on the Plane without Communication”. Proc. 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), to appear (2012).
[FKP11]
Pierre Fraigniaud, Amos Korman, David Peleg. “Local Distributed Decision.” In: IEEE
52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs,
CA, USA, October 22-25, 2011. IEEE, 2011, pp. 708–717.
[FLL08]
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. “Recovering the Long-Range Links
in Augmented Graphs.” In: Structural Information and Communication Complexity, 15th
International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20,
2008, Proceedings. Vol. 5058. Lecture Notes in Computer Science. Springer, 2008,
pp. 104–118.
[FLV08]
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot. “The Inframetric Model for the
Internet.” In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18
April 2008, Phoenix, AZ, USA. IEEE, 2008, pp. 1085–1093.
109
[FP08]
Pierre Fraigniaud, Andrzej Pelc. “Deterministic Rendezvous in Trees with Little Memory.”
In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France,
September 22-24, 2008. Proceedings. Vol. 5218. Lecture Notes in Computer Science.
Springer, 2008, pp. 242–256.
[FP10a]
Pierre Fraigniaud, Andrzej Pelc. “Delays induce an exponential memory gap for rendezvous in trees.” In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010. ACM,
2010, pp. 224–232.
[FP10b]
Pierre Fraigniaud, Hoang-Anh Phan. “Degree hunter: on the impact of balancing node
degrees in de Bruijn-based overlay networks.” In: 24th IEEE International Symposium
on Parallel and Distributed Processing, IPDPS 2010, Atlanta, Georgia, USA, 19-23 April
2010 - Workshop Proceedings. IEEE, 2010, pp. 1–8.
[FP10c]
Pierre Fraigniaud, Hoang-Anh Phan. “”Tree-Farms” for Tree-Based Multicast Schemes
in Peer-to-Peer Overlay Networks.” In: Proceedings of IEEE International Conference
on Communications, ICC 2010, Cape Town, South Africa, 23-27 May 2010. IEEE, 2010,
pp. 1–5.
[FP12]
Pierre Fraigniaud, Andrzej Pelc. “Decidability Classes for Mobile Agents Computing.” In:
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru,
April 16-20, 2012. Proceedings. Vol. 7256. Lecture Notes in Computer Science. Springer,
2012, pp. 362–374.
[Fra07b]
Pierre Fraigniaud. “Small Worlds as Navigable Augmented Networks: Model, Analysis,
and Validation.” In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat,
Israel, October 8-10, 2007, Proceedings. Vol. 4698. Lecture Notes in Computer Science.
Springer, 2007, pp. 2–11.
[FRT11]
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers. “Locality and Checkability in WaitFree Computing.” In: Distributed Computing - 25th International Symposium, DISC 2011,
Rome, Italy, September 20-22, 2011. Proceedings. Vol. 6950. Lecture Notes in Computer
[GGV10]
Cyril Gavoille, Quentin Godfroy, Laurent Viennot. “Multipath Spanners.” In: Structural
Information and Communication Complexity, 17th International Colloquium, SIROCCO
2010, Sirince, Turkey, June 7-11, 2010. Proceedings. Vol. 6058. Lecture Notes in Computer
[GGV11]
Cyril Gavoille, Quentin Godfroy, Laurent Viennot. “Node-Disjoint Multipath Spanners
and Their Relationship with Fault-Tolerant Spanners.” In: Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 1316, 2011. Proceedings. Vol. 7109. Lecture Notes in Computer Science. Springer, 2011,
pp. 143–158.
[GJVY07]
Christophe Guettier, Philippe Jacquet, Laurent Viennot, Jacques Yelloz. “Automatic Optimisation of Reliable Collaborative Services in OLSR Mobile Ad Hoc Networks”. In:
Proceedings of IEEE MILCOM: Military Commununications Conference. Orlando, 2007,
pp. 1–7.
[GLMMRV07] Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien Montgolfier, Julien Reynier,
Laurent Viennot. “Acyclic Preference Systems in P2P Networks.” In: Euro-Par 2007, Parallel Processing, 13th International Euro-Par Conference, Rennes, France, August 2831, 2007, Proceedings. Vol. 4641. Lecture Notes in Computer Science. Springer, 2007,
pp. 825–834.
110
[GMMR07]
Anh-Tuan Gai, Fabien Mathieu, Fabien Montgolfier, Julien Reynier. “Stratification in
P2P Networks: Application to BitTorrent.” In: 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), June 25-29, 2007, Toronto, Ontario, Canada.
IEEE Computer Society, 2007, p. 30.
[GS11]
George Giakkoupis, Nicolas Schabanel. “Optimal path search in small worlds: dimension
matters.” In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC
2011, San Jose, CA, USA, 6-8 June 2011. ACM, 2011, pp. 393–402.
[Hab09b]
Michel Habib. “Diameter and Center Computations in Networks.” In: Proceedings of the
8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009,
Paris, France, June 2-4 2009. 2009, pp. 257–258.
[HMM12]
Michel Habib, Antoine Mamcarz, Fabien Montgolfier. “Algorithms for Some H-Join Decompositions.” In: LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Vol. 7256. Lecture Notes in Computer Science. Springer, 2012, pp. 446–457.
[HMP10]
Nidhi Hegde, Fabien Mathieu, Diego Perino. “On Optimizing for Epidemic Live Streaming.” In: Proceedings of IEEE International Conference on Communications, ICC 2010,
Cape Town, South Africa, 23-27 May 2010. IEEE, 2010, pp. 1–5.
[HRS08]
Frédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni. “L(2, 1)-labelling of graphs.” In:
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM, 2008, pp. 621–
630.
[HS09c]
Michel Habib, Juraj Stacho. “Polynomial-Time Algorithm for the Leafage of Chordal
Graphs.” In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings. Vol. 5757. Lecture Notes in Computer
[HS11]
Michel Habib, Juraj Stacho. “Unique Perfect Phylogeny Is -Hard.” In: Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011.
[HT11]
Michel Habib, Thu-Hien To. “On a Conjecture about Compatibility of Multi-states Characters.” In: Algorithms in Bioinformatics - 11th International Workshop, WABI 2011,
Saarbrücken, Germany, September 5-7, 2011. Proceedings. Vol. 6833. Lecture Notes in
[JV09a]
Philippe Jacquet, Laurent Viennot. “Average Size of Unstretched Remote-Spanners”. In:
5th ACM Workshop on Analytic Algorithmics and Combinatorics (ANALCO). New York,
2009, pp. 23–33.
[JV09b]
Philippe Jacquet, Laurent Viennot. “Remote-spanners: What to know beyond neighbors.”
In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS
2009, Rome, Italy, May 23-29, 2009. IEEE, 2009, pp. 1–10.
[KK07a]
Amos Korman, Shay Kutten. “Controller and estimator for dynamic networks.” In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM, 2007, pp. 175–
184.
[KK07c]
Amos Korman, Shay Kutten. “Labeling Schemes with Queries.” In: Structural Information
and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings. Vol. 4474. Lecture Notes in Computer
111
[KKM11]
Amos Korman, Shay Kutten, Toshimitsu Masuzawa. “Fast and compact self stabilizing
verification, computation, and fault detection of an MST.” In: Proceedings of the 30th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose,
CA, USA, June 6-8, 2011. ACM, 2011, pp. 311–320.
[KKP11]
Liah Kor, Amos Korman, David Peleg. “Tight Bounds For Distributed MST Verification.” In: 28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany. Vol. 9. LIPIcs. Schloss Dagstuhl Leibniz-Zentrum fuer Informatik, 2011, pp. 69–80.
[Kor07d]
Amos Korman. “Labeling Schemes for Vertex Connectivity.” In: Automata, Languages
and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July
9-13, 2007, Proceedings. Vol. 4596. Lecture Notes in Computer Science. Springer, 2007,
pp. 102–109.
[Kor08]
Amos Korman. “Improved compact routing schemes for dynamic trees.” In: Proceedings
of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing,
PODC 2008, Toronto, Canada, August 18-21, 2008. ACM, 2008, pp. 185–194.
[Kor09]
Amos Korman. “Compact Routing Schemes for Dynamic Trees in the Fixed Port Model.”
In: Distributed Computing and Networking, 10th International Conference, ICDCN 2009,
Hyderabad, India, January 3-6, 2009. Proceedings. Vol. 5408. Lecture Notes in Computer
[KP07a]
Amos Korman, David Peleg. “Compact Separator Decompositions in Dynamic Trees and
Applications to Labeling Schemes.” In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings. Vol. 4731.
[KR08a]
Roman Kolpakov, Mathieu Raffinot. “Approximate Regular Expression Matching with
Multi-strings”. In: String Processing and Information Retrieval, 18th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2011. Proceedings. Ed. by A.
Amir, A.Turpin, and A. Moffat. Vol. 5280. Lecture Notes in Computer Science. Springer,
2008, pp. 15–26.
[KR08b]
Roman Kolpakov, Mathieu Raffinot. “Faster Text Fingerprinting.” In: String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne,
Australia, November 10-12, 2008. Proceedings. Vol. 5280. Lecture Notes in Computer
[KSV11]
Amos Korman, Jean-Sébastien Sereni, Laurent Viennot. “Toward more localized local algorithms: removing assumptions concerning global knowledge.” In: Proceedings of the
30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San
Jose, CA, USA, June 6-8, 2011. ACM, 2011, pp. 49–58.
[LMR07]
Vincent Limouzy, Fabien Montgolfier, Michaël Rao. “NLC-2 Graph Recognition and Isomorphism.” In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Vol. 4769. Lecture Notes in Computer Science. Springer, 2007, pp. 86–98.
[LS08]
Emmanuelle Lebhar, Nicolas Schabanel. “Graph Augmentation via Metric Embedding.”
In: Principles of Distributed Systems, 12th International Conference, OPODIS 2008,
Luxor, Egypt, December 15-18, 2008. Proceedings. Vol. 5401. Lecture Notes in Computer
112
[Mat10b]
Fabien Mathieu. “Heterogeneity in data-driven live streaming: Blessing or curse?” In: 24th
IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010, Atlanta, Georgia, USA, 19-23 April 2010 - Workshop Proceedings. IEEE, 2010, pp. 1–8.
[Mat11]
Fabien Mathieu. “Live seeding: Performance bounds of seeders for P2P live streaming.”
In: 2011 IEEE International Conference on Peer-to-Peer Computing, P2P 2011, Kyoto,
Japan, August 31 - September 2, 2011. IEEE, 2011, pp. 172–181.
[MFT10]
Raphael Machado, Celina M. Herrera Figueiredo, Nicolas Trotignon. “Chromatic Index of
Chordless Graphs”. In: CTW. Ed. by Ulrich Faigle, Rainer Schrader, and Daniel Herrmann.
2010, pp. 51–54.
[MP10b]
Fabien Mathieu, Diego Perino. “On resource aware algorithms in epidemic live streaming”. In: ITC 2010 - 22nd International Teletraffic Congress. Amsterdam, Netherlands:
IEEE, 2010, pp. 1 –8. URL: http://hal.inria.fr/hal-00668321.
[MSV11a]
Fabien Montgolfier, Mauricio Soto, Laurent Viennot. “Asymptotic Modularity of Some
Graph Classes.” In: Algorithms and Computation - 22nd International Symposium, ISAAC
2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Vol. 7074. Lecture Notes in
[MSV11c]
Fabien Montgolfier, Mauricio Soto, Laurent Viennot. “Treewidth and Hyperbolicity of the
Internet.” In: Proceedings of The Tenth IEEE International Symposium on Networking
Computing and Applications, NCA 2011, August 25-27, 2011, Cambridge, Massachusetts,
USA. IEEE Computer Society, 2011, pp. 25–32.
[MV10]
Fabien Mathieu, Laurent Viennot. “Local Aspects of the Global Ranking of Web Pages.”
In: 10th International Conference on Innovative Internet Community Services (ICS), Jubilee Edition 2010, June 3-5, 2010, Bangkok, Thailand. Vol. 165. LNI. GI, 2010, pp. 493–
506.
[PPBCP08] Christophe Prieur, Nicolas Pissard, Jean-Samuel Beuscart, Dominique Cardon, Pascal
Pons. “Thematic and Social Indicators for Flickr Groups.” In: Proceedings of the Second
International Conference on Weblogs and Social Media, ICWSM 2008, Seattle, Washington, USA, March 30 - April 2, 2008. The AAAI Press, 2008.
[PRS10]
Kirk Pruhs, Julien Robert, Nicolas Schabanel. “Minimizing Maximum Flowtime of Jobs
with Arbitrary Parallelizability.” In: Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers.
[Raf11]
Mathieu Raffinot. “Consecutive Ones Property Testing: Cut or Swap.” In: Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings. Vol. 6735. Lecture Notes in Computer Science.
Springer, 2011, pp. 239–249.
[RGP11]
Stéphane Raux, Nils Grünwald, Christophe Prieur. “Describing the Web in less than 140
Characters.” In: Proceedings of the Fifth International Conference on Weblogs and Social
Media, Barcelona, Catalonia, Spain, July 17-21, 2011. The AAAI Press, 2011.
[RS08]
Julien Robert, Nicolas Schabanel. “Non-clairvoyant scheduling with precedence
constraints.” In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM,
2008, pp. 491–500.
113
[RST08]
Damien Regnault, Nicolas Schabanel, Eric Thierry. “On the Analysis of ”Simple” 2D Stochastic Cellular Automata.” In: Language and Automata Theory and Applications, Second
International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Vol. 5196. Lecture Notes in Computer Science. Springer, 2008, pp. 452–463.
[SCB10]
Alina Stoica, Thomas Couronne, J.S. Beuscart. “To be a star is not only metaphoric: from
popularity to social linkage”. In: ICWSM. 2010, pp. 154–161.
[Sch11c]
Nicolas Schabanel. “Analyzing Search Algorithms in Small Worlds”. In: Proc. of International Workshop TERANET: Toward Evolutive Routing Algorithms for scale-free/internetlike NETworks (colocated with DISC 2011). Roma, Italy, Sept. 2011, 4 pages.
[SHKKNPPW11] Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer. “Distributed verification and
hardness of distributed approximation.” In: Proceedings of the 43rd ACM Symposium
on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. ACM, 2011,
pp. 363–372.
[SP09a]
Alina Stoica, Christophe Prieur. “Structure of Neighborhoods in a Large Social Network.”
In: Proceedings IEEE CSE’09, 12th IEEE International Conference on Computational
Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada. IEEE Computer
Society, 2009, pp. 26–33.
[SP09b]
Alina Stoica, Christophe Prieur. “Structure of neighborhoods in a large social network”.
In: Proceedings of the 2009 IEEE International Conference on Social Computing (SocialCom). IEEE Computer Society, 2009.
[TCHP08]
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul. “Simpler Linear-Time
Modular Decomposition Via Recursive Factorizing Permutations.” In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity,
and Games. Vol. 5125. Lecture Notes in Computer Science. Springer, 2008, pp. 634–645.
[TH09]
Thu-Hien To, Michel Habib. “Level-k Phylogenetic Networks Are Constructable from a
Dense Triplet Set in Polynomial Time.” In: Combinatorial Pattern Matching, 20th Annual
Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings. Vol. 5577. Lecture
[TLP09]
Fabien Tarissan, Matthieu Latapy, Christophe Prieur. “Efficient Measurement of Complex
Networks Using Link Queries”. In: IEEE International Workshop on Network Science For
Communication Networks (NetSciCom’09), 2009.
C-ACTN : Communications avec actes de conférences nationales
La publication [CDGFS11b] est commune avec l’équipe ”Modélisation et Vérification”.
[ADGF07]
Mohssen Abboud, Carole Delporte-Gallet, Hugues Fauconnier. “Rśeaux de capteurs avec
détecteurs de collision”. In: Journées Doctorales en informatique et réseaux (CDUR).
Marne la Vallée, France, 2007.
[ADGF08a] Mohssen Abboud, Carole Delporte-Gallet, Hugues Fauconnier. “Accord sans connaı̂tre
tout le monde un pas vers la dynamicité”. In: Journées Francophones sur la Cohérence
des Données en Univers Réparti (CDUR). Lyon, France, 2008.
[CDGFS11b] Julien Clément, Carole Delporte-Gallet, Hugues Fauconnier, Mihaela Sighireanu.
“Mode d’emploi pour la vérification des protocoles de population”. In: 13èmes Rencontres
Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel). Ed. by
Pascal Ducourthial Bertrand et Felber. Cap Estérel, France, 2011.
114
[DGDF08]
Carole Delporte-Gallet, Stéphane Desvimes, Hugues Fauconnier. “Election Robuste,
Auto-Stabilisante et Efficace”. In: 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications. Saint-Malo, France, May 2008.
[DGDFPT09] Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam
Toueg. “Quand le consensus est plus simple que la diffusion fiable”. In: 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications(AlgoTel).
Ed. by Augustin Chaintreau and Clemence Magnien. Carry Le Rouet, France, 2009.
[DGFGKRTT12] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The. “Byzantine Agreement with Homonyms (Accord
Byzantin avec des Homonymes)”. In: 14èmes Rencontres Francophones sur les Aspects
Algorithmiques de Télécommunications (AlgoTel). La Grande Motte, France, 2012.
[DGFGT10] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. “La
puissance de désaccord d’un adversaire”. In: 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel). Maria Gradinariu Potop-Butucaru
et Hervé Rivano. Belle Dune, France, 2010.
[JV07]
Philippe Jacquet, Laurent Viennot. “Bi-connexité, k-connexité et multipoints relais”. In:
ALGOTEL. Oléron, 2007, pp. 1–4.
[Mat10c]
Fabien Mathieu. “P2P Live Seeding: Efficiency of Seeders in P2P Live Streaming”. In:
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications
(AlgoTel). Ed. by Maria Gradinariu Potop-Butucaru and Hervé Rivano. Belle Dune,
France, 2010. URL: http://hal.inria.fr/inria-00477363.
[MSV11b]
Fabien Montgolfier, Mauricio Soto, Laurent Viennot. “Clustering de métrique et clustering de graphe”. In: 13es Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications (ALGOTEL). Cap Estérel, 2011, pp. 1–4.
[Sch09b]
Nicolas Schabanel. Les systèmes complexes : réflexions personnelles d’un informaticien.
3ème Colloque national du CNRS ”Vers une science et une ingénérie des systèmes complexes”. Paris, France, Nov. 2009.
C-COM : Communications orales sans actes en conférences internationales ou nationales
[Fra08]
Pierre Fraigniaud. Tight bounds on the efficiency of greedy navigation in social small
worlds. 2nd International Conference on Network Control and Optimization, NET-COOP
2008, Paris, France. 2008.
[Fra10d]
worlds. Institute of Mathematical Statistics Annual Meeting, IMS 2010, Gothenburg, Sweden. 2010.
[Fra10e]
worlds. SIAM Conference on Discrete Mathematics, SIAM DM 2010, Austin, Texas,
Etats-Unis. 2010.
[Hab08c]
Michel Habib. Robust algorithms on graphs. Exposé invité à l’occasion du 75 ème anniversaire de Jack Edmonds, IHP Paris. 2008.
[Hab11a]
Michel Habib. Algorithms for some H-join decomposition of graphs. Exposé invité GTCO
2011 - Workshop on Graph Theory and Combinatorial Optimization, Shanghai China.
2011.
[Kor07a]
Amis Korman. 2nd Workshop on Locality Preserving Distributed Computing Methods
(LOCALITY). 2007.
115
[Kor07b]
Amis Korman. Seven open questions about detecting induced subgraphs. 7th Haifa Workshop on Interdisciplinary Applications , Haifa, Israël. 2007.
[Sch09a]
Nicolas Schabanel. Les systèmes complexes : réflexions personnelles d’un informaticien.
Colloque national du CNRS (SISC 2009), Paris, France. 2009.
[Sch09d]
Nicolas Schabanel. Non-clairvoyant scheduling. Dagstuhl Event 09232 ”2nd Dynamo
Workshop: Dynamic Communication Networks”, Dagstuhl, Deutschland. 2009.
[Sch10a]
Nicolas Schabanel. Escher et la spirale impossible. Conférence (45 min) grand public dans
le cadre des journées ”Tourbillons, spirales et labyrinthes”. Université Paris Diderot, May
2010.
[Sch10b]
Nicolas Schabanel. Non-clairvoyant with precedence constraints: Towards a measure of
the worst case degree of parallelism within a precedence constraints DAG structure. Dagstuhl Seminar n◦ 10071 ”Scheduling”, Dagstuhl, Deutschland. 2010.
[Sch11d]
Nicolas Schabanel. Analyzing Search Algorithms in Small Worlds. International Workshop
”Toward Evolutive Routing Algorithms for scale-free/internet-like NETworks” (TERANET 2011, colocated with DISC 2011), Roma, Italy. 2011.
[Sch12b]
Nicolas Schabanel. Relations entre complexité, hasard et désordre : le regard informatique.
Conférence (45 min) grand public dans le cadre des journées ”Complexité/désordre”. Université Paris Diderot, June 2012.
[Ser10a]
Jean-Sébastien Sereni. The last fraction of a fractional conjecture and open problems. Invité au Mini-Symposium sur la coloration de graphes. 2010.
[Ser10b]
Jean-Sébastien Sereni. Tight bounds on the efficiency of greedy navigation in social small
worlds. SIAM Conference on Discrete Mathematics, SIAM DM 2010, Austin, Texas,
Etats-Unis. 2010.
[Tro08b]
Nicolas Trotignon. On graphs that do not contain a cycle with a unique chord. Spring Southeast Sectional Meeting of the AMS,Session on Structural Graph Theory, Baton-Rouge,
USA. 2008.
[Tro09a]
Nicolas Trotignon. Berge graphs with no balanced skew partition and no homogeneous
pair. Workshop on Graph Colouring and Structure, Princeton, USA. 2009.
[Tro09b]
Nicolas Trotignon. Even pairs in Berge graphs. 75ème anniversaire de Jack Edmonds,
Paris, France. 2009.
[Tro09c]
Nicolas Trotignon. The k-in-a- tree problem for graphs of girth at least k. Workshop on
Graphs and Algorithms, Bertinoro, Italie. 2009.
[Tro10a]
Nicolas Trotignon. Excluding subdivisions of a bull. Workshop on Graph Colouring, Haifa,
Israël, aôut 2010. 2010.
[Tro10b]
Nicolas Trotignon. Perfect graphs : many old things and several new things. Centenaire de
Celina de Figueiredo et Frédéric Maffray, Grenoble, France, 2010.
[Tro10c]
Nicolas Trotignon. Seven open questions about detecting induced subgraphs. 2nd Workshop on Graph Decompositions,Theoretical, Algorithmic and Logical Aspects, Luminy,
France. 2010.
Participation sur invitation à des rencontres scientifiques :
Czech-French-Slovene workshop on Graph Colouring, Puyloubier, France. Automnes/Hivers 2008,
2009 et 2010 (Jean-Sébastien Sereni).
Workshop on Sublinear Algorithms, Bertinoro, Italy. May 22-27, 2011 (Pierre Fraigniaud).
116
Research Meeting and School on Distributed Computing by Mobile Robots (MAC), Ottawa, Canada. August 15-18, 2010 (Pierre Fraigniaud).
3rd Workshop on Graph Searching, Theory and Applications, Valtice, Czech Republic. October 59, 2009 (Pierre Fraigniaud).
1st Workshop on New Challenges in Distributed Systems, Valparaı́so, Chile. April 6-9, 2009 (Pierre
Fraigniaud).
Workshop on Lower Bounds for Distributed Computing, Banff, Canada. January 25-30, 2009
(Pierre Fraigniaud).
2nd Workshop on Graph searching, theory and applications, Praia da Redonda, Ceara, Brazil. February 25-28, 2008 (Pierre Fraigniaud).
Dagstuhl 2009, Seminar on Non-clairvoyant scheduling, June 1-5, 2009 (Nicolas Schabanel).
Dagstuhl 2010, Seminar onNon-clairvoyant with precedence constraints : Towards a measure of the
worst case degree of parallelism within a precedence constraints DAG structure, February 14-19,
2010 (Nicolas Schabanel).
Dagstuhl 2011, Seminar on Packing and Scheduling Algorithms for Information and Communication
Services, February 27-March 3, 2011 (Nicolas Schabanel).
Dagstuhl 2012, Seminar on Applications of Combinatorial Topology to Computer Science, February
18-23, 2012 (Carole Delporte, Hugues Fauconnier et Pierre Fraigniaud).
DO : Directions d’ouvrages ou de revues
[FFKT11]
Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos. “Special Issue on ”Theory and Applications of Graph Searching Problems”.” Theor. Comput. Sci.
412.24 (2011), p. 2699.
[FFT08]
Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos. “Forewords: Special issue on
graph searching.” Theor. Comput. Sci. 399.3 (2008), p. 157.
[Fra07c]
Pierre Fraigniaud. “Special Issue DISC 2005.” Distributed Computing 20.3 (2007), p. 163.
[GF11]
Cyril Gavoille, Pierre Fraigniaud, eds. Proceedings of the 30th Annual ACM Symposium
on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011.
ACM, 2011.
[PH10]
Christophe Paul, Michel Habib, eds. Graph-Theoretic Concepts in Computer Science, 35th
International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers.
2010.
OS : Ouvrages scientifiques
[Mat10a]
Fabien Mathieu. “Acyclic Preference-Based Systems”. In: Handbook of Peer-to-Peer Networking. Ed. by Xuemin Shen, Heather Yu, John Buford, and Mursalin Akon. Springer
US, 2010, pp. 1165–1203. URL: http://hal.inria.fr/hal-00667351.
[MP10a]
Fabien Mathieu, Diego Perino. “Diffusion épidémique pour du contenu live”. In: Evolution
des technologies pair-à-pair, optimination, sécurité et application. Ed. by Bertrand Mathieu and Mikaêl Salaün. HERMÈS / LAVOISIER, Oct. 2010, pp. 97–132. URL: http:
//hal.inria.fr/hal-00668019.
[PM10]
Diego Perino, Fabien Mathieu. “Epidemic Live Streaming”. In: Streaming Media Architectures, Techniques, and Applications: Recent Advances. Ed. by Ce Zhu, Yuenan Li, and Xiamu Niu. IGI Global, Sept. 2010, pp. 311–336. URL: http :
//hal.inria.fr/hal-00668018.
117
[Schut]
Nicolas Schabanel. Systèmes complexes & Algorithmes. Habilitation à diriger des recherches, Université Paris Diderot. soutenue le 26 février 2010.
PV : Publications de vulgarisation
[LS07]
Emmanuelle Lebhar, Nicolas Schabanel. “Routage dans les petits mondes”. )i( interstices
(2007). http://interstices.info/jcms/c 15920/routage-dans-les-petits-mondes.
[SP12]
Nicolas Schabanel, Pierre Pansu. “Couper, attendrir, trancher, réduire: un conte culinaire
sur la résolution informatique des problèmes difficiles”. L’explosition des mathématiques
(2012). À paraı̂tre, 6 pages.
[Vie08]
Laurent Viennot. “Les réseaux ont la fibre de l’information”. DocSciences 5 (2008),
pp. 34–39.
[Vie09]
Laurent Viennot. Idée reçue : Web et Internet, c’est la même chose. Interstices (French
vulgarization site). 2009. URL: http://interstices.info/jcms/c{\_}4275
5/web-et-internet-c-est-la-meme-chose.
AP : Autres productions
[CFLP11]
Dominique Cardon, Guilhem Fouetillou, Clémence Lerondeau, Christophe Prieur. “Esquisse de géographie de la blogosphère politique (2007-2009)”. In: continuerlalutte.com,
les partis politiques sur le web. Presses de Sciences Po, 2011, pp. 1–19.
[CP07]
Dominique Cardon, Christophe Prieur. “Les réseaux de relations sur Internet : un objet de
recherche pour l’informatique et les sciences sociales”. In: Humanités Numériques, vol. 1.
Ed. by Bernard Reber and Claire Brossaud. Hermès, 2007. Chap. 8.
[MP08]
Fabien Mathieu, Diego Perino. Utilisation d’un ensemble de clients privilégiés pour une
diffusion collaborative de contenu. Brevet N. 0851025. 2008.
[NR07]
G. Navarro, M. Raffinot. Flexible pattern matching in strings. Cambridge University Press
(traduction chinoise). Dec. 2007.
[PCPBP07] Christophe Prieur, Dominique Cardon, Pascal Pons, J.S. Beuscart, N. Pissard. The
strength of weak cooperation: A case study on Flickr. Tech. rep. arxiv, 2007. URL: http:
//arxiv.org/pdf/0802.2317.
[PS08]
Christophe Prieur, Giambattista Salinari. Social distances, or What lies beneath preferential attachment. Tech. rep. hal-univ-diderot.archives-ouvertes.fr, 2008, pp. 1–17.
[Sch10d]
Nicolas Schabanel. Preuve complète du théorème PCP. 10h d’enregistrement vidéo disponibles sur dailymotion.fr/NicolasSchabanel. June 2010.
[Sch11a]
Nicolas Schabanel. 12h d’enregistrement vidéo du Int. Workshop ”Expanders and Derandomization”. Disponible sur dailymotion.fr/NicolasSchabanel. Institut Henri Poincaré, Paris, France, Mar. 2011.
[Sch11b]
Nicolas Schabanel. 20h d’enregistrement vidéo du Int. Workshop ”Metric embeddings, algorithms and hardness of approximation”. Disponible sur dailymotion.fr/NicolasSchabanel. Institut Henri Poincaré, Paris, France, Jan. 2011.
[SSP12]
Alina Stoica, Zbigniew Smoreda, Christophe Prieur. “A local structure-based method for
nodes clustering . Application to a large mobile phone social network”. In: Social Network
Analysis and Mining. Ed. by Tansel Özyer. to appear. 2012.
[Tie09]
Andreas Tielmann. “A review of DISC 2009”. SIGACT News 40.4 (2009), pp. 75–79.
118
Chapitre 6
6.1
Composition et vie scientifique
Responsable : Carole Delporte-Gallet
Anciens responsables : Michel Habib (jusqu’au 31 décembre 2007), Pierre Fraigniaud (du 1er janvier
2008 jusqu’au 31 décembre 2009)
6.1.1
6.1.1.1
Liste actuelle des membres
Membres permanents (2012)
Tous les enseignants chercheurs sont en poste à l’université Paris Diderot.
Yacine Boufkhad
Pierre Charbit
Carole Delporte-Gallet
Hugues Fauconnier
Pierre Fraigniaud
Michel Habib
Amos Korman
Fabien de Montgolfier
Christophe Prieur
Mathieu Raffinot
Nicolas Schabanel
Jean-Sébastien Sereni
Laurent Viennot
6.1.1.2
Maı̂tre de conférence
Professeur
Directeur de recherche
Professeur
Chargé de recherche
CNRS
CNRS
CNRS
CNRS
CNRS
INRIA
Doctorants et post-doctorants (2012)
Doctorants :
Pierre Aboulker
Heger Arfaoui
Herve Baumann
Jérémie Dusart
Xavier Koegler
Antoine Mamcarz
Stéphane Raux
Hung Tran The
HdR
HdR
HdR
Doc d’Etat
Bourse ED
Bourse ED
Allocation Thématique
Bourse ED
ANM de l’ENS
Allocation CNRS
Thèse CIFRE
Financement ANR
119
(arrivée oct 2007)
(arrivé oct 2007)
(arrivé jan 2007)
(arrivé sept 2007)
HdR
HdR
HdR
(arrivé oct 2007)
(arrivé juil 2008)
(arrivé oct 2008)
CHAPITRE 6. ANNEXES : ALGORITHMES DISTRIBUÉS ET GRAPHES
Post-doctorant et ATER :
Abdelhamid Salah Brahim
Zelealem Yilma
6.1.1.3
Autres (2012)
Fabien Mathieu
Emmanuel Fuchs
6.1.2
6.1.2.1
Chercheur
1/2 PAST-THALES
contrat de déc 2010 à déc 2013
contrat de 2009-2012 et 2012-2015
Membres permanents (2007-2011)
CR CNRS
CR CNRS
HdR
départ sept 2009, professeur agrégé Lycée.
arrivé sept 2008, départ mars 2011, CR au LIP
Stagiaires M2
Amine Abdelkader
Heger Arfaoui
Hervé Baumann
Jean Daligault
Jeremy Dusart
Quentin Godefroy
Thomas Hujsa
Marc JeanMougin
Xavier Koegler
Vincent Liard
Damien Nogues
Stephane Raux
Théophile Trunk
6.1.2.3
INRIA
PARIS 7
Anciens membres
Emmanuelle Lebhar
Nicolas Trotignon
6.1.2.2
ATER
Post-doctorant
2009
2010 puis thèse au LIAFA
2007 puis thèse au LIRM
2009
2011 puis thèse au LIP6
2012
2007
2009
2010
Doctorants et post-doctorants (2007-2011)
Doctorants
Mohssen Abboud
Djamal Belazzougui
Anh Phan Hoang
Thomas Hugel
Vincent Limouzy
Diego Perino
Pascal Pons
Mauricio Soto
Alina Stoica
Andreas Tielmann
Thu-Hien To
oct 2005-nov 2008
oct 2009-oct 2011
jan 2007-oct 2010
sept 2006-déc 2010
sept 2005-déc 2008
nov 2006-nov 2009
oct 2004-juil 2007
sept 2007-sept 2011
oct 2007-oct 2010
(thèse CIFRE Orange Lab)
fév 2007-mai 2010
sept 2007-oct 2011
120
Enseignant-chercheur Syrie
Post-doc groupe Madalgo (Danemark)
IT Consulting Business (Paris)
Post Doc Polytech’Nice at I3S
MdC Clermont Ferrand
Chercheur à Bell Labs, Alcatel-Lucent.
Chercheur France Telecom
ATER (Orleans)
Chercheur EDF R&D
Post doc au LIRMM (Montpellier)
Post-doctorants et ATER
Fabien Baille
Eliya Burikkaya
ATER
1/2 ATER
départ sept 2007
sept 2009-août 2010
Julien Clément
Post-doc Ile de France
PEFICAMO
ATER
ATER
ATER
Post-doc ANR
ALADDIN et PROSE
Post Doc
nov 2009-mars 2011
ATER
Post-doc Fondation
Sciences Math de Paris
délégation CNRS
post-doc
post-doc
départ sept 2007
sept 2008- juil 2009
Christophe Crespelle
Stephane Devismes
Philippe Gauron
Georges Giakkoupis
Van Nguyen
Michaël Rao
Juraj Stacho
Ioan Todinca
Matěj Stehlı́k
Yilma Zelealem
6.1.2.4
départ sept 2007
départ sept 2007
jan 2007-dec 2007
Jan 2007-Déc 2007
jan 2009-août 2009
Post Doct
Télécom Bretagne
Analyste quantitatif
Sophis (Paris)
MdC au LIP
MdC VERIMAG
Ingénieur recherche LRI
CR INRIA Asap
Research assistant.
Univ. South Australia
CR2 au LIP
Post-doc à Warwick
Pr à l’univ. d’Orléans
MdC Gscop (Grenoble)
Visiteurs de longue durée (2007-2011)
Sam Toueg, Professeur à l’Université de Toronto, 6 mois de sabbatique (jan 2008-juin 2008).
6.1.2.5
Autres (2007-2011)
Richard Gwin, ingénieur sur contrat ANR en 2007
121
6.1.3
Visiteurs
Derek Corneil, University of Toronto, Canada
Pierluigi Crescenzi, University of Florence, Italy
Feodor Dragan, University of Kent, USA
Yuval Emek, Tel Aviv University
Eli Gafni, UCLA Los Angeles, USA
Jerrold Griggs, University of South Carolina at Columbia, USA
Rachid Guerraoui, EPFL, Suisse
Hovhannes Harutyunyan, Concordia University, Canada
Maurice Herlihy, University Brown, USA
Jan van den Heuvel, London School of Economics, UK
Roman Kolpakov, MGU, Moscou, Russie
MR Dan Král’, Charles University in Prague
and University of West Bohemia in Pilsen, Tchéquie.
Mikel Larrea, Université du Pays Basque, Espagne
Zvi Lotker, Ben Gurion University, Israel
Alessandro Panconesi, University Rome ”La Sapienza”, Italy
Andrzej Pelc, Université du Québec, Canada
David Peleg, Weizmann Institute, Israel
Sergio Rasjbaum, UNAM Mexico, Mexique
Juraj Stacho, Université de Toronto
Sam Toueg, Université de Toronto, Canada
6.1.4
18 mars-26 avril 2009
24 nov-23 déc 2008
sept-dec 2007
10-22 mars 2008 et
1-12 déc 2008
14 juin-15 juil 2010 et
14 juin 2011-20 juil 2011
11 mai-11 juin 2012
1-30 mars 2008
21-27 fév 2011 et
5-15 mars 2012
20 mai-18 juin 2012
1 avril-31 mai 2011
juin 2007 et juin 2009.
4 mois en 2011
2 -13 juil 2009
1-31 oct 2011.
1-28 février 2010
09-28 mai 2010.
26 oct-3 nov 2009.
14 juin-20 juil 2011
1- 30 sept 2010
20 mai-20 juin 2009
Vie de l’équipe
6.1.4.1
Financements et gestion des ressources
L’équipe a obtenu par différentes sources l’équivalent de 15 années de Post Doc, 34 mois de chercheurs
invités et 14 financements de thèses (dont 2 thèses CIFRE).
Bilateraux
Nationaux
2007
4Ke
133Ke
2008
2Ke
183Ke
2009
0
204Ke
2010
1,5Ke
320Ke
2011
9Ke
348,5Ke
2012
8Ke
286,5Ke
2013(déjà obtenu)
5,7Ke
191Ke
F IGURE 6.1 – Ressources gérées par le LIAFA incluant thèses et post doc sur contrat
6.1.4.2
Vie scientifique
Journées
– Journées à Barbizon (7 et 8 octobre 2010). Présentation des travaux des membres de l’équipe.
– Laurent Viennot réunit une journée tous les ans les membres de l’équipe Gang pour une
présentation de leurs résultats scientifiques.
Groupes de travail
– BQR ”Algorithmique distribuée quantique”, groupe de travail régulier en 2009-2010 organisé
par Carole Delporte et Hugues Fauconnier avec des membres de l’équipe et des physiciens de
122
l’université Paris Diderot. Ces travaux se sont conclus par un workshop de 4 jours ouvert à d’autres
informaticiens et physiciens.
– Groupe de travail autour de ”Un algorithme linéaire en temps O(n+m) publié par Elias Dahlhaus
en 2000 [J. Algorithms 36(2) : 205-240] ”, 2007-2009 organisé par Matthieu Raffinot
Les familles partitives se retrouvent naturellement dans la décomposition de graphes en arbres,
et notamment dans la décomposition en coupes, introduite par Cunningham en 1982, qui est une
généralisation de la décomposition modulaire. Un algorithme linéaire en temps O(n + m) a été
publié par Elias Dahlhaus en 2000 [J. Algorithms 36(2) : 205-240]. Cependant personne n’est
actuellement capable de certifier si cet algorithme est juste ou non, le papier étant très confus
et très mal écrit. Le référé principal du papier lui-même a, de son propre aveu, capitulé après
avoir tenté longtemps de le comprendre et a accepté le papier en l’état. M. Raffinot a proposé
début septembre 2007 un groupe de travail sur le sujet. Après deux ans passés sur le sujet avec ce
groupe assez régulier (mais qui a perdu des participants en route), nous avons :
– extrait, largement simplifié et de ce fait rendu utilisable en pratique (un code source est
disponible) une perle algorithmique utilisée comme sous-routine dans l’algorithme principal
pour calculer des classes de recouvrement d’ensembles. Ceci a donné lieu à une note en
revue [CHLMRR08].
– finalement réussi à construire un algorithme linéaire compréhensible pour la décomposition
en coupes qui emprunte certaines intuitions à Dalhlaus mais les complémente avec de nouvelles. Ces travaux ont récemment été accepté pour publication à SIAM Journal of Discrete
Mathematics [CMR12].
– Groupe de travail ” décorticage d’articles” proposé par Mathieu Raffinot depuis septembre 2011
– Enfin les projets ANR, sont l’occasion à des sous groupes de l’équipe de se réunir sur des
thématiques spécifiques.
Cours Jean-Sébastien Sereni et Nicolas Schabanel proposent régulièrement des séries de cours avancés
(cf section 6.4.3.3) ouverts à la communauté scientifique.
Séminaire L’équipe a un séminaire hebdomadaire qui a lieu les mardi après-midi. Il a été organisé par
Emmanuelle Lebhar, Nicolas Trotignon et Nicolas Schabanel. Il est depuis septembre 2011 organisé par
Pierre Charbit.
Intervenants 2012 (19-06-2012) Karell Bertet (Laboratoire L3i, Université de la Rochelle) (12-06-2012)
Irena Rusu (LINA - Université de Nantes) (05-06-2012) Mathieu jacomy (Medialab - Sciences Po) (2205-2012) Maurice Herlihy (Brown University - Computer Science Department) (15-05-2012) Bernard
Ries (LAMSADE - Université Dauphine) (10-04-2012) Pavol Hell (School of Computing Science Simon Fraser University), (03-04-2012) Antoine Mamcarz (LIAFA), 13-03-2012) Anthony Perez (LIFOUniversité d’Orélans), (06-03-2012) Jean Sebastien Sereni (LIAFA), (28-02-2012) Fabien de Montgolfier (LIAFA), (21-02-2012) Amos Korman (LIAFA), (14-02-2012) Jean-Charles Delvenne (Université
Catholique de Louvain), (31-01-2012) Pierluigi Crescenzi (University of Florence), (24-01-2012) Michel Habib (LIAFA).
Intervenants 2011
(13-12-2011) Eunjung Kim (Lamsade Paris), (29-11-2011) Abdelhamid Salah Brahim (LIAFA & LIP6),
(22-11-2011) Gerth S. Brodal (Aarhus University), (25-10-2011) Dimitrios Thilikos (University of
Athens), (18-10-2011) Zvi Lotker (Ben Gurion University of the Negev), (11-10-2011) Henning BruhnFujimoto (Equipe Combinatoire Paris 6), (04-10-2011) Jan Arne Telle (Univ. Bergen), (06-09-2011)Aharoni (Technion), (28-06-2011) Émilie Diot (LaBRI), (21-06-2011) Damien Stelhé (LIP, ENS Lyon),
17-05-2011) Mathilde Noual (LIP-IXXI, ENS Lyon), (10-05-2011) Nicolas Bousquet (LIRMM), (0305-2011) Florent Becker (LIFO (Orléans)), (19-04-2011) Kevin Perrot (LIP-IXXI, ENS Lyon), (15-032011) Dan Kral‘ (Charles University, Prague), (08-02-2011) Alexandre Skoda (Université Paris 1-CES),
123
(25-01-2011) Eric Colin de Verdière (GéCoaL, ENS Paris), (18-01-2011) Claire Mathieu (Brown University, Providence, USA), (04-01-2011) Thomas Sauerwald (Max-Planck-Institut für Informatik).
Intervenants 2010 (21-12-2010) Ryan Hayward (University of Alberta), (30-11-2010) Antoine Deza
(McMaster University, Hamilton, Ontario, Canada), (23-11-2010) Nicolas Schabanel (LIAFA), (1611-2010) Roberto Mantaci (LIAFA), (09-11-2010) Marko Radovanovic (Union University, Belgrade),
(02-11-2010) Guillaume Chapuy (LIAFA), (13-10-2010) Steven Chaplick (University of Toronto), (1210-2010) Pierluigi Crescenzi (University of Florence), (05-10-2010) Amos Korman (LIAFA), (28-092010) Juraj Stacho (LIAFA), (06-07-2010) Steve Chaplick (University of Toronto), (06-07-2010) Eli
Gafni (UCLA), (08-06-2010) Stéphane Bessy (LIRMM), (25-05-2010) Andrzej Pelc (Université du
Québec en Outaouais), (19-05-2010) Henning Bruhn-Fujimoto (Nihon University), (18-05-2010) Mauro
Sozio (Max-Planck-Institut für Informatik), (11-05-2010) András Sebŏ (G-SCOP, Grenoble), (04-052010) Jean-Sébastien Sereni (LIAFA), (27-04-2010) Xavier Buchwalder (30-03-2010) Stéphane Vialette
(Université Paris Est-Institut Garpard Monge), (23-03-2010) Guilhem Fouetillou (Linkfluence), (16-032010) Bernard Monjardet (CES, Université Paris 1) (09-03-2010) Djamal Bellazzougui (LIAFA) (0203-2010) David Ilcinkas (LABRI, Bordeaux) (26-02-2010) Alessandro Panconesi (Sapienza Universita,
Roma), (23-02-2010) Gena Hahn (16-02-2010) Corentin Travers (LIP6, INRIA), (09-02-2010) Arnaud
Labourel (LABRI, Bordeaux), (02-02-2010) Ioan Todinca (LIFO, Orléans), (26-01-2010) Selma Djelloul (LRI, Orsay), (26-01-2010) Jayme L Szwarcfiter (Universidade Federal do Rio de Janeiro, Brasil),
(19-01-2010) Adria Lyra (Universidade Federal Fluminense), (12-01-2010) Nicolas Trotignon (LIAFA),
(05-01-2010) Laurent Viennot (LIAFA).
Intervenants 2009
(15-12-2009) Maria Chudnovsky (Columbia University), (08-12-2009) Andreas Tielmann (LIAFA),
(30-11-2009) Celina de Figueiredo (Universidade Federal do Rio de Janeiro), (24-11-2009) Pierre
Charbit (LIAFA), (10-11-2009) Julien Clément (LIAFA), (03-11-2009) Martin Loebl (Dept. of Applied Math., Charles University, République Tchèque), (27-10-2009) Nicolas Lichiardopol (IUT Salon), (20-10-2009) Amos Korman (LIAFA), (13-10-2009) Jean-Sébastien Sereni (LIAFA), (29-09-2009)
Ross Kang (McGill University), (07-07-2009) Matĕj Stehlı́k (LIAFA), (07-07-2009) Jean-Sébastien Sereni (LIAFA), (30-06-2009) Kristina Vuskovic (University of Leeds), (16-06-2009) Roman Kolpakov
(Lomonosov Moscow State University, Moscou), (09-06-2009) Michael Rao (LABRI, Bordeaux), (0906-2009) Raphael Machado (Universidade Federal do Rio de Janeiro), (02-06-2009) Guyslain Naves
(G-SCOP, Grenoble), (05-05-2009) Omid Amini (DMA, ENS Paris), -(28-04-2009) P. Dorbec, P. Fraigniaud, M. Habib, V. Jost et F. Mercier (10-04-2009) Derek Corneil (University of Toronto), (31-032009) Benjamin Lévêque (LIF, Marseille), 17-03-2009) Kathie Cameron (LIP6, Paris) 03-03-2009)
Olivier Hudry (ENST,Paris) 24-02-2009) Guillaume Valadon (LIP6), (24-02-2009) Guanghui Wang
(Shandong University et Ecole Centrale Paris), 17-02-2009/2009-02-17 Frédéric Havet (Projet MASCOTTE, I3S (CNRS-UNSA)-INRIA), (03-02-2009) Cédric Bentz (LRI, Orsay), (27-01-2009) Matĕj
Stehlı́k (LIAFA), (20-01-2009) Juraj Stacho (LIAFA), (13-01-2009) Zsolt Tuza (Hungarian Academy
of Sciences and University of Pannonia, Hungary), (13-01-2009) Srecko Brlek (UQAM), (06-01-2009)
Jean-Sébastien Sereni (LIAFA).
Intervenants 2008
(16-12-2008) Christoph Dürr (LIX), (09-12-2008) David Auger (MIC2, Télécom Paris), (04-12-2008)
Dan Král’ (Charles Univeristy, Prague, Czech Republic), (02-12-2008) Cédric Bentz (LRI, Orsay), (0411-2008) Frédéric Meunier (LVMT, Ponts et Chaussées), (28-10-2008) Ha Duong Phan (LIAFA), (2110-2008) Andras Gyarfas (Hungarian Academy of Science), (16-10-2008) Matthias Bernt (University
of Leipzig), (30-09-2008) Bernard Kouakou (Centre d’Économie de la Sorbonne), (24-06-2008) Olivier
Bernardi (Département de Mathématiques-Orsay), (17-06-2008) Christophe Prieur (LIAFA), (10-062008) Vijaya Ramachandran (University of Texas (Austin, USA)), (13-05-2008) Frédéric Magniez (LRI-
124
Orsay), (06-05-2008) Frédérique Bassino (Institut Gaspard Monge, Univ. Paris Est) (06-05-2008) Tobias
Müller (Technische Universiteit Eindhoven) (29-04-2008) Mathieu Liedloff (LITA-Metz), (22-04-2008)
Pascal Ochem (LRI-Orsay), (17-04-2008) Sam Toueg (Toronto Univ (invité LIAFA)) (15-04-2008) Bertrand Estellon (LIF-Marseille), (08-04-2008) Eric Angel (LaMI, Université d’Evry) (01-04-2008) Orestis Telelis (Aarhus University, Denmark) (25-03-2008) Binh-Minh Bui-Xuan (LIRMM-Montpellier),
(18-03-2008) Nazim Fatès (LORIA), (18-03-2008) Mark Tedder (University of Toronto), (11-03-2008)
Jean-Sébastien Sereni (Institute for theoretical computer science, Charles Univ. (Prague, Rép. Tchèque))
(11-03-2008) Derek Corneil (University of Toronto), (04-03-2008) Michaël Rao (LIRMM-Montpellier),
(26-02-2008) Philippe Nadeau (Fakultät für Mathematik-Universität Wien), (19-02-2008) Steve Y. Oudot (Leonidas Guibas Laboratry, Standford University), (12-02-2008) Sandrine Vial (PRISM (CNRS
et Univ. Versailles)), (05-02-2008) Stéphane Le Roux (INRIA-Microsoft research), (29-01-2008) Eric
Tannier (INRIA Rhône-Alpes (projet Hélix) & Univ. Lyon I), (22-01-2008) Marie Albenque (LIAFA),
(08-01-2008) Philippe Robert (INRIA Rocquencourt (projet RAP)),
Intervenants 2007
(18-12-2007) Benjamin Levêque (G-SCOP (Grenoble)), (12-12-2007) Victor Chepoi (Laboratoire d’Informatique Fondamentale-Marseille) (21-11-2007) Laurent Gourvès (LAMSADE (Paris Dauphine)),
(30-10-2007) Jean-Loup Guillaume (LIP6), (23-10-2007) Thomas Fernique (LIRMM (Montpellier)),
(10-10-2007) Christophe Crespelle (LIAFA), (02-10-2007) Feodor Dragan (Kent State University (dept
of CS)), (10-07-2007) Nicolas Schabanel (CNRS, LIP (ENS Lyon) et CMM (Univ. de Chile)), (1007-2007) Vassilis Giakoumakis (LaRIA (Univ. Amiens)), (03-07-2007) Johann Makowsky (Technion
(Israël)), (03-07-2007) Dimitrios M. Thilikos (National and Capodistrian University of Athens), (26-062007) Etienne Grandjean (GREYC, U. Caen), (19-06-2007) Pascal Préa (LIF et Ecole Centrale (Marseille)), (12-06-2007) Gérard Cornuejols ( LIF (Marseille)), (05-06-2007) Philippe Nadeau (LIAFA),
(29-05-2007) Vassily Lyubetsky (Institute for information transmission problems of RAS (Moscou)),
(22-05-2007) Jérémie Chalopin (LaBRI (Bordeaux)), (16-05-2007)Tran Thi Thu Huong (Vietnam Institute of Mathematics (Hanoi)), (15-05-2007) Frédéric Meunier (INRIA Rocquencourt (projet Algo)),
(09-05-2007) Pierre Peterlongo (IRISA (Rennes)), (24-04-2007) Ioan Todinca (LIFO (en délégation
CNRS au LIAFA)), (03-04-2007) Sylvain Gravier (CNRS, lab. Leibniz, IMAG (Grenoble)), (27-032007) Frédéric Jouhet (Institut Camille Jordan (Univ. Lyon 1)), (20-03-2007)Van Nguyen (CNRS,
LIAFA), (14-03-2007) Paolo Boldi (University of Milano), (13-03-2007) Yann Vaxès (LIF (Marseille)),
(06-03-2007) Nicolas Thibault (IBISC (Evry)), (27-02-2007) Sylvain Perifel (LIP (ENS Lyon)), (2002-2007) Stefan de Wannemacker (UCD (Dublin)), (13-02-2007) Zvi Lotker (Communication Systems
dept, Ben Gurion University, Beer Sheva, ISRAEL), (05-02-2007) Stephan Thomasse (LIRMM (Montpellier)), (30-01-2007) Nicolas Trotignon (CERMSEM, U. Paris 1), (23-01-2007) Frédéric Havet (Projet
Mascotte, INRIA Sophia), (16-01-2007) Dieter Kratsch (LITA (Metz)), (09-01-2007) Stephane Vialette
(LRI).
6.1.4.3
Implication dans l’animation scientifique et les responsabilités administratives locales,
nationales et internationales
Yacine Boufkhad est directeur des études de 1ère année à l’IUT Paris Jussieu depuis 2007.
Pierre Charbit est responsable du Master 2 PISE (Projets Informatiques et Stratégie d’Entreprise). Ce
cursus s’adresse exclusivement aux étudiants en sciences humaines et sociales.
Carole Delporte est responsable du Master 2 Pro Ingénierie Informatique (depuis 2006), co-responsable
de la mention Master Informatique (depuis mai 2012) et directrice adjointe de l’UFR (depuis avril 2012).
Hugues Fauconnier est responsable du L3 de la Licence d’informatique (depuis 2006), responsable de
la mention Licence (depuis avril 2012) et membre élu au conseil d’administration de l’université.
125
Michel Habib a été directeur du LIAFA de janvier 2008 jusqu’au 31 décembre 2009. Pierre Fraigniaud
est depuis directeur du LIAFA.
A la demande d’Arnold Migus Directeur Général du CNRS, Michel Habib a été le premier directeur du
10eme institut du CNRS : l’Institut des Sciences Informatique et leurs Interactions (INS2I) (de septembre
2009 à Mars 2010).
Laurent Viennot est responsable de l’équipe-projet INRIA Gang.
Nicolas Schabanel est co-responsable du GT CoA (Complexité et Algorithmes) du GdR IM (depuis
2011).
Nicolas Schabanel est co-organisateur du trimestre mathématique et informatique ”Metric 2011” à l’Institut Henri Poincaré, janvier-mars 2011.
Jaroslav Nešetřil (CZ) et Jean-Sébastien Sereni (FR) sont responsables de STRUCO, laboratoire européen associé du CNRS qui regroupe le LIAFA (CNRS et Univ. Paris Diderot) et IUUK (Institut d’Informatique, Univ. Charles de Prague).
6.2
6.2.1
Contrats et projets scientifiques
Responsabilités de projets internationaux
Projet Germaine de Staël (2007-2008) Type de projet : Partenariat Hubert Curien. Titre détaillé :
Réseaux de capteurs. Partenaires : LIAFA et LPD (EPFL). Responsable : Hugues Fauconnier.
Montant de la collaboration (pour le LIAFA) : 4Ke.
Projet Procope (2006-2007) Type de projet : Partenariat Hubert Curien. Titre détaillé : Sécurité et Algorithmique Distribuée. Partenaires : LIAFA et Université de Mannheim. Responsable : Hugues
Fauconnier. Montant de la collaboration (pour le LIAFA) : 4Ke.
Projet Barrande 24444XD (2011-2013) Type de projet : Partenariat Hubert Curien. Titre détaillé : Approches algébriques de problèmes combinatoires — couplages parfaits, permanents et polynômes
hyperboliques. Partenaires : LIAFA, Dept. de Mathématiques de l’Univ. de Bohème de l’ouest
(Plzen) et Institut d’Informatique de l’Université Charles (Prague). Responsable : Jean-Sébastien
Sereni. Montant de la collaboration (pour le LIAFA) : 5,7Ke.
Projet Proteus 26818PC (2012-2014 ). Type de projet : Partenariat Hubert Curien. Titre détaillé :
Graphes pour la chimie combinatoire et les réseaux complexes Partenaires : LIAFA et Dept. de
Mathématiques, Univ. de Ljubljana. Responsable : Jean-Sébastien Sereni. Montant de la collaboration (pour le LIAFA) : 2Ke.
Projet Architectures multicoeurs et algorithmique distribuée (2011-2013) Type de projet : PICS bilatéral Franco-Suisse. Partenaires : LIAFA et LPD (EPFL). Responsable : Carole Delporte et
Hugues Fauconnier. Montant de la collaboration (pour le LIAFA) : 15 Ke.
COST 295-Dynamo (2004-2008) Type de projet : programme European COST (European Cooperation in the Field of Scientific and Technical Research) du domaine Telecommunications, Information Science and Technology domain (TIST). Responsable : Pierre Fraigniaud. co-Resp. Working
Group 1 (Small Worlds) : Nicolas Schabanel. Montant total de la collaboration : 150 Ke. Ce
projet n’est pas géré par le LIAFA.
6.2.2
Responsabilité de projets nationaux
Projet HEREDIA (2011-2015). Type de projet : ANR JC. Titre détaillé : Hereditary Classes of Graphs.
Partenaires : LIAFA (CNRS et Univ. Diderot). Responsable du projet : Jean-Sébastien Sereni.
126
Montant de la collaboration (pour le LIAFA) : 212Ke.
Projet ALADDIN (2007-2011). Type de projet : ANR Blanc. Titre détaillé : Algorithm Design and
Analysis for Implicitly and Incompletely Defined Interaction Networks. Partenaires : LIAFA
(CNRS et Univ. Diderot) et LaBRI (CNRS et Univ. Bordeaux). Responsable du projet : Pierre
Fraigniaud. Montant de la collaboration (pour le LIAFA) : 450Ke.
Projet GRAAL (2006-2009). Type de projet : ANR Blanc. Titre détaillé : Graph Decomposition and
Algolrithms. Partenaires : LIAFA (CNRS et Univ. Diderot), LaBRI (CNRS et Univ. Bordeaux)
and LIRMM( CNRS, Univ de Montpellier). Responsable du projet : Michel Habib. Montant de la
collaboration (pour le LIAFA) : 66Ke.
Projet DynaDraw (2009-2011). Type de projet : PEPS CNRS. Titre détaillé : Représentation Statique
des Aspects Dynamiques des Graphes d’Interaction. Partenaires : LIAFA (CNRS et Univ. Paris
Diderot), LIMOS (CNRS et Univ. Clermont Ferrand), et CPT (CNRS et Univ. Marseille). Responsable du projet : Nicolas Schabanel. Montant de la collaboration : 14Ke.
Projet Mappi (2010-2013). Type de projet : ANR Cosinus. Titre détaillé : Nouvelles approches algorithmiques et bioinformatiques pour l’analyse des grandes masses de données issues des
séquenceurs de nouvelle génération. Partenaires : LIAFA (CNRS et Univ. Diderot), INRIA Bonsai
(LIFL Lille), INRAI Symbiose (IRISA Rennes), Genoscope (CEA, Evry). Responsable du projet :
Mathieu Raffinot. Montant de la collaboration : 150 Ke.
Projet Buenos Aires 1620–1840 (2011-2012). Type de projet : PEPS INS2I-SHS (interdisciplinaire).
Titre détaillé : constitution d’un corpus pour l’étude de la dynamique des réseaux sociaux personnels et la formation d’une communauté. Partenaires : LIAFA, SEDET (CNRS et Univ. Diderot),
CRH (CNRS et EHESS), LIF (CNRS et Aix-Marseille 2). Responsable du projet : Christophe
Prieur. Montant pour le LIAFA : 12Ke.
Projet DISPLEXITY (2011-2014). Type de projet : ANR Blanc. Titre détaillé : Calculabilité et complexité en distribué. Partenaires : LIAFA (CNRS et Univ. Diderot), LaBRI (CNRS et Univ. Bordeaux) et ASAP (INRIA-Bretagne). Responsable du projet : Carole Delporte et Hugues Fauconnier. Montant de la collaboration (pour le LIAFA) : 283Ke.
6.2.3
Participation à des projets internationaux
Projet Multicomputing (2009-2011) Type de projet : MAE bilatéral Franco-Israélien. Partenaires :
Weizmann Institute, Technion, LaBRI et LIAFA. Responsable LIAFA : Pierre Fraigniaud.
Projet Jules Verne (2010-2011) Type de projet : PHP bilatéral Franco-Islandais. Partenaires : LIAFA et
université de Reykjavik. Responsables LIAFA : Pierre Fraigniaud et François Laroussinie. Montant de la collaboration : 3Ke.
Projet Pavle Savić (2010) Type de projet : PHP bilatéral Franco-Serbe. Partenaires : LIAFA et université de Belgrade. Responsable LIAFA : Nicolas Trotignon.
Experimental UpdateLess Evolutive Routing (EULER)(2010-2013) Type de projet : STREP.
Partenaires : INRIA, Alcatel, UPMC, UCL, IBBT, RACTI, CAT. http://www.
euler-fire-project.eu/. Responsable LIAFA : Laurent Viennot.
Autres participation à des projets internationaux
Projet MSM 0021620838 du Ministère tchèque de l’Éducation. Responsable : Jan Kratochvı́l,
Département de Mathématiques appliquées de l’Université Charles de Prague. Participation : JeanSébastien Sereni.
MANCOOSI (2008-2011) : Projet européen Université Paris Diderot, Université de Nice, INESC Portugal, Caixa Magica, Mandriva, ILOG, Université de Tel-aviv et Université de Louvain. Responsable :Roberto Di Cosmo(PPS). Participation : Yacine Boufkad.
127
6.2.4
Participation à des projets nationaux
FRAGILE (2004-2008). Type de projet : ACI Sécurité. Titre détaillé : Failure Resilience and Application Guaranteed Integrity in Large-scale Environments). Partenaires : LIAFA, LRI. Responsable
du projet : Sébastien Tixeuil (LRI). Responsable LIAFA : Hugues Fauconnier. Montant de la collaboration (pour le LIAFA) : 55Ke.
Autograph (2006-2008). Type de projet : ANR Télécom. Titre détaillé :Visualisation et analyse des collectifs auto-organisés. Partenaires : Orange Labs, LIAFA, Inria Futues, ENST, Fing. Responsable
du projet : Dominique Cardon (Orange Labs). Responsable LIAFA : Christophe Prieur. Montant
de la collaboration (pour le LIAFA) : 110Ke.
Projet PROSE (2009-2012). Type de projet : ANR VERSO. Titre détaillé : Content Shared Through
P2P Recommendation & Opportunistic Social Environment. Partenaires : Thomson (Paris), INRIA Regal (Paris), Eurécom (Sophia-Antipolis), PlayAdz (Sophia-Antipolis), LIAFA (Paris), Telecom ParisTech (Paris). Responsable du projet : Augustin Chaintreau (Thomson). Responsable
LIAFA : Pierre Fraigniaud. Montant de la collaboration (pour le LIAFA) : 87Ke.
Projet SHAMAN (2009-2012). Type de projet : ANR VERSO. Titre détaillé : Self-organizing and Healing Architectures for Malicious and Adversarial Networks. Partenaires : LIP6(Paris), LIAFA (Paris), INRIA ASAP (Rennes), Ecole Polytechnique et LIF, Orange Labs (Paris). Responsable du
projet : Sébastien Tixeuil (Lip6). Responsable LIAFA : Hugues Fauconnier. Montant de la collaboration (pour le LIAFA) : 117Ke.
Peficamo (2009-2011) Type de projet : projets DIM ”Logiciels et Systèmes Complexes” 2009 de la
Région Île-de-France. Titre détaillé : Performance et fiabilité des réseaux de capteurs mobiles.
Partenaires : LIAFA, LPD(EPFL), LSV. Responsable LIAFA : Hugues Fauconnier Montant de la
collaboration (pour le LIAFA) : 138Ke.
Projet AutProb (2010-2012). Type de projet : projet IXXI. Titre détaillé : Réseaux d’automates probabilistes. Partenaires : LIAFA (CNRS et Univ. Diderot), LIP (CNRS et ENS Lyon), LIG (CNRS et
Grenoble), Leibniz U. Hannover, LJK (CNRS et Grenoble). Montant de la collaboration : 5Ke.
Resp. : Éric Thierry, Nicolas Schabanel.
Algopol (2012-2014). Type de projet : ANR Contenus et Interactions. Titre détaillé : Politique des algorithmes. Partenaires : LIAFA, Cams (EHESS/CNRS), Linkfluence, Orange Labs. Responsable
du projet : Camille Roth (ISC-PIF). Responsable LIAFA : Christophe Prieur. Montant de la collaboration (pour le LIAFA) : 120Ke.
Autres participation à des projets nationaux :
Webfluence (2009-2010). Type de projet : ANR Systèmes complexes. Titre détaillé : Dynamique d’opinion dans les espaces publics numériques : morphogenèse et diffusion. Partenaires : Institut des
systèmes complexes Paris Ile de France, Lip6, Linkfluence, Orange Labs Responsable du projet : Camille Roth (ISC-PIF). Christophe Prieur était associé au Lip6 (responsable Bénédicte Le
Grand).
Projet MAGNUM (2010-2014). Type de projet : ANR Blanc. Titre détaillé : Méthodes Algorithmiques
pour la Génération aléatoire Non Uniforme : Modèles et applications. Partenaires : LIAFA (CNRS
et Univ. Diderot), LIP6 (CNRS et Univ. Pierre et Marie Curie), LIX (CNRS et École Polytechnique), INRIA Rocquencourt, IGM (CNRS et Univ. Paris Est) et LIPN (CNRS et Univ. Paris
Nord). Responsable du projet : Michèle Soria. Participant : Nicolas Schabanel.
6.2.5
Participation à des projets locaux
Projet AlgoSysComp (2009-2010). Type de projet : BQR. Titre détaillé : Aspects algorithmiques des
systèmes complexes naturels. Partenaires : LIAFA (CNRS et Univ. Diderot). Responsables du
128
projet : Nicolas Schabanel. Montant de la collaboration : 20Ke.
Projet Algorithmique distribuée quantique (2010). Type de projet : Projet Interdisciplinaire Paris
Diderot. Partenaires : LIAFA et le Laboratoire Matériaux et Phénomènes Quantiques (MPQ)
de l’université Paris Diderot. Responsables du projet : Carole Delporte et Hugues Fauconnier
(LIAFA) et Thomas Coudreau (MPQ). Montant de la collaboration : 12 Ke.
6.3
Administration de la recherche
6.3.1
6.3.1.1
Activitées éditoriales
Membre de comités éditoriaux
Distributed Computing (Springer). Pierre Fraigniaud (2008-actuel).
Voir http://www.springer.com/computer/communications/journal/446
Theory of Computing Systems (Springer). Pierre Fraigniaud (2003-actuel).
Voir http://www.springer.com/computer/foundations/journal/224
Fundamenta Informaticae (IOS Press). Pierre Fraigniaud (2010-actuel).
Voir http ://fi.mimuw.edu.pl/.
ICST Transactions on Algorithms Engineering. Pierre Fraigniaud (2009-actuel).
Voir http://icst.org/algorithms-engineering/
Journal of Interconnection Networks (World Scientific). Pierre Fraigniaud (2002-actuel).
Voir http://www.worldscinet.com/join/mkt/editorial.shtml
Mathematica Bohemica (Academie des Sciences de République Tchèque). Jean-Sébastien Sereni
(2011-actuel).
Voir http ://mb.math.cas.cz/
6.3.1.2
Edition de numéros spéciaux
Theoretical Computer Science (Elsevier). Numéro spécial “Graph Searching”. Pierre Fraigniaud (vol
399, Number 3, 2008) en collaboration avec Fedor Fomin (Univ. Bergen) et Dimitrios Thilikos
(Univ. Athènes).
6.3.2
6.3.2.1
Gestion scientifique de conférences
Présidence de comités de pilotage
SIROCCO. Colloquium on Structural Information and Communication Complexity. Pierre Fraigniaud
(2006-2011).
6.3.2.2
Participation à des comités de pilotage
DISC. International Conference on Distributed Computing. Pierre Fraigniaud (2005-2008).
PODC. ACM Symposium on Principles of Distributed Computing. Pierre Fraigniaud (2011-actuel).
STACS. Symposium on Theoretical Aspects of Computer Science. Pierre Fraigniaud (2004-2009) et
Michel Habib (2005-2010)
SPAA. ACM Symposium on Parallelism in Algorithms and Architectures. Pierre Fraigniaud (2002actuel).
WG. International Workshop on Graph- Theoretic Concepts in Computer Science. Michel Habib (20042011)
129
6.3.2.3
Présidence de comités de programme
PODC 2011 30th ACM Symp. on Principles of Distributed Computing, San Jose, USA, Jun 6-8, 2011.
Pierre Fraigniaud.
Algotel 2012 14èmes Rencontres Francophones sur les Aspects Algorithmiques des
Télécommunications 29 Mai au 1er Juin 2012, La Grande Motte, Hérault, France. Fabien
Mathieu (avec Nicolas Hanusse).
6.3.2.4
Participation à des comités de programmes
Conférences internationales
PODS 2013 (External Review Committee). 32th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, New York, June 23-28, 2013. Pierre Fraigniaud.
PODC 2012 31th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Madeira, Portugal July 16-18, 2012. Carole Delporte-Gallet.
ICALP 2012 39th International Colloquium on Automata, Languages and Programming, Warwick,
UK, July 9-13, 2012. Pierre Fraigniaud.
ICDCS 2012. 32nd International Conference on Distributed Computing Systems, Kanazawa, Japan, 1225 June 2012. Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud et Amos Korman.
SSS 2012. 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems,
Toronto, Canada, September 24-27, 2012. Pierre Fraigniaud.
ALGOSENSORS 2012. 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad
Hoc Networks and Autonomous Mobile Entities, Ljubljana, Slovenia, September 2012. Pierre Fraigniaud.
ITC 2012 24th International Teletraffic Congress, Krakow, Poland, September 4-7, 2012, Fabien Mathieu
SEA 2012. 11th Symposium on Experimental Algorithms, Bordeaux, France, June 7-9, 2012. Pierre
Fraigniaud.
LATA 2012 6th Int. Conf. on Language and Automata Theory and Applications , Coruna, SpainMarch
5-9, 2012. Mathieu Raffinot.
TAPAS 2012. 2nd International Conference on Theory and Practice of Algorithms in (Computer) Systems, Ein Gedi, Israel, December 3-5, 2012. Pierre Fraigniaud.
SWAT2012 13th Scandinavian Symposium and Workshops on Algorithm Theory Helsinki, Finland, July
4-6,2012. Michel Habib.
LATIN 2012 10th Latin American Symposium on Theoretical Informatics, Arequipa, Perou, April 1620, 2012. Nicolas Schabanel.
SEA 2012 11th International Symposium on Experimental Algorithms, Bordeaux, France, June 7-9,
2012. Nicolas Schabanel.
ICDCN 2012 13th International Conference on Distributed Computing and Networking, Hong Kong,
China January 3-6, 2012. Carole Delporte-Gallet.
CPM 2012 23 th Annual Symposium Combinatorial Pattern Matching July 3-5, 2007, Helsinki, Finland. Mathieu Raffinot.
PODC 2011 30th ACM Symp. on Principles of Distributed Computing, San Jose, USA, Jun 6-8, 2011.
Amos Korman
SPAA 2011 23rd ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, California, USA, June 4-6, 2011. Pierre Fraigniaud.
130
ICDCN 2011 12th International Conference on Distributed Computing and Networking, Bangalore,
India, Jan 02-05, 2011. Pierre Fraigniaud.
IPDPS 2011 25th IEEE International Symposium on Parallel and Distributed Processing, Anchorage,
Alaska, USA, 16-20 May, 2011. Fabien Mathieu et Laurent Viennot
LATA 2011 5th Int. Conf. on Language and Automata Theory and Applications (LATA) Taragone,
Spain, 26-31 May, 2011. Mathieu Raffinot.
OPODIS 2010 14th International Conference Principles of Distributed Systems , Tozeur, Tunisia, December 14-17, 2010. Carole Delporte-Gallet.
SSS 2010 12 th International Symposium on Stabilization, Safety, and Security of Distributed Systems
New York City, USA September 20-22, 2010. Hugues Fauconnier.
DISC 2010 24th International Symposium on Distributed Computing, September 12-15, 2010, Cambridge, USA. Pierre Fraigniaud.
APPROX 2010 13th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization
Problems, 1-3 September 2010, UPC Barcelona, Spain. Pierre Fraigniaud.
PODC 2010 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Zurich,
Switzerland July 25-28, 2010. Hugues Fauconnier.
ICDCS 2010 30th International Conference on Distributed Computing Systems, Jun 21-25, 2010, Genoa, Italy. Pierre Fraigniaud.
WOSN 2010 3rd Workshop on Online Social Networks, June 22, 2010, Boston, MA, USA. Pierre Fraigniaud.
WG 2010 36th International Workshop on Graph Theoretic Concepts in Computer Science, June 28-30,
2010, Zarós, Crete, Greece. Pierre Fraigniaud.
ACA 2010 1st Asynchronous Cellular Automata Workshop part of ACRI 2010 (9th Int. Conf. Cellular Automata for Research and Industry), Ascoli Piceno, Italy, September 21-24, 2010. Nicolas
Schabanel.
ICDCN 2010 11th International Conference on Distributed Computing and Networking, January 3-6,
2010, Kolkata, India. Pierre Fraigniaud et Amos Korman.
MFCS 2010 35th International Symposium on Mathematical Foundations of Computer Science, August 23-27, 2010 Brno, Czech Republic. Michel Habib.
SSS 2009 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Lyon, France, November 3-6, 2009. Hugues Fauconnier et Fabien Mathieu
DISC 2009 23th Annual Conference on Distributed Computing. Elche/Elx, Spain, September 23-25,
2009 Carole Delporte-Gallet.
PODC 2009 28th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary,
Canada, August 10-12, 2009. Pierre Fraigniaud.
MFCS 2009 34th International Symposium on Mathematical Foundations of Computer Science, August 24-28, 2009 Novy Smokovec, Slovakia. Pierre Fraigniaud.
ICALP 2009 36th International Colloquium on Automata, Languages and Programming, July 5-12,
2009 Rhodes, Greece. Track A ”Algorithms, Automata, Complexity and Games”, Michel Habib.Track C ”Foundations of Networked Computation”, Pierre Fraigniaud.
ESA 2009 17th Annual European Symposium on Algorithms, Sept. 7-9, 2009, Copenhagen. Pierre Fraigniaud.
IPDPS 2009 23rd IEEE International Parallel and Distributed Processing Symposium, Rome, Italy,
May 25-29, 2009. Pierre Fraigniaud.
131
ICDCN 2009 10th International Conference on Distributed Computing and Networking, January 3-6,
2009, Gachibowli, Hyderabad, India. Pierre Fraigniaud.
SSS 2009 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems,
Lyon, France, November 3-6, 2009. Pierre Fraigniaud et Fabien Mathieu.
WAOA 2009 7th Int. Workshop on Approximation and Online Algorithms, Copenhagen, Denmark, September 10-11, 2009. Nicolas Schabanel.
DISC 2008 22nd International Symposium on Distributed Computing, Arcachon, France. September
22-24, 2008. Amos Korman.
DIALM-POMC 2008 5th ACM Int. Workshop on Foundation of Mobile Computing, August 22, 2008,
Toronto, Canada. Pierre Fraigniaud.
ICDCS 2008 28th Int. Conference on Distributed Computing Systems, Beijing, 17-20 june 2008. Pierre
Fraigniaud.
SPIRE 2008 15th String Processing and Information Retrieval Symposiu, Melbourne, Australia, November 10-12 2008. Mathieu Raffinot.
PODC 2007 26 th ACM Symposium on Principles of Distributed Computing, August 13-15, 2007, Portland, Oregon. Pierre Fraigniaud.
MFCS 2007 32nd Int. Symp. on Mathematical Foundations of Computer Science, Cesky Krumlov,
Czech Republic, August 26-31, 2007. Pierre Fraigniaud.
SASO 2007 1st IEEE International Conference on Self-Adaptive and Self-Organizing Systems, July 911, 2007, MIT, Boston, USA. Pierre Fraigniaud.
ADHOCNOW 2007 6th International Conference on Ad Hoc and Wireless Networks, Morelia, Mexico,
September 24-26, 2007. Pierre Fraigniaud.
ICPP 2007 36th International Conference on Parallel Processing, XiAn, China September 10-14,
2007. Pierre Fraigniaud.
MASS 2007 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, Pisa, 8-11 October 2007. Pierre Fraigniaud.
DIALM-POMC 2007 4th ACM Int. Workshop on Foundation of Mobile Computing, August 16, 2007,
Portland, Oregon. Pierre Fraigniaud.
Euro-Par 2007 13th International European Conference on Parallel and Distributed Computing,
Rennes, France, August 28-31, 2007. Nicolas Schabanel.
CPM 2007 18 th Annual Symposium Combinatorial Pattern Matching, July 9-11, 2007, London, Canada. Mathieu Raffinot.
Conférences nationales
Algotel 2012 14èmes Rencontres Francophones sur les Aspects Algorithmiques de
Télécommunications. 29 Mai au 1er Juin 2012, La Grande Motte, Hérault, France. Hugues
Fauconnier, Nicolas Schabanel.
JGA 2011–présent Journées Graphes et Algorithmes du GDR IM Jean-Sébastien Sereni.
Télécommunications. 23 au 26 Mai 2011, Cap Estérel, France. Carole Delporte-Gallet et
Nicolas Schabanel.
Télécommunications. 31Mai -3 Juin 2010, Belle Dune, Cote d’Opale, France. Hugues Fauconnier
132
JDIR 2010 11es Journées Doctorales en Informatique et Réseaux 24-26 Mars 2010, Sophia Antipolis,
France. Carole Delporte-Gallet et Fabien Mathieu.
Télécommunications. Carry-Le-Rouet, France 16-19 juin 2009. Carole Delporte-Gallet.
JDIR 2009 10 th Journées Doctorales Informatique et Réseau.Belfort-Montbéliard, Decembre 24-25,
2009. Carole Delporte-Gallet.
JDIR 2008 9 th Journées Doctorales Informatique et Réseau.Villeneuve d’Ascq, 16-18 janvier 2010.
Carole Delporte-Gallet et Fabien Mathieu.
JDIR 2007 8 th Journées Doctorales Informatique et Réseau. Marne-la-Vallée, 17-19 janvier 2010. Carole Delporte-Gallet.
RIAMS 2007 3ème workshop national ”Réseaux Biologiques : Analyse, Modélisation, Simulation”,
La Doua, France, November 28, 2007. Nicolas Schabanel.
COSI Conférence Algérienne sur l’Optimisation et les Systèmes d’information, participation au comité
de programme depuis sa création en 2003, Michel Habib.
6.3.3
6.3.3.1
Organisation d’évènements scientifiques
Présidence de comités d’organisation
– Dagstuhl Seminar on “Epidemic Algorithms and Processes : From Theory to Applications”, Jan
21-25, 2013. Co-organisateurs : B. Doerr (MPI), R. Elsaesser (University of Paderborn), P. Fraigniaud (CNRS and University Paris-Diderot), and R. Guerraoui (EPFL).
– Dagstuhl Seminar on “Theory and Applications of Graph Searching Problems”, Feb 13-18, 2011.
Co-organisateurs : F. Fomin (University of Bergen), P. Fraigniaud (CNRS and University ParisDiderot), S. Kreutzer (TU Berlin) and D. Thilikos (University of Athens).
6.3.3.2
Participation à des comités d’organisation
METRIC 2011. Trimestre interdisciplinaire mathématique et informatique ”Metric geometry, algorithms and groups”, Institut Henri Poincaré, Paris, France, Janvier-Mars 2011. Nicolas Schabanel
(en collaboration avec G. Kindler, J. Lee, C. Mathieu, R. O’Donnell, P. Pansu, L. Silberman).
METRIC 2011 WORKSHOP 1. Int. Workshop ”Metric embeddings, algorithms and hardness of approximation”, Institut Henri Poincaré, Paris, France, 17-21 Janvier 2011. Nicolas Schabanel (en
collaboration avec G. Kindler, J. Lee, C. Mathieu, R. O’Donnell, P. Pansu, L. Silberman).
METRIC 2011 WORKSHOP 2. Int. Workshop ”Expanders and Derandomization”, Institut Henri
Poincaré, Paris, France, 21-24 Mars 2011. Nicolas Schabanel (en collaboration avec G. Kindler,
J. Lee, C. Mathieu, R. O’Donnell, P. Pansu, L. Silberman).
6.3.4
6.3.4.1
Participant à des comités et jurys scientifiques
Au niveau international
FET (Future and Emerging Technologies)-OPEN en ICT (Information and Communication
Technologies). Membre du comité d’experts (2011-présent) : Pierre Fraigniaud.
Research Grant Council de Hong Kong. Membre du comité d’experts (2010-présent) : Christophe
Prieur.
Dijkstra Prize in Distributed Computing. Président du jury 2011 et membre du jury 2010 : Pierre
Fraigniaud.
Prize for innovation in Distributed Computing. Président du jury 2009, 2010 et 2011 : Pierre Fraigniaud.
133
6.3.4.2
Au niveau national
ANR Blanche et JCJC. Membre du comité d’évaluation pour les éditions 2010 et 2011 : Pierre Fraigniaud.
PES CNRS 2011. Membre du jury : Pierre Fraigniaud.
PES Ministère 2012 Membre du jury : Michel Habib.
Région Ile de France. Membre du comité d’évaluation pour les projets du Domaine d’Intérêt Majeur
(DIM) Logiciel et Systèmes Complexes pour l’édition 2010 : Pierre Fraigniaud.
IXXI. Membre élu du comité de pilotage de l’Institut Rhône-Alpin des Systèmes Complexes (IXXI)
depuis 2009 : Nicolas Schabanel.
AERES. Membre du comité d’évaluation AERES du LIMOS, janvier 2011 : Nicolas Schabanel.
Membre du comité d’évaluation du LORIA, janvier 2012 : Michel Habib
6.3.4.3
Commissions de spécialistes
– Université Paris Diderot (2007-2012) : Pierre Fraigniaud.
– Université de Marseille – chaire CNRS (2012) : Pierre Fraigniaud.
– Université de Caen (2012) : Pierre Fraigniaud.
– ENS Lyon (2011) : Pierre Fraigniaud (président).
– Université Pierre et Marie Curie (2011) : Pierre Fraigniaud.
– Université de la Méditerrannée (2011) : Michel Habib.
– Université Paul Sabatié (2011) : Michel Habib.
– Université de Caen (2012) : Michel Habib (président).
– CNAM (2012) : Michel Habib.
– Université de la Méditerrannée (2011) : Nicolas Schabanel.
– Université Paris-Dauphine (2010) : Nicolas Trotignon.
– Université Grenoble 1 Joseph-Fourier (2010) : Nicolas Trotignon.
– Université Val-d’Essone (2010) : Nicolas Schabanel.
– Université de Savoie (2010) : Nicolas Schabanel.
– INSA Lyon (2008) : Pierre Fraigniaud.
– Université de Bordeaux (2008) : Pierre Fraigniaud.
– Université d’Artois ( 2009 et 2010) : Yacine Boufkhad.
6.4
Activités de formation, encadrement et évaluation
6.4.1
6.4.1.1
Liste des thèses et HdR soutenues
– Christophe Prieur. (soutenance prévue à l’automne 2012). Sujet : Réseaux sociaux, algorithmes,
identités.
– Nicolas Schabanel. 26 février 2010. Sujet : Systèmes complexes & Algorithmes.
– Nicolas Trotignon. 15 décembre 2009. Sujet : Structure des classes de graphes définies par l’exclusion de sous-graphes induits.
134
6.4.1.2
Thèses de doctorat
Sauf mention explicite les thèses ont été soutenu à l’université Paris Diderot.
– Hervé Baumann (soutenance septembre 2012). Sujet : Protocoles de diffusion dans les systèmes
distribués. Allocation fléchée du ministère. Encadrant : Pierre Fraigniaud.
– Xavier Koegler (soutenance septembre 2012). Sujet : Protocoles de population. Co-encadrement
avec Olivier Bournez (LIX). Allocation Moniteur Normalien. Encadrant : Pierre Fraigniaud.
– Thu-Hien To. 15 décembre 2011. Sujet : On some graph problems in phylogenetics. Allocation
Moniteur Polytechnicien. Encadrant : Michel Habib.
– Mauricio Soto. 2 décembre 2011. Sujet :Quelques propriétés topologiques des graphes et applications à Internet et aux réseaux . Encadrant : Fabien de Montgolfier et Laurent Viennot.
– Djamal Belazzougui. 21 novembre 2011. Sujet : Structures compactes pour la localisation de
motifs. Encadrant : Mathieu Raffinot.
– Eliya Buyukkaya. 24 juin 2011. Sujet : Architecture pair-à-pair pour le support de jeux vidéo
dans un environnement MANET, Bourse du projet ANR RIAM (ED P6). Actuellement Post Doct
à Télécom Bretagne. Encadrants : Maha Abdallah (MdC, LIP6, 90%) et Pierre Fraigniaud (10%).
– Alina Stoica 12 octobre 2010. Sujet : Analyse de la structure locale des grands réseaux sociaux
Encadrants : Christophe Prieur et Michel Habib. CIFRE avec Orange Labs, actuellement en CDI
chez EDF R&D.
– Thomas Hugel. 7 décembre 2010. Sujet : estimations de satisfaisabilité. Encadrement :Yacine
Boufkhad.
– Hoang-Anh Phan. 29 septembre 2010. Sujet : Equilibrage de charge et diffusion multicast dans
les systèmes pair-à-pair, Bourse CNRS-BDI/Pays en développement, actuellement Consultant en
Systèmes et Réseaux chez Alten. Encadrant : Pierre Fraigniaud.
– Andreas Tielmann. 7 mai 2010. Sujet : Minimal Conditions for Fault-Tolerant Agreement. Encadrants : Carole Delporte et Hugues Fauconnier.
– Julien Robert. 7 décembre 2009.Ordonnancement non-clairvoyant avec contraintes de
dépendances. (Thèse en informatique de l’école Normale Supérieure de Lyon). Encadrant : Nicolas Schabanel.
– Diego Perino. 16 novembre 2009. Thèse CIFFRE. Sujet : Algorithmes d’allocation de ressources
pour le streaming en pair-à-pair. Encadrants : Fabien Mathieu et Laurent Viennot.
– Vincent Limouzy. 3 décembre 2008. Sujet : Algorithmes de décomposition de graphes (MENRT).
Encadrant : Michel Habib.
– Mohssen Abboud. 27 novembre 2008. Sujet : Tolérance aux défaillances dans les réseaux dynamique. Encadrants : Carole Delporte et Hugues Fauconnier.
– Damien Regnault. 24 novembre 2008. Sujet :Automates cellulaires probabilistes : Comportements
asynchrones. (Thèse en informatique de l’École Normale Supérieure de Lyon). Encadrants : Nicolas Schabanel et Eric Thierry.
6.4.2
6.4.2.1
Listes des rapports de thèses et d’habilitations
Rapports d’Habilitations à Diriger les Recherches
– Laurent Massoulié (Technicolor, U. Paris Diderot) : Information Flows through Networks : Models
and Algorithms, 20 avril 2010. Rapporteur : Pierre Fraigniaud.
– David Coudert (CR INRIA, Sophia-Antipolis) : Algorithmique et optimisation dans les réseaux
de communications, 5 mars 2010. Rapporteur : Pierre Fraigniaud.
135
– Stéphane Pérennes (CR CNRS, I3S, Sophia-Antipolis) : Contribution à l’algorithmique des
réseaux de télécommunications, 5 mars 2010. Rapporteur : Pierre Fraigniaud.
– Nicolas Schabanel (CR CNRS, LIAFA, U. Paris Diderot) : Systèmes complexes et algorithmes, 26
février 2010. Rapporteur : Pierre Fraigniaud.
– Nicolas Hanusse (CR CNRS, LaBRI, U. Bordeaux) : Navigation dans les grands graphes, 26
novembre 2010. Rapporteur : Pierre Fraigniaud.
– Nicolas Trotignon ( CR CNRS LIAFA puis LIR) : Structure des classes de graphes définies par
l’exclusion de sous-graphes induits, 15 décembre 2011. Rapporteur : Michel Habib.
– Fabien Mathieu (France Télécom, HDR UPMC) : Autour du pair-à-pair : Distribution de contenu,
réseaux à préférences acycliques, 11 fev. 2009. Rapporteur : Pierre Fraigniaud.
– Arnaud Legout (CR INRIA, Sophia-Antipolis) : Efficacité et vie privée : de BitTorrent à Skype,
20 janvier 2012. Rapporteur : Laurent Viennot.
6.4.2.2
Rapports de thèse
– Afshin Moin, Recommendation and Visualization Techniques For Large Scale Data, 9 juillet 2012,
Université de Rennes. Rapporteur : Pierre Fraigniaud.
– Xiaoming Wang : Deciding on the type of the agree distribution of a graph (network) from trace
route-like measurements, 13 décembre 2011, Univ. Pierre et Marie Curie. Rapporteur : Carole
Delporte.
– Dorian Mazauric, Optimisation discrète dans les réseaux de télécommunication, 7 novembre
2011, Université Nice-Sophia-Antipolis. Rapporteur : Pierre Fraigniaud.
– Paolo Veglia, On the network awareness of P2P-TV Applications, 23 septembre 2011, Telecom
ParisTech. Rapporteur : Fabien Mathieu.
– Dan-Cristian Tomozei, Distributed algorithms for peer-to-peer networks, 11 février 2011, Univ.
Pierre et Marie Curie. Rapporteur : Laurent Viennot.
– Robero Costinas, Failure détections and communication efficience in the crash and general omission failure models, 4 avril 2011, European phD, Rapporteurs : Carole Delporte (report), Hugues
Fauconnier (recommendation).
– Julian Monteiro, Modeling and Analysis of Reliable Peer-to-Peer Storage Systems, 16 novembre
2010, Univ. Nice Sophia-Antipolis. Rapporteur : Fabien Mathieu.
– Jiřı́ Fink, Probabilistic Methods in Discrete Applied Mathematics, octobre 2010. Rapporteur :
Jean-Sébastien Sereni.
– Marin Bougeret, Systèmes interactifs pour la résolution de problèmes complexes, 15 octobre 2010,
Institut National Polytechnique de Grenoble. Rapporteur : Pierre Fraigniaud.
– Asim Ali : Robustness in Large Scale Distributed Systems, 8 septembre 2010, Univ. Orsay. Rapporteur : Carole Delporte.
– Rodica Mihai : Games on graphs : searching and online coloring, 15 mars 2010, University of
Bergen, Norway. Rapporteur : Pierre Fraigniaud.
– Gilles Tredan : Structures et systèmes répartis, 26 novembre 2009, Univ. Rennes. Rapporteur :
Carole Delporte.
– Romain Ravaux : Etudes structurelle et algorithmique de problèmes de décomposition de
graphes : cas du problème de partition de graphes, 25 novembre 2009, Univ. Versailles. Rapporteur : Pierre Fraigniaud.
– Youssou Dieng : Etude structurelle des graphes et routage de plus court chemin, 23 octobre 2009,
Univ. Bordeaux. Rapporteur : Pierre Fraigniaud.
136
– Julien Clément : Algorithmique probabiliste pour systèmes distribués émergents,19 octobre 2009,
Univ. Orsay. Rapporteur : Hugues Fauconnier.
– Aina Ravoaja : Mécanismes et architectures P2P robustes et incitatifs pour la réputation, 11 dec.
2008. Rapporteur : Pierre Fraigniaud.
– Emanuele Fusco : Algorithmic aspects of communication tasks in networks , décembre 2008,
Universita di Roma ”La Sapienza”. Rapporteur : Pierre Fraigniaud.
– Florian Huc : Conception de réseaux dynamiques tolérants aux pannes, 14 novembre 2008, Univ.
Nice -Sophia-Antipolis. Rapporteur : Pierre Fraigniaud.
– Yann Busnel : Self-organized collaborative information system for large-scale wireless sensor
networks : Moving theory into practice, 18 novembre 2008, Univ. Rennes. Rapporteur : Carole
Delporte.
– Laurent Lyaudet : Graphes et hypergraphes : complexités algorithmique et algébrique, 17
décembre 2007, ENS Lyon. Rapporteur : Pierre Fraigniaud.
– Oskar Sandberg : The Structure and Dynamics of Navigable Networks, 14 décembre 07, Chalmers
University, Suède. Rapporteur : Pierre Fraigniaud.
– Mathieu Liedloff : Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations, 07 décembre 2007, Université de Metz. Rapporteur : Pierre
Fraigniaud.
– Omid Amini : Algorithmique des décompositions de graphes Application aux réseaux de
télécommunications, 28 novembre 07, Univ. Nice-Sophia-Antipolis. Rapporteur : Pierre Fraigniaud.
6.4.3
6.4.3.1
Enseignement dispensé
Cours universitaires en M2
Les cours ”Algorithmique distribuée avec mémoire partagée”, ”Algorithmique distribuée pour les
réseaux”, ”Algorithmique des graphes” et ”Algorithmique avancée : Algorithmes d’approximation” du
Master Parisien de Recherche en Informatique (MPRI) sont sous la responsabilités des membres de
l’équipe et entièrement assurés par les membres de l’équipe (sauf le cours Algorithmique avancée :
Algorithmes d’approximation dont seulement la moitié est assurée par un membre de l’équipe)
Les cours ”Algorithmique répartie”, ”Grands réseaux d’interaction”, ”Mobilité, algorithme parallèle et
grilles de calcul”, ”Programmation répartie”, ” Protocoles des services Internet”, ”Moteurs de recherche”
du Master 2 Pro Ingénierie Informatique de l’université Paris Diderot sont assurés par des membres de
l’équipe.
Détails pour le MPRI :
– Carole Delporte : responsable et intervenant du cours Algorithmique distribuée avec mémoire
partagé –(qui remplace le cours Algorithmique répartie et tolérance aux défaillances), 2007-2008
et 2009-présent.
– Pierre Fraigniaud : responsable et intervenant du cours Algorithmique distribuée pour les réseaux
, 2009-présent.
– Pierre Fraigniaud : cours Algorithmique des graphes en coordination avec Michel Habib, 20072009.
– Hugues Fauconnier : cours Algorithmique distribuée avec mémoire partagé – ( qui remplace le
cours Algorithmique répartie et tolérance aux défaillances), 2007-2008 et 2009-présent.
– Michel Habib : responsable et intervenant du cours Algorithmique des graphes – 2007-présent.
137
– Nicolas Schabanel : responsable et intervenant du cours Utilisations du hasard en informatique,
2010-11.
– Nicolas Schabanel : responsable et intervenant du cours Algorithmique avancée : Algorithmes
d’approximation, 2011-12.
– Jean-Sebastien Sereni : cours Algorithmique des graphes, 2010-12.
– Nicolas Trotignon : cours Algorithmique des graphes dans le Master Parisien de Recherche en
Informatique (MPRI) – 2008-2011.
– Laurent Viennot : cours réseaux dynamiques (MPRI) – A 2008-2009.
– Laurent Viennot : cours Algorithmique distribuée pour les réseaux – 2009-présent.
Autres cours :
– Carole Delporte et Hugues Fauconnier : responsables du cours Systèmes Distribués, Ecole National des Ponts et Chaussées (2007-2008)
– Pierre Fraigniaud : responsable du cours Algorithmique avancée, Ecole Centrale (2009-présent).
– Nicolas Schabanel : responsable du cours Algoritmo de approximacion, M2R, Universidad de
Chile, Chile (2007).
– Nicolas Schabanel : responsable du cours Problèmes de satisfaction de contraintes, M2R interdisciplinaire Systèmes complexes, 16h, Ecole Normale Supérieure de Lyon (2009-12).
– Fabien Mathieu : Réseaux Pair-à-Pair, Master 2 Computer Science, 6h, Univ. Paris 6.
– Fabien de Montgolfier : P2P theory and application, Univ. de Marne-la-Vallée.
– Jean-Sebastien Sereni : Univ. Charles de Prague 2009. Graphs and Counting, cours créé et dispensé avec M. Loebl, 9 séances.
– Jean-Sebastien Sereni : Sélecteurs (Alcatel) et l’arête-coloration, Master Optimisation combinatoire et complexité, Univ. Paris I (2h).
– Nicolas Trotignon : Graphes et optimisation combinatoire, Master à l’université Paris 1 (20082010).
– Nicolas Schabanel : Complexité algorithmique & Optimisation discrète. M2R ”Mathématiques
et applications” spécialité ”Optimisation & Théorie des Jeux. Modélisation en économie”, 18h,
Univ. Paris 6 (2008).
– Nicolas Schabanel : Le hasard en informatique et ses applications à la modélisation en biologie,
3h, M2R Bio-informatique, INSA Lyon (2009).
– Nicolas Schabanel : Auto-organisation de la matière. 6h M2R interdisciplinaire Systèmes complexes, 6h, Ecole Normale Supérieure de Lyon (2009-11).
– Nicolas Schabanel : Approche informatique des systèmes complexes, M2R Bio-informatique, 3h,
INSA Lyon (2010-2012).
– Nicolas Schabanel. Introduction aux graphes expandeurs. Semaine sport-étude du M2 informatique, 3h, Ecole Normale Supérieure de Lyon (2012).
6.4.3.2
Jurys
– Nicolas Schabanel est membre des jurys des concours d’entrée des ENS (2008-), de l’X (2011-)
et de l’agrégation de mathématiques (2011-)
138
6.4.3.3
Ecoles thématiques et cours spécialisés
Organisation :
– Carole Delporte et Hugues Fauconnier : Organisation du ”Workshop on Distributed Quantum
Computing” 16-19 octobre 2010, Florence, Italie.
– Pierre Fraigniaud : Organisation de la 2nd DYNAMO Training School on Dynamic Networks, 4-6
juillet 2008, Reykjavik, Iceland.
– Nicolas Trotignon : Organisation de ”A one-day conference on structural graph theory”, LIAFA,
Paris, janvier 2011.
– Christophe Prieur : Séminaire pluridisciplinaire Approches des réseaux sociaux, à l’EHESS, depuis 2005.
– Mathieu Raffinot : Co-organisation avec Benoı̂t Perthame, (Paris-6) de la journée de la Fédération
de mathématiques de Paris sur le thème des relations entre mathématiques et la biologie, Paris,
juin 2011.
– Jean-Sébastien Séréni : organisation des ”Leçons sur le lemme de régularité ” données par
Dan Král’ (qui a reçu le ’European prize for combinatorics’ en 2011). http://www.liafa.
jussieu.fr/˜sereni/Heredia/Regularity/ (9 séances d’une heure trente chacune).
– Jean-Sébastien Séréni : co-organisation (avec L. Esperet) des ” Leçons sur les graphes épars ”
données par P. Ossona de Mendez (cours intensif de 3 jours, 6-8 octobre 2008).
– Jean-Sébastien Séréni : organisation d’une série de leçons sur la théorie extrémale des graphes et
des ordres, mai 2012.
Intervention :
– Carole Delporte : Intervention dans l’école ”Ecole Internationale de Printemps Systèmes Répartis”
(Modèles de mobilité), 20-23 mai 2008, Rabat, Maroc.
– Hugues Fauconnier : Intervention dans l’école ”Ecole Internationale de Printemps Systèmes
Répartis” (Tolérance aux pannes), 20-23 mai 2008, Rabat, Maroc.
– Pierre Fraigniaud : Intervention dans la Spring School on Algorithms, Istanbul, Turkey, 12-15
mars 2009.
– Pierre Fraigniaud : Intervention dans l’école ”Emergent topics in distributed computing”, 9-14
mars 2007, La Plagne.
– Michel Habib : Intervention dans la Spring School on Algorithms, Istanbul, Turkey, 12-15 mars
2009.
– Michel Habib : Intervention dans le VI Escueala de Verano en Matematicas Discretas, Valparaiso,
Chili, janvier 2011.
– Christophe Prieur : Cours mixte sociologie / informatique en L3 Informatique à Paris-Dauphine,
avec Emmanuel Lazega, sociologue.
– Nicolas Schabanel. Computing thanks to randomness. 3h. III escuela de verano en sistemas complejos, Instituto de Sistemas Complejos de Valaparaı́so (ISCV), Valparaı́so, Chile, janvier 2007.
– Nicolas Schabanel. Aplicaciones del azar a los algoritmos : de la aceleración a la autocorrección.
6h. III escuela de verano en matemáticas discretas, Instituto de Sistemas Complejos de Valaparaı́so
(ISCV), Valparaı́so, Chile, janvier 2008.
– Nicolas Schabanel. A computer scientist approach to complex systems. 6h, 3rd Complex System
Summer School, École normale supérieure de Lyon, juillet 2009.
139
– Nicolas Schabanel. Crash course in complexity theory. 12h (resp.), Trimestre ”Metric geometry,
algorithms and groups” (METRIC 2011), Institut Henri Poincaré, Paris, France, janvier 2011.
– Nicolas Schabanel. Preuve complète du théorème PCP. 8h, ouvert à tous les chercheurs et organisé
à l’école normale supérieure de Lyon, 24-25 février 2011.
– Nicolas Schabanel. Preuve complète du théorème PCP. 10h, ouvert à tous les chercheurs et organisé à l’université Paris Diderot dans le cadre d’une formation continue du CNRS, 14-16 juin
2011.
– Nicolas Schabanel. Proof of the PCP theorem. 3h, 39ème École de Printemps d’Informatique
Théorique (ÉPIT), Île de Ré, France, mars 2012.
– Nicolas Schabanel. Algorithmes de graphes. 6h, participation et organisation à la formation des
professeurs de lycée pour l’option informatique en terminales, Académie de Paris, 2012.
– Michel Habib, Conférences à l’université d’été de Mathématiques (Saint-Flour 2010) et Sourdun
(2012) dans le cadre du plan national de formation des professeurs de lycée pour l’option informatique en terminales.
– Jean-Sébastien Sereni : deux leçons dans la série de leçons sur la théorie extrémale des graphes et
des ordres, mai 2012.
6.4.3.4
Vulgarisation
Participation à la fête de la Science (ateliers, conférences, posters) :
– depuis 2008 : un atelier interactif sur Escher et la géométrie impossible ; en 2012, atelier à Maths
en scène (Nicolas Schabanel)
– depuis 2007 : ateliers, conférences, posters (Christophe Prieur)
– ”Stratégies de capture de fugitifs... ou l’application de la théorie des graphes à PacMan” pour
présenter les décompositions de graphes (Fabien de Montgolfier) 2009.
Christophe Prieur a écrit plusieurs articles dans des magazines de vulgarisation (Le Monde supplément
Sciences & Techno, Sciences & Avenir, La recherche)
Laurent Viennot a été éditeur scientifique de )i(nterstices (http ://interstices.info), un site de vulgarisation
porté par l’Inria, le CNRS et les universités. Il a publié deux articles dans )i(nterstices sur les réseaux et
la différence entre web et internet. Laurent Viennot participe aussi au réseau de médiation scientifique
de Inria pour le centre de Paris-Rocquencourt.
Dans cette revue, Fabien de Montgolfier et Vincent Limouzy ont publié une vulgarisation sur les
décomposition de graphes.Laurent Viennot a publié Idée reçue : Web et Internet, c’est la même chose
Emmanuelle Lebhar et Nicolas Schabanel Routage dans les petits mondes.
2008 Nicolas Schabanel (resp.). Réalisation d’une attraction ”Fenêtre sur l’infini” au musée des sciences
de Santiago du Chili (cf Section 6.4.3.5).
2008 Nicolas Schabanel. Encuentra el infinito : Escher y la geometrı́a imposible. Conférence (45 min)
grand public à l’occasion de l’inauguration de l’attraction ”Encuentra el infinito” au musée des
sciences de Santiago du Chili (Museo Interactivo Mirador), Chili, sept. 2010.
Depuis 2008 : Nicolas Schabanel. Chaque année, réalisation d’un atelier ”Fenêtre sur l’infini” à Science
en Fête (éditions 2008, 2009, 2010, 2011, 2012), Université Paris Diderot.
2010 Nicolas Schabanel. Escher et la spirale impossible. Conférence (45 min) grand public dans le
cadre des journées ”Tourbillons, spirales et labyrinthes”, Université Paris Diderot, mai 2010.
2012 Nicolas Schabanel. Relations entre complexité, hasard et désordre : le regard informatique.
Conférence (45 min) grand public dans le cadre des journées ”Complexité/désordre”, Université
Paris Diderot, juin 2012.
140
2012 Nicolas Schabanel et Pierre Pansu. Couper, attendrir, trancher, réduire : un conte culinaire sur
la résolution informatique des problèmes difficiles. À paraı̂tre dans le journal L’explosion des
mathématiques. 6 pages.
6.4.3.5
Transfert
Laurent Viennot a participé à la création de la startup Move&Play sur le partage de données personnelles.
Move&Play a été lauréat des éditions 2007 et 2008 du concours national OSEO d’aide à la création d’entreprises de technologies innovantes dans la catégorie ”en émergence” puis ”création-développement”.
Il a accompagné le développement de l’entreprise jusqu’en 2010, année où l’entreprise est devenue
CleverScale et a changé de focus technique.
Fabien Mathieu et Diego Perino ont déposé un brevet, ”Utilisation d’un ensemble de clients privilégiés
pour une diffusion collaborative de contenu”, le 18 février 2008 sous le N. 0851025.
Les travaux de Stéphane Raux (thèse CIFRE) donnent lieu à la mise en place d’une infrastructure d’analyse de Twitter au sein de l’entreprise Linkfluence, pour son cabinet d’étude notamment.
Deux services web de visualisation liés à la couverture médiatique de la campagne présidentielle ont été
réalisés,
– l’un lauréat du concours Dataviz 2012 de Google France
– l’autre intégré sur lemonde.fr
– Contrat de 10Ke avec le musée des science de Santiago du Chili (Museo Interactivo Mirador)
pour le développement et la réalisation d’une attraction ”Fenêtre sur l’infini” consistant en une
transformation d’image en temps réel à partir de webcam et d’appareil photo inspirée par un tableau d’Escher. Responsable : Nicolas Schabanel, en collaboration avec Karol Suchan. Attraction
inaugurée en septembre 2008 et toujours en fonctionnement quotidien.
6.4.4
6.4.4.1
Autres
Prix et distinctions
Médaille d’argent du CNRS
Pierre Fraigniaud est lauréat 2012 de la Médaille d’argent du CNRS pour l’Institut des sciences de
l’information et de leurs interactions (INS2I). Cette médaille distingue chaque année un chercheur pour
l’originalité, la qualité et l’importance de ses travaux, reconnus sur le plan national et international.
Meilleur article Le prix du meilleur article a été obtenu pour :
[DGFGT09a] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann.
“The Disagreement Power of an Adversary.” In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings. Vol. 5805. Lecture Notes
in Computer Science. Springer, 2009, pp. 8–21
[FRT11] Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers. “Locality and Checkability in WaitFree Computing.” In: Distributed Computing - 25th International Symposium, DISC 2011, Rome,
Italy, September 20-22, 2011. Proceedings. Vol. 6950. Lecture Notes in Computer Science. Springer, 2011, pp. 333–347
[Kor09] Amos Korman. “Compact Routing Schemes for Dynamic Trees in the Fixed Port Model.”
In: Distributed Computing and Networking, 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009. Proceedings. Vol. 5408. Lecture Notes in Computer Science.
Springer, 2009, pp. 218–229
141
Prix TCS En 2010, Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar et Nicolas Schabanel ont
obtenu le prix du ”TOP CITED article in TCS over 2005-2010” pour : ”Could any graph be turned into
a small world ?” TCS, 355(1) :96-103, 2006.
6.4.4.2
Laboratoire européen associé
STRUCO est un laboratoire européen associé du CNRS dont les journées de lancement ont eu lieu en
décembre 2011. Son existence officielle est prévue pour le printemps 2012. Il regroupe le LIAFA (CNRS
et l’Université Paris Diderot) et IUUK (Institut d’Informatique, Université Charles de Prague).
Le thème principaux du LEA sont la théorie des graphes, l’informatique théorique et la vérification.
L’un des buts de ce projet est de fournir une structure pérenne à de nombreuses coopérations entre la
France et la République Tchèque dans les domaines mentionnés. À cet égard, l’équipe de recherche du
LEA comprend également des chercheurs issus d’autres instituts, comme l’IHESS et l’ENS (à Paris), le
projet Mascotte (Sophia Antipolis), l’université de Bohème de l’ouest (Plzen) et celle de Brno.
Le soutien du LEA se situe non seulement au niveau de la production scientifique, mais également de la
dissémination de connaissance et de l’enseignement (écoles, cours, co-tutelles de thèse).
Responsables : Jaroslav Nešetřil (CZ) et Jean-Sébastien Sereni (FR).
142
Part IV
143
Chapter 1
The group is composed of 19 permanent members, 7 post-doctoral researchers and 12 PhD students.
Throughout this period, 6 permanent members (V. Berthé, L. Bienvenu, T. Colcombet, M. Gehrke,
Ł. Kaiser, S. Perifel) joined the group and one left it (L. Boasson, retired in 2010). It has been reinforced in several existing topics (automata, logic algebra and games; dynamical systems; Kolmogorov
complexity) and new ones have been introduced (duality theory; circuit complexity; algorithmic randomness; discrete geometry).
1.1
Research areas and main objectives
One of the challenges of computer science is to manipulate objects from an infinite set using finitary
means. Of course mathematics is well accustomed to deal with infinite sets, but it is computer science
that brings a completely new dimension to the picture, namely effectiveness. Most of the research of the
team is related to this very general challenge: finite automata, circuits, cellular automata, discrete dynamical systems, Turing machines and many other objects studied in the group form various approaches
to this problem.
The historical core of the group is the study of (possibly multi-tape) finite automata and associated
concepts: e.g. regularity, rationality, recognisability, sequentiality, algebraicity, syntactic semigroups,
varieties, combinatorics on words and program schemes. M.-P. Schützenberger and M. Nivat are probably two prominent examples of historical members of the group that have deeply contributed to these
areas.
Over the years, the spectrum and the expertise of the team has expanded whilst remaining true to its
heritage. Connections with verification have motivated many of these changes: new models were considered (infinite words, ordinals, finite and infinite trees), logic (monadic or temporal) had taken a central
role (completing the connection with algebra and automata), more expressive machines have been considered (pushdown automata, higher-order recursion schemes), games have been proved valuable for
modelling as well as for the theory of automata on infinite objects. Complexity has also been more
intensively studied: whilst Kolmogorov complexity was the only subtopic studied five years ago, recent recruitments has allowed the team to develop an expertise in algorithmic randomness as well as
on circuit and algebraic complexity. Finally, thanks to new members of the team discrete dynamical
systems, historically present in the study of numeration systems and in the study of cellular automata,
have become increasingly important in the team, leading to new applications/motivations e.g. in discrete
geometry.
In the following we have single out several central themes developed in the group during the last five
years. It should not be seen as a partitioning of the team but rather as a division into themes that mostly
interact with each other.
145
CHAPTER 1. RESEARCH REPORT: AUTOMATA AND APPLICATIONS
Recognisability
One of the central concepts that have emerged in response to this challenge is that of recognisability,
whose combination with finite automata (close to the implementation of systems), logic (a sophisticated framework to specify properties of a structure) and algebra (providing essential tools available
neither in logic nor in automata theory) has proved incredibly fruitful. Topology is another powerful
tool. Profinite methods were used to study regular languages of words [BP09; Pin09; Pin11a; PS11]
and to handle classical operations, e.g. the concatenation product [BP09; CPSE09; Pin11b] or the shuffle operation [BBCPR10; BCR08; CP12]. Extended Stone-Priestley duality, a very promising notion of
recognisability has been proposed in [GGP08] and [GGP10]; duality has also been applied to domain
theory, λ-calculus and program design and verification [CGR12; Geh11; GV11]. Another connection between topology, algebra and automata theory is given by the Wagner hierarchy [CD08; CD09a; CD09b;
CDFM09]. There are also natural and fruitful connections with number theory, e.g. for the study of
expansions with rational bases [AFS08; FK12b].
It is a challenge to extend the known results on finite words to other settings while preserving the equivalence between automata, logic and algebra. Several major results have been obtained in this direction
for words indexed by linear orderings: the appropriate notions of automata, of recognisable and rational languages have been identified, their logical and algebraic properties have been thoroughly studied
[BBCR08; BBCR10; BC07; BC11; BCS09; CCP11; CR07; Cri09] and specific combinatorial tools have
been designed [Col10]. An equivalence between algebra and logic was also unconvered for data words
[CLP11]. Regular cost functions form a quantitative extension to the theory of regular languages that
preserves the milestone equivalences of regular languages. It has been studied for finite words [Col09]
where algebra plays the central role and this approach allowed to characterise several natural subclasses
of regular cost functions [CKL10; Kup11]. Developing regular cost functions and their applications in
the tree framework required the use of games [CL08a; CL08b; CL10; KB11].
Another important line of research is the study of relations over words and their logical descriptions.
Topics include multitape automata and relations on infinite alphabets [CG09a; CG09b; Cho11], relations
on infinite words [Car09; Car10; CFS08], rational relations [CDV07; CDV10; CG12a; CK09; CK11b].
Regarding logic, several decision problems were solved for Presburger logic [CF07; CF10; Cho08] and
the “equal last letter” predicate for words on infinite alphabets [CG09b] or tractable cases of the inclusion problem of context-free languages [BCR09; BCR11]. Expressiveness of FO[+] was also studied
[CMMP10].
Games and logic
Games play a central role in automata theory and logic. Connections between imperfect information
games [GS09] and tree automata were fruitfully used to define the first class of probabilistic automata on
infinite trees with a decidable emptiness problem [CHS11]. The use of (stochastic) games in automata
theory often relies on the existence of finite memory strategies, which constitutes an important line of
research [GZ07a; GZ07b; GZ08; GZ12; Zie10].
Together with automata and logic, games are also useful for modelling and verifying complex systems.
One task is to construct mathematical models of systems in which interactions between multiple players
take place, in order to better understand such systems and to develop algorithms and tools to analyse
them. A construction tracking information in coordination games with imperfect information was proposed, with new applications in the analysis of multi-player games with imperfect information [BKP11].
A generic method for computing evaluation functions (a key object in the understanding of games) from
a specification expressed in a certain logic was introduced [KS11a]. Another task is to find descriptions of infinite state systems enjoying decidable model-checking problems: here, automata are used in
the description of the system, while games permit one to solve the model-checking problem. Central
146
contributions have been obtained in the understanding of monadic second-order logic over higher-order
recursion schemes [BCHS12; BCOS10; CHMOS08; CS12; HMOS08] and in the study of automatic
structures [Kai11]. Connections with regular model-checking motivate the study of partial commutations [CGP08; CM10; CP08]
Automaton Semigroups, Braids Groups
Recognisability is one deep connection between automata and (finite) semigroups. In the team we are
also concerned with two completely different relations between (possibly multitape) automata and (possibly infinite) semigroups: automata are used either to generate semigroup elements (as in automaton
semigroups) or to represent and multiply them (as in automatic semigroups). In both cases, the presence of automata provides a powerful combinatorial and algorithmic framework to study the semigroups.
One focus of the group is on braids (interlaced strands with fixed endpoints). Braids have a natural
group structure, which is known to be automatic, and they are connected to many areas in mathematics
(algebra, geometry, topology) and physics. We investigated the existence of a polynomial algorithm
to minimise the length (number of crossings) of a given braid. In the case of 3-strand braids, such an
algorithm exists. Another related question is the rationality of the growth series enumerating braids
according to their length. These series are a way to capture the combinatorial structure of the groups.
The question was answered by the affirmative for positive braids [AN09], for 3-strand braids, and is
open for 4-strand braids. The braid groups admit alternative automatic/Garside structures different from
that first proposed by Thurston. Part of the Garside theory developed for braid groups can be applied to
various other groups (generalised braid groups, torus link groups, one-relator groups with center, etc).
Recent work contributed to the challenging classification of such automatic structures [CP11].
Mealy machines (i.e. a deterministic two-tape automata) can be use to describe semigroups. Indeed,
such a machine defines, for each initial state, a mapping from input to output words. The collection of
these mappings generates a semigroup called an automaton semigroup. This construction, formally
introduced half a century ago, became very popular in group theory to build examples and counterexamples. For instance, Grigorchuk proved the existence of groups with intermediate growth using
Mealy automata.We studied such semigroups with an automata-theoretic point of view and considered
the classical decision problems: the word problem is decidable, the conjugacy problem is undecidable,
and the finiteness problem is open. We have centred our efforts on this last problem, obtaining encouraging preliminary results [AKLMP12]. On top of this, we worked on computational aspects improving
the existing algorithms for the computation of the growth series [KMP12].
Computational Complexity, Algorithmic Randomness
Automata can also be seen as calculating machines. In the deterministic case, the relevant object is the
minimal automaton: the worst-case behaviour of Hopcroft’s minimisation algorithm has been precisely
analysed in [BBC09] and suprising connextions with Sturmian Trees [BBCF07; BBCF10] have been
made. Minicomplexity, i.e. the study of various types of automata from a complexity point of view, has
been developed in [Kap11b; Kap12a; Kap12b; KKM12] exhibiting connections with central questions
on well-known complexity classes [KP12b].
Circuit complexity is another approach to computability that is developed in the group, with a special
focus on circuit lower bounds. Knowing the size of circuits required to solve classes of problems is at
the very heart of complexity theory since it amounts to evaluate how much resource (time, space, etc.)
is needed for the problems. Both Boolean and algebraic complexity are considered. Among others,
in the algebraic setting strong links between lower bounds on decision and on evaluation problems
have been proved [KP09c; KP09d] as well as important results separating algebraic branching programs
from formulas in the multilinear world [DMPY12]. In the Boolean setting, algorithmic randomness
147
and derandomisation are studied and in particular their connections with resource-bounded Kolmogorov
complexity.
The goal of algorithmic randomness is to give a precise mathematical meaning to the notion of random
object. For finite objects, this is usually achieved using the notion of Kolmogorov complexity while for
infinite objects (usually real numbers), the most popular definition of randomness is the one proposed
by Martin-Löf. Among Martin-Löf random reals, Chaitin’s Omega numbers (a particular subclass) have
received tremendous attention and our team has obtained very interesting results in this direction. We
gave a large class of examples of higher random reals which have a mathematical significance and we
developed methods to transfer many-one completeness results of index sets to higher randomness of
associated probabilities [BG07; BG09]. We have shown that Omega numbers induce a natural class of
computable upper bounds for Kolmogorov complexity (called Solovay functions), and which proved to
have many remarkable properties [BMN11]. Relationship between algorithmic randomness and classical
analysis have been investigated showing surprising connections between Martin-Löf randomness and the
Lebesgue density theorem [BHMN12]. We recently initiated a study of Kolmogorov complexity from
the point of view of axiomatic theories [Tav11; Tav12] and another one on the notion of randomness
extraction in the setting of algorithmic randomness [BM12b].
Cellular automata are another popular model of computation that captures all features of massive parallel computing with inherent scalability issues. One focus is on algorithmic and programming considerations. We experimented around synchronisation issues [Yun08b; Yun09]. We conducted research into
extracting from this program a suitable algorithm freeing the user from the physical constraints (modularity and semantics), to consider a compilation to these machines (efficient, mobile, scalable)[Yun08c]
and to build an execution support system (dynamical synthesis of execution supports, sequencing, context changes) [Yun10a].
Discrete Dynamical Systems
A cellular automaton can also be seen as a discrete dynamical system, i.e. as a map acting on a
set of states. In a cellular automaton the contents of all the cells evolve synchronously, each content
evolving in function of the content of a few cells in its neighbourhood, according to a local rule. To take
into account random events, one is led to consider probabilistic versions of cellular automata, where
the local rule is randomly chosen, independently of the others, according to a distribution depending
only on a finite neighbourhood of the cell. Probabilistic cellular automata appear in statistical physics
and in combinatorial problems related to the enumeration of directed animals. Lastly in the context of
classifying cellular automata, their robustness to random errors can be used as a discriminating factor.
Major questions concerning their study are investigated in the team. Is it possible to describe explicitly
the stationary measures? Is it possible to evaluate the convergence time to equilibrium? How can
one sample according to the stationary measure (random generation)? See in particular [BMM11] for
an efficient perfect sampling algorithm, and [BFMM12], where the density classification problem is
addressed. In [CM11] a probabilistic cellular automaton on {0, 1}Z is exhibited which is non-ergodic
although it has a unique invariant measure which answers in the negative an old open question.
More precisely, we focus on three families of non-standard numeration systems, namely beta-numeration
with Pisot bases [AFH07; AFSS10], negative bases [FL09; FL11; LS12; Ste12a] and rational bases
[AFS08; FK12b]. In particular, studying expansions with rational bases or, more generally algebraic
numbers that are not algebraic integers, is notoriously difficult; in [AFS08] a new and intriguing class
of rational base expansions for integers and real numbers has been introduced with the set of representations of the natural integers being not a context-free language; note the deep connections with the
Mahler problem on the distribution modulo 1 of the powers of 3/2. Our main tools come from automata theory, discrete mathematics, symbolic dynamics and our main application fields are cryptography [FS08; GS11], computer arithmetics [FPS11], quasicrystallography, and discrete geometry [Ber11a;
148
BF11; BL11a; JK12a; JK12b]. Our problems are varied and issued from number theory (transcendence
issues [AF09], Diophantine approximation and continued fractions [BF11; DKS09]), as well as from
symbolic dynamics (substitutive dynamical systems [BJS12], tilings and connections with fractal geometry [BSSST11; KS12]), or else from computer arithmetics. Application of profinite methods to numeration was obtained in [PS08] where a noncommutative extension of Mahler’s theorem on interpolation
series is presented.
1.2
Selected results of significance
The paper [GGP08] received the best paper award in ICALP’08. Together with [GGP10] these papers
propose a new notion of recognisability. They depart from the classical approach by three specific
features : (1) it does not rely on automata, (2) topology, and in particular extended Stone- Priestley
duality, is the key ingredient, (3) it applies to lattices of subsets rather than to individual subsets. A
major consequence is that any lattice of regular languages can be defined by a set of profinite equations.
See also [BP09; Pin09].
The paper [CCP11] received the best paper award in ICALP’11. It describes algebraically the expressive
power of monadic second order logic over countable linear orderings. Decidability of this theory was
known from the pioneer work of Rabin and Shelah but the paper provides a much more precise analysis
of this logic. It has several important consequences: the first known collapse result of the logic to a
specific fragment, and a natural solution to a question left open by Gurevich and Rabinovitch in 2002.
It also paves the way to a theory classifying the expressiveness of fragments of monadic second-order
logic over linear orderings.
The paper [DMPY12] presented in STOC’12 makes a significant improvement in an important question
in algebraic complexity. It concerns the power of alternative computation models such as formulas
(circuits whose underlying graph is a tree) and algebraic branching programs (or ABP, directed graphs
that compute a polynomial defined as the sum of the weight of all paths from a source to a sink).
Whether these two restricted models are equivalent to unrestricted circuits is open. This work managed
to separate ABPs from formulas in the multilinear world, thus improving the best separation from Raz
between circuits and formulas.
1.3
Scientific service and influence, honors and prizes
The team and its members have a strong international visibility as demonstrated by its leadership
in several international projects and collaborations. As a prominent example, let us mention the ESF
Research networking programme Automata: from Mathematics to Applications (AutoMathA) which
was a five-year (2005–2010) multidisciplinary programme at the crossroads of mathematics, theoretical
computer science and applications. It involved 15 European countries and was chaired by J.-É. Pin. The
handbook dedicated to combinatorics, automata, and number theory that was co-directed by V. Berthé
[BR10a] is another example of our international visibility. Members of the groups were involved in 13
different international projects and had the (co-)leadership of 8 of them. The group is also represented in
editorial boards/program committees of international journals and committee (6 different journals, and
more than 50 conferences including the most prestigious ones in the area).
The quality of the scientific productions of the team has been recognised by several prizes: CNRS
Bronze medal awarded to T. Colcombet in 2011, ERC Starting Grant awarded to T. Colcombet in 2010,
Prize and subvention of the Simone and Cina del Duca Foundation awarded by the French Academy of
Science to J. Mairesse in 2009, election of J.-É. Pin to the Academia Europeae, and best paper awards
in prestigious conferences (ICALP’08 for [GGP08], ICALP’11 for [CCP11] and Int. Conf. on Petri
Nets’11 for [HMN11]).
The team has also an important role on the national scale as demonstrated by the numerous participations
149
in the scientific community and administrative responsibilities (e.g. in CNRS instances, in FSMP, in
Fédération de Recherche, in Groupements de Recherche, in learned societies), by its implication in 11
national projects and by the numerous habilitation and PhD reports written by the members of the team.
On a local scale, the group is also very active in interactions with other teams from LIAFA (4 joint
publications, 2 joint thesis) as well as with other groups (PPS, Mathematical Logic group & Operator
Algebra group in IMJ) within the foundation Sciences Mathématiques de Paris .
The group is involved in scientific mediation. Two of our PhD students, I. Markovici and A. Taveneaux,
are members of the steering committee of Mathematic Park, a seminar for high school and undergraduate
students and their teachers 1 . O. Serre gave a tutorial for grandes écoles computer science teachers on
game theory 2 . J. Mairesse was the scientific advisor for the movie Le modèle Turing produced by CNRS
Images in 2012, and on the same topic he took part to the Researchers’ Film Festival 3 . The group is
also very active in the yearly fête de la science.
1.4
Internal organization
Scientifically, the group is structured by a weekly seminar (followed by all members of the group) and
several working groups (currently there are three such groups!). The PhD students are also very active
in a dedicated seminar (joint with PPS). At the beginning of every year, a day is spent in welcoming the
newcomers and discussing research directions. There are also frequent extemporaneous meetings with
the numerous researchers visiting the group as well as with our PhD and master students.
Both science and financial policies are discussed in an horizontal manner. The selection of candidates
supported by the group for permanent (university, CNRS) or temporary (invited professor, post-doc,
PhD) positions is made by the whole group and always by consensus. So far the group had enough
funded projects to support its activities, and, when needed, a member not being in a funded project gets
support by another project in the group.
1. See http://www.ihp.fr/fr/seminaire/mathematic-park
2. See http://www.cirm.univ-mrs.fr/liste_rencontre/programmes/ProgMonasse209.pdf
3. See http://www.filmdechercheur.eu
150
Chapter 2
Nom du directeur de l’unité : Pierre Fraigniaud
Nom du responsable de l’équipe : Olivier Serre
2.1
Effectifs
Personnels qui ont quitté l’équipe: L. Boasson (retraite en septembre 2010, 44 mois), 11 doctorants
(396 mois), 7 postdocs (66 mois), 2 delégation CNRS (32 mois).
Recrutement: T. Colcombet (CR, 2007), S. Perifel (MdC, 2008), L. Bienvenu (CR, 2009), V. Berthé
(DR, 2010), Ł. Kaiser (CR, 2010) et M. Gehrke (DR, 2011).
2.2
Reconnaissabilité. Nous avons donné une nouvelle notion de reconnaissabilité basée sur la dualité de
Stone-Priestley étendue [GGP08; GGP10]. Nous avons introduit les fonctions régulières de coût
[Col09], une extension quantitative des langages réguliers et organisé un workshop autour de ces
problématiques.
Jeux et logique. Nous avons étudié la logique MSO en particulier sur les ordres linéaires dénombrable
[CCP11] et sur les schémas récursifs d’ordre supérieur [HMOS08] (sujet sur lequel nous avons
organisé un workshop). Nous avons développé une forte expertise dans le domaine des jeux
stochastiques et des jeux à information imparfaite [GS09; GZ07a].
Semigroupes d’automates, groupes de tresses. Nous avons obtenu des résultats sur le problème difficile de la décidabilité de la finitude pour les semigroupes d’automates [AKLMP12]. Nous avons
par ailleurs étudié les groupes de tresses à la fois d’un point de vue combinatoire [AN09] et du
point de vue de la théorie de Garside [CP11].
Complexité, théorie effective de l’aléatoire. Nous avons renforcé et développé ces thématiques et
obtenus des résultats importants en complexité algébrique [DMPY12], en complexité de Kolmogorov [BMN11] et en théorie effective de l’aléatoire [BM12b] (sujet sur lequel nous avons
organisé un workshop).
Systèmes dynamiques discrets. Nous avons étudié les automates cellulaires probabilistes et tout particulièrement les mesures stationnaires [BMM11; CM11]. Nous avons étudiés les systèmes
de numération non-standard à l’aide d’outils provenant de la théorie des automates, des
mathématiques discrètes et de la dynamique symbolique, donnant des applications en cryptographie, arithmétique des ordinateurs et géométrie discrète.
151
CHAPTER 2. FICHE RÉSUMÉ: AUTOMATES ET APPLICATIONS
2.3
2.3.1
Bilan quantitatif
Publications
[GGP08] Mai Gehrke, Serge Grigorieff, Jean-Éric Pin. “Duality and Equational Theory of Regular Languages.” In: Proceedings of Automata, Languages and Programming, 35th International Colloquium (ICALP’08). Vol. 5126. Lecture Notes
[CCP11] Olivier Carton, Thomas Colcombet, Gabriele Puppis. “Regular Languages of Words over Countable Linear Orderings.” In: Proceedings of Automata, Languages and Programming, 38th International Colloquium (ICALP’11).
[DMPY12] Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff. “Separating multilinear branching programs and
formulas”. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC’12). To appear. ACM,
2012.
[HMN11] Serge Haddad, Jean Mairesse, Hoang-Thach Nguyen. “Synthesis and Analysis of Product-Form Petri Nets.” In:
Proceedings of Applications and Theory of Petri Nets, 32nd International Conference (PETRI NETS’11). Vol. 6709.
[AFS08] Shigeki Akiyama, Christiane Frougny, Jacques Sakarovitch. “Powers of rationals modulo 1 and rational base number
systems”. Israel J. Math. 168 (2008), pp. 53–91.
2.3.2
Habilitation à Diriger des Recherches: Jean-Baptiste Yunès, À propos d’automates cellulaires suivi par
Des fonctions Booléennes, décembre 2007.
2.3.3
Rayonnement
1. Médaille de bronze du CNRS pour T. Colcombet en 2011, prix de la fondation Simone and Cina
del Duca pour J. Mairesse en 2009, prix des meilleurs articles dans plusieurs conférences de
premier plan (ICALP×2, Int. Conf. on Petri Nets).
2. T. Colcombet a reçu un “ERC Starting Independent Researcher Grant” en 2010.
3. J.-É. Pin a été le responsable du networking programme Automata: from Mathematics to Applications (AutoMathA) financé par la European Science Foundation (ESF).
4. Nombreuses activités éditoriales: direction d’une revue, nombreuses participations à des comité
éditoriaux/programme de revues et de conférences de premier plan.
5. Nombreuses invitations dans les conférences les plus importantes du domaine.
2.3.4
Interactions de l’équipe avec son environnement
1. Implication dans les organes décisionnaires de plusieurs institutions: CNRS (V. Berthé and
J. Mairesse), FSMP (V. Berthé) et FR 2830 (J. Mairesse).
2. Forte implication dans le GDR Informatique Mathématique.
3. J. Mairesse a été conseiller scientifique pour le film “Le modèle Turing” produit par CNRS Images
en 2012, et il a participé au “Festival du filme de chercheur 2012”.
4. Mathematic Park: séminaire pour jeunes étudiants et lycéens; MATh.en.JEANS.
5. Vulgarisation: Cité des Sciences et de l’Industrie, Collège Belgique, La Recherche.
2.3.5
1. Masters (M2) de Paris Diderot: “Master Parisien de Recherche en Informatique” (4 cours).
2. Cours à l’École de Printemps d’Informatique Théorique (EPIT), à l’École Jeune Chercheurs en
Informatique Mathématique (EJCIM) et à la Spring School on Algorithmic Game Theory.
3. Enseignement auprès de professeurs du secondaire dans le cadre de la formation au futur enseignement ISN (Informatique et Science du Numérique).
4. Participation récurrente au concours d’entrée dans les ÉNS.
152
Chapter 3
Laboratory’s name: LIAFA, UMR 7089
Laboratory director’s name: Pierre Fraigniaud
Team leader’s name: Olivier Serre
3.1
Members
Permanent members who left the team: L. Boasson (retired since September 2010, 42 months), 11
PhD students (396 months), 7 postdocs (66 months), 2 “delégation CNRS” (32 months).
Hiring: T. Colcombet (CR, 2007), S. Perifel (MdC, 2008), L. Bienvenu (CR, 2009), V. Berthé (DR,
2010), Ł. Kaiser (CR, 2010) et M. Gehrke (DR, 2011).
3.2
Scientific outcomes
Recognizability. We gave a new notion of recognizability based on extended Stone-Priestley duality
[GGP08; GGP10]. We introduced regular cost functions[Col09], a qualitative extension of regular
languages and we organised a workshop on this topic.
Games and Logic. We studied MSO logic, in particular on countable linear ordering [CCP11] and
on higher-order recursion schemes [HMOS08] (we organised on this topic a workshop). We
developed a strong expertise on stochastic games and on imperfect information games [GS09;
GZ07a].
Automaton Semigroups, Braids Groups We obtained results on the difficult problem of deciding
finiteness for automaton semigroups [AKLMP12]. We also studied braids groups using combinatorial approaches [AN09] and from Garside’s theory point of view [CP11].
Computational Complexity, Algorithmic Randomness. We reinforced and developed these themes
and obtained important results in algebraic complexity [DMPY12], in Kolmogorov complexity
[BMN11] and in effective randomness [BM12b]. We organised a workshop on the latter.
Discrete Dynamical Systems. We studied probabilistic cellular automata, in particular stationary measures [BMM11; CM11]. We studied non-standard numeration systems using tools from automata
theory, discrete mathematics and symbolic dynamics, providing applications in cryptography,
computer arithmetics and discrete geometry.
3.3
3.3.1
Publications
[GGP08] Mai Gehrke, Serge Grigorieff, Jean-Éric Pin. “Duality and Equational Theory of Regular Languages.” In: Proceedings of Automata, Languages and Programming, 35th International Colloquium (ICALP’08). Vol. 5126. Lecture Notes
153
CHAPTER 3. EXECUTIVE SUMMARY: AUTOMATA AND APPLICATIONS
[CCP11] Olivier Carton, Thomas Colcombet, Gabriele Puppis. “Regular Languages of Words over Countable Linear Orderings.” In: Proceedings of Automata, Languages and Programming, 38th International Colloquium (ICALP’11).
[DMPY12] Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff. “Separating multilinear branching programs and
formulas”. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC’12). To appear. ACM,
2012.
[HMN11] Serge Haddad, Jean Mairesse, Hoang-Thach Nguyen. “Synthesis and Analysis of Product-Form Petri Nets.” In:
Proceedings of Applications and Theory of Petri Nets, 32nd International Conference (PETRI NETS’11). Vol. 6709.
[AFS08] Shigeki Akiyama, Christiane Frougny, Jacques Sakarovitch. “Powers of rationals modulo 1 and rational base number
systems”. Israel J. Math. 168 (2008), pp. 53–91.
3.3.2
Habilitation à Diriger des Recherches: Jean-Baptiste Yunès, À propos d’automates cellulaires suivi par
Des fonctions Booléennes, décembre 2007.
3.3.3
1. CNRS bronze medal awarded to T. Colcombet in 2011, prize and subvention of the Simone and
Cina del Duca foundation awarded to J. Mairesse in 2009, best paper awards in prestigious conferences (ICALP×2, Int. Conf. on Petri Nets).
2. T. Colcombet has obtained an “ERC Starting Independent Researcher Grant” in 2010.
3. J.-É. Pin was the head of the ESF networking programme AutoMathA.
4. Editorial duties: Editorial board chairing of a journal, many participations to editorial boards and
conferences program committees.
5. Invited talks in the most prestigious conferences.
3.3.4
Interactions between the team and its environment
1. Implication in decision making bodies of several institutions: CNRS (V. Berthé and J. Mairesse),
FSMP (V. Berthé) and FR 2830 (J. Mairesse).
2. Strong implication in the GDR Informatique Mathématique.
3. J. Mairesse was the scientific advisor for the movie “Le modèle Turing” produced by CNRS
Images in 2012, and on the same topic he took part to the “Researchers’ Film Festival”.
4. Mathematic Park: seminar for young students; MATh.en.JEANS.
5. Popularization: Cité des Sciences et de l’Industrie, Collège Belgique, La Recherche.
3.3.5
Teaching
1. Masters (M2) from Paris Diderot: “Master Parisien de Recherche en Informatique” (4 courses).
2. Lectures at the École de Printemps d’Informatique Théorique (EPIT), at the École Jeune
Chercheurs en Informatique Mathématique (EJCIM) and at the Spring School on Algorithmic
Game Theory.
3. Lectures for high school teachers for the speciality “Informatique et Science du Numérique”.
4. Recurrent implication in the board of examiners for ÉNS.
154
Chapter 4
4.1
Research objectives
As demonstrated in the research report, the various subtopics studied in the Automata and Applications
team are intimately connected and of course these interactions will remain as the core specifiality of the
group. In the following we identify some important challenges in the domain of expertise of the group
that we plan to work on during the forthcoming years.
Frontiers of Recognisability
We propose to develop and exploit a radically new approach to the notion of recognition both within
and beyond regular languages and, via a novel connection to topological duality theory, in semantic
modelling.
The first task is to complete the foundational work outlined in [GGP08], which covers several aspects.
The fundamental observation is that, in Stone duality, the dual space of the Boolean algebra Reg of
regular languages is the free profinite semigroup introduced by Reiterman. Then sublattices of Reg can
be viewed as quotients of the dual algebra and thus can be defined by equations. But the idea of Stone
duality is so general that it can be applied to many other settings, and in particular to infinite words,
trees or data words. Advanced topology is needed: although metric spaces give the right intuition they
are not sufficient to cover all cases. A further challenge would be to explore the duality beyond regular
languages, but the dual spaces become much more complicated: even on a one-letter alphabet, the dual
space of the set of all languages is the Stone-Cech compactification of the natural numbers, a space
known as the three headed monster.
The second task is to develop a battery of algebraic tools. Although there is an important existing literature on finite semigroups, the specific needs of this project require a deep understanding of the algebraic structures (semigroups, ordered semigroups, ω-semigroups, forest algebras, multi-sorted algebras,
stabilisation monoids). This encompasses structure theorems involving algebraic tools like semigroup
expansions, semidirect product decompositions, Mal’cev products, pointlike sets, etc. For instance, a
structure theorem for forest algebras similar to the Krohn-Rhodes theorem is probably the key to the
solution of the decidability of FO on trees. Another key algebraic tool is the use of syntactic invariants
for deciding subclasses of languages (e.g. defined by logical fragments) For words, the Grail in this
direction would be to solve the long-standing open problem of the decidability of the Σn hierarchy of
FO[<], but any partial answer in this direction would be welcome. Other interesting fragments include
FO[< + MOD], fragments of temporal logic or fragments occurring in database theory (words with
data). Beyond regular languages, we would like to attack such problems as Straubing’s conjectures for
circuit complexity classes.
Relative to semantic modelling, we want to use the concept of recognition to advance various topics
such as the model theory of the lambda calculus, the search for incremental coalgebraic descriptions of
155
CHAPTER 4. RESEARCH PROJECT: AUTOMATA AND APPLICATIONS
algebraic logics, and the link between domain theory and algebraic logic.
Our short term project is based on the ANR project FREC (Frontiers of recognisability), a joint project
with LaBRI. There are other active research groups that deal with some of the topics we want to discuss.
For instance, Aachen, LSV (Cachan), LIFL (Lille), Szeged and Warsaw are very well placed on the
interaction between logic and automata for tree languages, including applications to verification, with
also a strong algebraic flavour in Szeged and Warsaw. Boston, Brno and Porto have strong expertise
on the algebraic approach for automata on words, with a tree flavour in Boston as well. Expertise
on the topological aspects of automata theory can be found in Lausanne, Novosibirsk, Nijmegen and
Würzburg. Aachen again, Darmstadt and Leipzig are important centers for what concerns automata
with quantitative data.
Games and Logic
The relationships between games, logic and automata is a topic where the expertise of the group has
been internationally recognised for more than ten years (the group was one of the eight teams involved
in the EU Research and Training Network Games and Automata for Synthesis and Validation in 2002).
In order to strengthen our position we will focus on three promising topics and combine them: imperfect
information, multiplayer setting and quantitative aspects.
Imperfect information is a standard notion in classical game theory, and is also very natural in computer
science when modelling real phenomena occurring in the analysis of complex systems. Unfortunately,
shifting from the perfect to the imperfect information setting strongly modifies the landscape: first,
one needs to use randomised strategies; second many decidable problems become undecidable. The
main task is to find tractable classes of imperfect information games by restricting the arenas and/or
the winning condition/payoff function. This innovative and interdisciplinary topic is supported by a
PEPS pluridisciplinary project involving computer scientists from LaBRI (Bordeaux) and mathematicians from Univ. Paris 6 and Univ. Toulouse 1.
While multiplayer games are classically considered for modelling economic behaviours, our objective
will be significantly different. Indeed, our motivation is the analysis of those games that arise when
verifying distributed systems, or in mechanism design. Therefore, the imperfect information setting is
the natural one, which leads to even more challenging problems. In particular, it is necessary to study
epistemic dependencies between players. This work, initiated in [BKP11], will be done in collaboration
with researchers from RWTH Aachen and LSV (Cachan).
A third direction is the extension of games with quantitative measurement. In the context of qualitative verification, the games of interest are often Boolean (one player is winning, the other is loosing).
However, it recently appeared that quantitative verification deserves much attention, e.g. to study the
amount of resources that a system has to consume to perform a given task. This trend is reflected in the
study of quantitative variants of automata, logic, and games. The thesis of L. Daviaud fits in this topic.
The theory of cost functions is a particularly rich playground of this kind and is actively studied in the
setting ERC starting grant GALE. In particular, the key open question in the field is the decidability of
cost-monadic logic over infinite trees. It boils down to provide a correct description of the structure of
winning strategies in suitable games.
We also envision one more direction of study: the investigation of practical applications of finite model
theory and combinatorial games. Recent results obtained in descriptive complexity theory, especially the
confirmation by Grohe that LFP+C captures PTime on a large class of models, suggest that fixed-point
logics with counting could indeed be used for programming. The benefits of representing a program
as a logic formula are most evident if symbolic analysis of the program is necessary. For example,
in [KS11a], this idea was exploited to automatically generate position evaluation functions in board
games in which the winning condition is programmed by a logic formula. Another way to benefit from
156
representing the programs in logic is when a program is to be learned, or induced, based on a number
of positive and negative examples. Using logics of different expressive power, such as first-order logic,
first-order with the transitive closure operator, and also the existential and guarded fragments, allows
learning to proceed from the simplest logic to the most expressive one. This technique was used in
[Kai12], together with a representation of games by structure rewriting, to learn board game rules from
very few example plays. These results encourage us to search for further applications of finite model
theory, graph rewriting and combinatorial games in AI and other practical domains.
Infinite State Systems and Verification
Concerning infinite state systems, on top of continuing our fundamental research we plan to look for
applications to verification. Our first approach will be to use tree-automatic structures to model various
classes of systems (e.g. concurrent systems involving recursive procedure calls) and to look for decidable
model-checking problem. This work will be done in collaboration with the Verification group, with
LSV, with D. Kuske group in Ilmenau and with M. Lohrey group in Leipzig (a Procope project has been
submitted)
The second approach is based on higher-order recursion schemes and collapsible pushdown automata
(CPDA), two equivalent formalisms to model higher-order functional programs. We started to develop a
model-checker for a toy language using saturation methods for CPDA [BCHS12] and once a first prototype is ready we will work with the Verification group to consider extension and alternative approaches
(e.g. Abstraction, CEGAR. . . ). A related line of research is to develop algorithms working directly on
the scheme/program which is closer to what a developer would expect. Theoretical results on CPDA
games showed that one can annotate the source code with information arising from the verification.
Even better, synthesis questions, involving the automatic production of a code from a partial code and
a specification, can also be resolved. Whether this can be achieved in practice is a challenging problem. This line of research will be developed in collaboration with L. Ong’s group in Oxford and with
A. Carayol (LIGM) and supported by various ongoing projects (ANR AMIS and two EPSRC projects).
We are also convinced that it is a domain where collaboration with researchers from PPS will be successful: P.-A. Melliès and O. Serre will co-supervise the PhD thesis of C. Grellois on this topic starting
in September 2012.
Discrete Dynamical Systems
We plan to strengthen our dynamical approach of numeration systems in two directions, namely the
study of the nonunit case, and second, escaping the Pisot algebraic case. The dynamical study of numeration systems with algebraic parameters relies on their self-similarity properties. Substitutions play
a prominent role in this context. The term “substitution” encompasses symbolic replacement rules that
act on words (generating symbolic dynamical systems), and more generally replacement rules acting on
finite sets of compact subsets of Rd (generating tiling spaces, the most celebrated example being the
Penrose tiling). A natural generalisation of substitutive symbolic dynamical systems arises when one
considers the dynamical system obtained by iterating not one, but several substitutions taken from a
finite set S of substitutions: such systems are said S-adic. These systems, have hierarchical structure,
but the hierarchies are not necessarily the same at each level (as it is the case for purely substitutive
systems), with only finitely many different possible structures at each level. The investigation of S-adic
dynamical systems yields to challenging problems. Motivations for this study are issued from discrete
geometry (generation of discrete planes), Diophantine approximation (mutidimensional continued fractions and gcd computations), spectral study of symbolic dynamical systems, word combinatorics, fractal
geometry, tiling theory, numeration systems, etc...
An ANR project with Austria has been submitted on these topics in the prolongation of the 3 PHC
programs where members of the team were involved.
157
The study of equilibrium behaviour for probabilistic cellular automata (PCA) yields numerous problems. A challenging problem in this area is the positive rates conjecture, that is, the updated content
of a cell can be any letter with a strictly positive probability. The positive rates conjecture states that
any one-dimensional (E = Z) cellular automaton with positive rates is ergodic, i.e. has a unique and
attractive invariant measure. Gács exhibited in 2001 a very complex counter-example in a paper of more
than 200 pages. This counter-example is far from being completely understood, and its validity is still
questioned by some specialists. Even if the conjecture fails to hold, it would be important to know its
domain of validity. For instance, is it true for small alphabets and neighbourhoods ? Any progress in this
area would be a milestone. The positive rate conjecture is somehow linked to the classification problem
detailed above.
The second natural question is whether the stationary measure can be explicitly computed. Furthermore,
simulating PCA is known to be a challenging task. Simulations cost a lot of time and space (especially
in 2D) and configurations cannot be tracked down one by one and may only be observed through some
measured parameter. Two questions are in order : what reliable deductions can we make from simulations? How can we obtain theoretical results that are meaningful for realistic sizes? A first step in
this direction has been made in [BMM11]. The simulator that was developed is quite efficient in some
situations. We plan to continue to develop it, and to integrate it in SAGE.
The relaxation time of a PCA is defined as the expected time to reach equilibrium from its worst initial
configuration. Phase transitions phenomena have been observed through simulations on some PCA. We
conjecture that the polynomial/exponential phase transition for the relaxation time is deeply connected
to the trivial/non-trivial invariant measures phase transition. This conjecture will be investigated by
J. Mairesse and I. Marcovici in collaboration with N. Schabanel from the Distributed algorithms and
graphs group.
Automaton Semigroups, Braids Groups
The 4-strand braids will receive a special attention. Indeed, while the 3-strand setting is well studied,
very few is known in the 4-strand setting. In collaboration with the Combinatorics group (A. Micheli
and D. Poulalhon) we are investigating the existence of a polynomial algorithm to minimise the length
of a given braid. Another related question that we are investigating is the rationality of the growth series
enumerating 4-strand braids according to their length. We also plan to work on the classification of the
braid groups according to their automatic/Garside structures.
Random walks is another topic related to braid groups. The random walker traverses the Cayley graph
of the group by moving randomly to a neighbouring node at each time step. Here, thanks to automaticity
of the group and the underlying automata, one can carry out explicit computations: the quantities of
interest are the speed of escape to infinity of the random walker, or its entropy. Note that this approach
is orthogonal to the one based on generating series and extensively studied in the 80’s and 90’s. We
already carried out this program for free products of cyclic groups and for the 3-strand braid group and
we aim now to consider other braid groups along the same lines.
To work on these challenging topics, the group will benefit of the one-year post-doctoral stay of P. Gillibert (starting Sept. 2012) and of the PhD thesis of V. Jugé (starting Sept. 2012 under the supervision of
J. Mairesse).
On the topic of automaton semigroups the finiteness problem still needs attention, our ultimate challenge being to prove its decidability, thus answering positively the question raised by Grigorchuk, Nekrashevich, and Sushchanskii. On the implementation side, there exist currently two GAP packages dealing
with automaton groups, one developed by Bartholdi and the other by Savchuk and Muntyan. We aim
to provide implemented tools for the computation of the growth series [KMP12] that will be compatible
with each of the two GAP packages.
158
Computational Complexity, Algorithmic Randomness
Our research project in computational complexity follows three main directions. First, randomness is
a federating theme in the group and the question that will be investigated in complexity is to what extent
randomisation can speed up algorithms. This hot topic converges with a second theme, namely computing of polynomials in algebraic complexity. Indeed, one of the rare problems not yet derandomised
is to test whether an arithmetic circuit evaluates to zero. The complexity of problems of this kind is
well worth being studied: for instance, the test of whether the circuits evaluates to a positive value is
only known to be in the counting hierarchy (a very large class) and almost no hardness result is known.
Therefore better upper bounds and lower bounds have to be found. The third direction also concerns
the computation of polynomials. This time, the question is how many operations are needed to compute
polynomials (like the determinant or the permanent). We are thus looking for lower bounds. Since such
lower bounds are very hard to prove in the general case, they are to be sought first for restricted circuits
(such as multilinear or small depth circuits, formulas, branching programs, and so on).
As to algorithmic randomness, there are also several directions that we are planning to pursue in the
coming years. The first one concerns the line of study promoted by Miller and Nies which consists in
gauging the strength of “almost sure” results in analysis. To understand what this is about, consider
a theorem of classical analysis involving a co-null set of elements, in a measure-theoretic sense (for
example: “a continuous non-decreasing from reals to reals, is differentiable almost everywhere”). From
an algorithmic randomness viewpoint, it is interesting to look at effective versions of such theorems,
where functions, sets, measures, etc, are assumed to be computable. In this setting, what we want to
know is “how random” an object has to be to satisfy the theorem. In the above example, Brattka, Miller
and Nies proved that a real x is computably random if and only if every computable non-decreasing
function is differentiable at x. Such results are very informative and help to get better understanding
of the strength of the classical theorem as well as of the corresponding randomness notion. In this
line of research, we are particularly interested on effective aspects of Brownian motion, on which we
are currently collaborating with the Logic group of UC Berkeley (mostly Kelty Allen, Adam Day and
Theodore A. Slaman).
The second one looks at algorithmic randomness (especially its finitist form, Kolmogorov complexity)
from a formal logic point of view. Indeed, statements about Kolmogorov complexity can be fully formalised in Peano Arithmetic (PA) or any theory more expressive than PA. In particular, statements of
type “K(x) > n”, K denoting Kolmogorov complexity, have been shown by Chaitin in the 1960s to
be independent of PA. This yields natural questions: How “useful” are such axioms? What kind of new
statements can they prove? Thinking about such questions requires the simultaneous use of computability theory and model theory. This line of work is the core of Antoine Taveneaux’s PhD thesis, and is
done in collaboration with Alexander Shen and Andrei Romashchenko from the LIRMM (Montpellier).
The third one is the study “higher randomness” theory. Typically, algorithmic randomness looks at
effective objects that are fairly low in the arithmetic or Borel hierarchy (rarely passed Σ04 or Π04 ). In
“higher randomness”, the basic objects of interest are instead taken to be the first levels of the analytic
hierarchy. For example, “∆11 -random reals” are those which belong to no ∆11 nullsets. On the one hand,
higher randomness theory requires some heavy mathematical machinery (computable ordinal theory,
ramified hierarchy, forcing), but on the other hand it often gives results that are nicer than classical
algorithmic randomness.
Finally, let us mention that our group will be joined by two new postdoctoral students: Paul Shafer
(PhD from Cornell University, USA) and Chris Porter (PhD from University of Notre Dame, USA). It is
planned that they work on formalizing in type theory the “big five” constructive sub-systems of second
order arithmetic (whose study is sometimes called “Reverse mathematics”).
159
4.2
Project implementation
The main strengths of our group are its scientific output, its international visibility and its internal organisation. Therefore, our project will build on our strengths while reinforcing them. Our international
visibility will help us to keep recruiting excellent post-doctoral researchers, and for this we will use all
the tools available: European projects, ANR projects, the Foundation Sciences Mathématiques de Paris,
local projects (region Île de France, ville de Paris). To continue attracting very good PhD students,
we will be active in MPRI Master program as it is a unique forum to present the recent developments
of our discipline, we will also keep co-advising doctoral thesis with colleagues from other groups in
France and Europe. Thanks to our international connections and to the master programme grant with the
Foundation, we expect to attract master student from abroad to continue their curriculum in our group.
We will continue our implication in the national instances, in particular in GdR IM as we believe that
the topics developed in the group are central ones in the much larger community of “Informatique
Mathématique”.
The main specificity of our internal activity are its numerous working groups. We believe that in the
forthcoming years our weekly group seminar will be an essential tool to preserve our scientific cohesion.
Indeed, while the group and its scope are getting larger, this common seminar ensures that everyone in
the group gets aware of recent developments and orientations. More specialised working groups will
be created when needed as we did in the last years, and these working groups will be open to a larger
audience than the group itself, and probably be common sometimes with other groups from LIAFA,
from PPS, from IJM or from the Paris area.
160
EXTERNAL
161
T
hr
F
ea
m und
t
• pro uch ing
R g o re
p ed ram n “ lie
an ool ucti m AN s to
d of on e b R o
gr P o la
an hD f t nc
ts s he ”
tu
de
nt
s
NEGATIVE
ty
ni
•
W
th
•
a
th ll as
• ma eor pe
st ny y a cts
• ma ron co re of
N th g
-a co au
& um em inte dv ver tom
vi er a ra ise ed a
si ou tic ct d
ta
to
rs s s s ion Ph
s
em
w D
St
ith
i
n
re
ar
ng
s
•
n
tio
ep
pe
rc ry
co
pe o
n he ts s
io a t lis he
r
sh at cia f t
fe
-fa m e t o ity ns
ld to sp n n ra
O au n- me u t
• of no ge uce logy
r
s
by la red no
es
En y ch
• ma te
kn
o
ea
N
•
•
•
tu
,
or
s: ss
ps
ea ne
ou
pp
gr
ar om
O
er
ch nd
ar ra . . . th
o
se ic ity h
re m al it
ng
w ith du s w s iri
ne or s, on ine h
• alg me cti ipl PhD
c
ga tera dis +
in d oc
an ostd
p
S W
O T
POSITIVE
INTERNAL
162
Chapter 5
Publication [CK11a] is joint with the team “Combinatoire”.
[ABPS08]
Shigeki Akiyama, Horst Brunotte, Attila Pethő, Wolfgang Steiner. “Periodicity of certain
piecewise affine planar maps”. Tsukuba J. Math. 32.1 (2008), pp. 197–251.
[AF07]
Petr Ambroz, Christiane Frougny. “On alpha-adic expansions in Pisot bases.” Theor. Comput. Sci. 380.3 (2007), pp. 238–250.
[AF09]
Jean-Paul Allouche, Christiane Frougny. “Univoque numbers and an avatar of ThueMorse”. Acta Arith. 136.4 (2009), pp. 319–329.
[AFH07]
Jean-Paul Allouche, Christiane Frougny, Kevin G. Hare. “On univoque Pisot numbers.”
Math. Comput. 76.259 (2007), pp. 1639–1660.
[AFS08]
Shigeki Akiyama, Christiane Frougny, Jacques Sakarovitch. “Powers of rationals modulo
1 and rational base number systems”. Israel J. Math. 168 (2008), pp. 53–91.
[AFSS10]
Boris Adamczewski, Christiane Frougny, Anne Siegel, Wolfgang Steiner. “Rational numbers with purely periodic β-expansion”. Bull. Lond. Math. Soc. 42.3 (2010), pp. 538–552.
[AKLMP12] Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin. “On
the finiteness problem for automaton (semi)groups”. Internat. J. Algebra Comput. (2012).
To appear.
[Alb09]
Marie Albenque. “A note on the enumeration of directed animals via gas considerations”.
Ann. Appl. Probab. 19.5 (2009), pp. 1860–1879.
[ALOST11]
Shigeki Akiyama, Jun Luo, Ryotaro Okazaki, Wolfgang Steiner, Jörg Thuswaldner.
“Similar dissection of sets”. Geom. Dedicata 150.1 (2011), pp. 233–247.
[AM08]
Marie Albenque, Jean-François Marckert. “Some families of increasing planar maps”.
Electron. J. Probab. 13 (2008), pp. 1624–1671.
[BBC09]
Jean Berstel, Luc Boasson, Olivier Carton. “Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm.” Theor. Comput. Sci. 410.30-32 (2009),
pp. 2811–2822.
[BBCF10]
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. “Sturmian Trees.” Theory
Comput. Syst. 46.3 (2010), pp. 443–478.
[BBCPR10]
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Éric Pin, Antonio Restivo. “The expressive power of the shuffle product.” Inf. Comput. 208.11 (2010), pp. 1258–1272.
[BBCR10]
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal. “Logic and Rational Languages
of Words Indexed by Linear Orderings.” Theory Comput. Syst. 46.4 (2010), pp. 737–760.
163
CHAPTER 5. LIST OF PUBLICATIONS: AUTOMATA AND APPLICATIONS
[BBGL11a]
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé. “Equations on
palindromes and circular words.” Theor. Comput. Sci. 412.27 (2011), pp. 2922–2930.
[BBGL11b]
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé. “Two infinite
families of polyominoes that tile the plane by translation in two distinct ways”. Theor.
Comput. Sci. 412.36 (2011), pp. 4778–4786.
[BBL12]
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé. “A parallelogram tile fills the
plane by translation in at most two distinct ways”. Discrete Applied Mathematics 160
(2012), pp. 1011–1018.
[BC07]
Véronique Bruyère, Olivier Carton. “Automata on linear orderings.” J. Comput. Syst. Sci.
73.1 (2007), pp. 1–24.
[BC08]
Mikolaj Bojanczyk, Thomas Colcombet. “Tree-Walking Automata Do Not Recognize All
Regular Languages.” SIAM J. Comput. 38.2 (2008), pp. 658–701.
[BCR11]
Alberto Bertoni, Christian Choffrut, Roberto Radicioni. “The Inclusion Problem of
Context-Free Languages: Some Tractable Cases.” Int. J. Found. Comput. Sci. 22.2 (2011),
pp. 289–299.
[BCS09]
Véronique Bruyère, Olivier Carton, Géraud Sénizergues. “Tree Automata and Automata
on Linear Orderings.” RAIRO Theor. Inform. Appl. 43.2 (2009), pp. 321–338.
[BDHMS12] Laurent Bienvenu, Adam R. Day, Mathieu Hoyrup, Ilya Mezhirov, Alexander Shen. “A
constructive version of Birkhoff’s ergodic theorem for Martin-Löf random points.” Inf.
Comput. 210 (2012), pp. 21–30.
[Ber11a]
Valérie Berthé. “About thin arithmetic discrete planes.” Theor. Comput. Sci. 412.36 (2011),
pp. 4757–4769.
[Ber11b]
Valérie Berthé. “Multidimensional Euclidean algorithms, numeration and substitutions”.
Integers 11B (2011), A2, 32 pp.
[Ber12]
Valérie Berthé. “Numeration and discrete dynamical systems.” Computing 94.2-4 (2012),
pp. 369–387.
[BF11]
Valérie Berthé, Thomas Fernique. “Brun expansions of stepped surfaces.” Discrete Mathematics 311.7 (2011), pp. 521–543.
[BFM07]
Vasco Brattka, Christiane Frougny, Norbert Th. Müller. “Foreword.” RAIRO Theor. Inform. Appl. 41.1 (2007), pp. 1–2.
[BFS12]
Valérie Berthé, Dirk Frettlöh, Victor Sirvent. “Selfdual substitutions in dimension one”.
European Journal of Combinatorics 33 (2012), pp. 981–1000.
[BG07]
Verónica Becher, Serge Grigorieff. “Random reals à la Chaitin with or without prefixfreeness.” Theor. Comput. Sci. 385.1-3 (2007), pp. 193–201.
[BG09]
Verónica Becher, Serge Grigorieff. “From index sets to randomness in EMPTY SET : random reals and possibly infinite computations. Part II.” J. Symb. Log. 74.1 (2009), pp. 124–
156.
[BG11]
Nick Bezhanishvili, Mai Gehrke. “Finitely generated free Heyting algebras via Birkhoff
duality and coalgebra”. Logical Methods in Computer Science 7.2 (2011).
[BGKR12]
Dietmar Berwanger, Erich Grädel, Łukasz Kaiser, Roman Rabinovich. “The Entanglement
of Directed Graphs”. Theor. Comput. Sci. (2012). To appear.
[BGM11]
Ana Bušić, Varun Gupta, Jean Mairesse. “Stability of the bipartite maching model”. Adv.
Appl. Probab. (2011). To appear.
164
[BHKM12] Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle. “On the separation
of non-monotonic randomness notions”. Journal of Logic and Computation (2012). To
appear.
[Bie10]
Laurent Bienvenu. “Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.”
Theory Comput. Syst. 46.3 (2010), pp. 598–617.
[Bie12]
Laurent Bienvenu. “Strong reductions in effective randomness”. Theor. Comput. Sci.
(2012).
[BJS12]
Valérie Berthé, Timo Jolivet, Anne Siegel. “Substitutive Arnoux-Rauzy sequences have
pure discrete spectrum”. Uniform Distribution Theory 7 (2012), pp. 173–197.
[BKP09]
L’ubomı́ra Balková, Karel Klouda, Edita Pelantová. “Repetitions in beta-integers”. Letters
in Mathematical Physics 87 (2009), pp. 181–195.
[BLPP12]
Valérie Berthé, Annie Lacasse, Geneviève Paquin, Xavier Provençal. “A study of JacobiPerron boundary words for the generation of discrete planes”. Theor. Comput. Sci. (2012).
To appear.
[BM12a]
Laurent Bienvenu, Joseph S. Miller. “Randomness and lowness notions via open covers.”
Ann. Pure Appl. Logic 163.5 (2012), pp. 506–518.
[BMSV10] Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin. “Limit
Complexities Revisited.” Theory Comput. Syst. 47.3 (2010), pp. 720–736.
[BPS08]
L’ubomı́ra Balková, Edita Pelantová, Wolfgang Steiner. “Sequences with constant number
of return words”. Monatsh. Math. 155.3-4 (2008), pp. 251–263.
[BPS12]
Adolfo Ballester-Bolinches, Jean-Éric Pin, Xaro Soler-Escrivà. “Formations of finite
monoids and formal languages: Eilenberg’s variety theorem revisited”. Forum Mathematicum (2012). To appear.
[BS12a]
Dietmar Berwanger, Olivier Serre. “Parity Games on Undirected Graphs”. Inf. Process.
Lett. (2012). To appear.
[BSSST11] Valérie Berthé, Anne Siegel, Wolfgang Steiner, Paul Surer, Jörg M. Thuswaldner. “Fractal
tiles associated with shift radix systems”. Adv. Math. 226.1 (2011), pp. 139–175.
[Car07]
Olivier Carton. “The growth ratio of synchronous rational relations is unique.” Theor.
Comput. Sci. 376.1-2 (2007), pp. 52–59.
[CC08]
Laura Chaubard, Alfredo Costa. “A new algebraic invariant for weak equivalence of sofic
subshifts.” RAIRO Theor. Inform. Appl. 42.3 (2008), pp. 481–502.
[CD09a]
Jérémie Cabessa, Jacques Duparc. “A game theoretical approach to the algebraic counterpart of the Wagner hierarchy: Part I.” RAIRO Theor. Inform. Appl. 43.3 (2009), pp. 443–
461.
[CD09b]
Jérémie Cabessa, Jacques Duparc. “A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II.” RAIRO Theor. Inform. Appl. 43.3 (2009),
pp. 463–515.
[CDV07]
Christian Choffrut, Flavio D’Alessandro, Stefano Varricchio. “On the separability of
sparse context-free languages and of bounded rational relations.” Theor. Comput. Sci.
381.1-3 (2007), pp. 274–279.
[CDV10]
Christian Choffrut, Flavio D’Alessandro, Stefano Varricchio. “On Bounded Rational Trace
Languages.” Theory Comput. Syst. 46.2 (2010), pp. 351–369.
165
[CF10]
Christian Choffrut, Achille Frigeri. “Deciding whether the ordering is necessary in a Presburger formula.” Discrete Mathematics & Theoretical Computer Science 12.1 (2010),
pp. 21–38.
[CFS08]
Olivier Carton, Olivier Finkel, Pierre Simonnet. “On the continuity set of an Omega rational function.” RAIRO Theor. Inform. Appl. 42.1 (2008), pp. 183–196.
[CG08]
Christian Choffrut, Serge Grigorieff. “The decision problem for some logics or finite words
on infinite alphabets”. Zapiski Nauchnyh Seminarov POMI 258 (2008). Special volume
dedicated to Yuri Matiyasevich’s 60th birthday, M.A. Vsemirnov editor, pp. 100–119.
[CG09a]
Christian Choffrut, Serge Grigorieff. “Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.” Theor. Comput. Sci. 410.1 (2009), pp. 16–
34.
[CG09b]
Christian Choffrut, Serge Grigorieff. “The ”equal last letter” predicate for words on infinite alphabets and classes of multitape automata.” Theor. Comput. Sci. 410.30-32 (2009),
pp. 2870–2884.
[CG12a]
Christian Choffrut, Serge Grigorieff. “Rational relations having a rational trace on each
finite intersection of rational relations”. Theor. Comput. Sci. (2012). To appear.
[CG12b]
Dion Coumans, Sam van Gool. “On generalizing free algebras for a functor”. Journal of
Logic and Computation (2012). To appear.
[CGR12]
Anna Chernilovskaya, Mai Gehrke, Lorijn Rooijen. “Generalized Kripke semantics for the
Lambek–Grishin calculus”. Logic Journal of the IGLP (2012). To appear.
[Cho08]
Christian Choffrut. “Deciding whether a relation defined in Presburger logic can be defined
in weaker logics.” RAIRO Theor. Inform. Appl. 42.1 (2008), pp. 121–135.
[CK11a]
Guillaume Chapuy, Ines Klimann. “On the supports of recognizable series over a field and
a single letter alphabet.” Inf. Process. Lett. 111.23-24 (2011), pp. 1096–1098.
[CK11b]
Christian Choffrut, Juhani Karhumäki. “Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.” Theory Comput. Syst. 49.2 (2011),
pp. 355–364.
[CL07]
Thomas Colcombet, Christof Löding. “Transforming structures by set interpretations.”
Logical Methods in Computer Science 3.2 (2007).
[CM10]
Christian Choffrut, Robert George Mercas. “Contextual partial commutations.” Discrete
Mathematics & Theoretical Computer Science 12.4 (2010), pp. 59–72.
[CM11]
Philippe Chassaing, Jean Mairesse. “A non-ergodic probabilistic cellular automaton with
a unique invariant measure”. Stochastic Processes and their Applications 121.11 (2011),
pp. 2474 –2487.
[Col10]
Thomas Colcombet. “Factorization forests for infinite words and applications to countable
scattered linear orderings.” Theor. Comput. Sci. 411.4-5 (2010), pp. 751–764.
[CP11]
Ruth Corran, Matthieu Picantin. “A new Garside structure for braids groups of type
(e, e, r)”. Journal of the London Mathematical Society 84.3 (2011), pp. 689–711.
[CP12]
Antonio Cano Gómez, Jean-Éric Pin. “Upper set monoids and length preserving morphisms”. J. of Pure and Applied Algebra 216 (2012), pp. 1178–1183.
[CPSE09]
Olivier Carton, Jean-Éric Pin, Xaro Soler-Escrivà. “Languages recognized by finite supersoluble groups”. Journal of Automata, Languages and Combinatorics 14 (2009), pp. 149–
161.
166
[CR07]
Olivier Carton, Chloe Rispal. “Complementation of rational sets on scattered linear orderings of finite rank.” Theor. Comput. Sci. 382.2 (2007), pp. 109–119.
[CRS08]
Emilie Charlier, Michel Rigo, Wolfgang Steiner. “Abstract numeration systems on
bounded languages and multiplication by a constant”. Integers 8 (2008), A35, 19 pp. (electronic).
[DKS09]
Karma Dajani, Cor Kraaikamp, Wolfgang Steiner. “Metrical theory for α-Rosen fractions”. J. Eur. Math. Soc. (JEMS) 11.6 (2009), pp. 1259–1283.
[DTM07]
Thu-Ha Dao-Thi, Jean Mairesse. “Zero-automatic queues and product form”. Adv. Appl.
Probab. 39.2 (2007), pp. 429–461.
[DTM08]
Thu-Ha Dao-Thi, Jean Mairesse. “Zero-Automatic Networks.” Discrete Event Dynamic
Systems 18.4 (2008), pp. 499–536.
[EFGMS12]
Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit. “Sturmian graphs and integer representations over numeration systems.” Discrete Applied Mathematics 160.4-5 (2012), pp. 536–547.
[FK12a]
Diana Fischer, Łukasz Kaiser. “Model Checking the Quantitative mu-Calculus on Linear
Hybrid Systems”. LMCS (2012). To appear.
[FK12b]
Christiane Frougny, Karel Klouda. “Rational base number systems for p-adic numbers”.
RAIRO Theor. Inform. Appl. 46.1 (2012), pp. 87–106.
[FL11]
Christiane Frougny, Anna Chiara Lai. “Negative bases and automata.” Discrete Mathematics & Theoretical Computer Science 13.1 (2011), pp. 75–94.
[FMP07]
Christiane Frougny, Zuzana Masáková, Edita Pelantová. “Infinite Special Branches in
Words Associated with Beta-Expansions.” Discrete Mathematics & Theoretical Computer
Science 9.2 (2007).
[FPS11]
Christiane Frougny, Edita Pelantová, Milena Svobodová. “Parallel addition in nonstandard numeration systems.” Theor. Comput. Sci. 412.41 (2011), pp. 5714–5727.
[FS08]
Christiane Frougny, Wolfgang Steiner. “Minimal weight expansions in Pisot bases”. J.
Math. Cryptol. 2.4 (2008), pp. 365–392.
[GJP12]
Mai Gehrke, Ramon Jansana, Alessandra Palmigiano. “∆1 -completions of a Poset”. Order
(2012). To appear.
[GM08]
Bruno Gaujal, Jean Mairesse. “Minimization of circuit registers: Retiming revisited.” Discrete Applied Mathematics 156.18 (2008), pp. 3498–3505.
[Goo12]
Sam van Gool. “Duality and canonical extensions for stably compact spaces”. Topology
Appl. 159.1 (2012), pp. 341–359.
[GP10]
Marats Golovkins, Jean-Éric Pin. “Varieties Generated by Certain Models of Reversible
Finite Automata.” Chicago J. Theor. Comput. Sci. 2010 (2010).
[GS11]
Peter J. Grabner, Wolfgang Steiner. “Redundancy of minimal weight expansions in Pisot
bases.” Theor. Comput. Sci. 412.45 (2011), pp. 6303–6315.
[GV11]
Mai Gehrke, Jacob Vosmaer. “Canonical extensions and canonicity via dcpo presentations.” Theor. Comput. Sci. 412.25 (2011), pp. 2714–2723.
[GV12a]
Serge Grigorieff, Pierre Valarcher. “Classes of Algorithms: Formalization and Comparison”. Bull. EATCS 107 (2012). To appear, 33 pages.
[GZ12]
Hugo Gimbert, Wiesław Zielonka. “Blackwell optimal strategies in priority mean-payoff
games”. Int. J. Found. Comput. Sci. 23.3 (2012), pp. 687–711.
167
[HKT12]
Michael Holtmann, Łukasz Kaiser, Wolfgang Thomas. “Degrees of Lookahead in Regular
Infinite Games”. LMCS (2012). Special Issue of FoSSaCS ’10. To appear.
[HMN12]
Serge Haddad, Jean Mairesse, Hoang-Thach Nguyen. “Synthesis and analysis of product
form Petri nets”. Fundamenta Informaticae (2012). To appear.
[JK12a]
Timo Jolivet, Jarkko Kari. “Consistency of multidimensional combinatorial substitutions”.
Theor. Comput. Sci. (2012). To appear.
[JM10]
Matthieu Jonckheere, Jean Mairesse. “Towards an Erlang formula for multiclass networks.” Queueing Syst. 66.1 (2010), pp. 53–78.
[Kap12b]
Christos A. Kapoutsis. “Nondeterminism is essential in small two-way finite automata
with few reversals”. Information and Computation (2012). To appear.
[KKM12]
Christos A. Kapoutsis, Richard Královic, Tobias Mömke. “Size complexity of rotating and
sweeping automata.” J. Comput. Syst. Sci. 78.2 (2012), pp. 537–558.
[KP09a]
Karel Klouda, Edita Pelantová. “Factor complexity of infinite words associated with nonsimple Parry numbers”. Integers - Electronic Journal of Combinatorial Number Theory 9
(2009), pp. 281–310.
[KP09c]
Pascal Koiran, Sylvain Perifel. “VPSPACE and a transfer theorem over the complex field.”
Theor. Comput. Sci. 410.50 (2009), pp. 5244–5251.
[KP09d]
Pascal Koiran, Sylvain Perifel. “VPSPACE and a Transfer Theorem over the Reals.” Computational Complexity 18.4 (2009), pp. 551–575.
[KP11]
Pascal Koiran, Sylvain Perifel. “Interpolation in Valiant’s Theory.” Computational Complexity 20.1 (2011), pp. 1–20.
[KS12]
Charlene Kalle, Wolfgang Steiner. “Beta-expansions, natural extensions and multiple
tilings associated with Pisot units”. Trans. Amer. Math. Soc. 364.5 (2012), pp. 2281–2318.
[KSS12]
Cor Kraaikamp, Thomas A. Schmidt, Wolfgang Steiner. “Natural extensions and entropy
of α-continued fractions”. Nonlinearity 25.8 (2012), pp. 2207–2243.
[LLS07]
Christof Löding, Carsten Lutz, Olivier Serre. “Propositional dynamic logic with recursive
programs.” J. Log. Algebr. Program. 73.1-2 (2007), pp. 51–69.
[LS12]
Lingmin Liao, Wolfgang Steiner. “Dynamical properties of the negative betatransformation”. Ergodic Theory Dynam. Systems (2012). To appear.
[MBLV11]
Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon. “Palindromic
complexity of codings of rotations.” Theor. Comput. Sci. 412.46 (2011), pp. 6455–6463.
[Mer08]
Glenn Merlet. “Cycle time of stochastic max-plus linear systems.” Electronic Journal of
Probability 13 (2008), pp. 322–340.
[Mer10]
Glenn Merlet. “Semigroup of matrices acting on the max-plus projective space”. Linear
Algebra Appl. 432.8 (2010), pp. 1923–1935.
[MM07a]
Jean Mairesse, Frédéric Mathéus. “Random Walks on Free Products of Cyclic Groups”. J.
Lond. Math. Soc. 75.2 (2007), pp. 47–66.
[MM07b]
Jean Mairesse, Frédéric Mathéus. “Randomly growing braid on three strands and the manta
ray”. Ann. Appl. Probab. 17.2 (2007), pp. 502–536.
[MMP11]
Elvira Mayordomo, Philippe Moser, Sylvain Perifel. “Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable.” Theory Comput. Syst. 48.4
(2011), pp. 731–766.
168
[MN10]
Jean Mairesse, Hoang-Thach Nguyen. “Deficiency Zero Petri Nets and Product Form.”
Fundam. Inform. 105.3 (2010), pp. 237–261.
[Pin12]
Jean-Éric Pin. “Equational descriptions of languages”. Int. J. Found. Comput. Sci. (2012).
To appear.
[PS11]
Jean-Éric Pin, Pedro V. Silva. “On Profinite Uniform Structures Defined by Varieties of
Finite Monoids.” IJAC 21.1-2 (2011), pp. 295–314.
[Ste09]
Wolfgang Steiner. “Regularities of the distribution of abstract van der Corput sequences”.
Unif. Distrib. Theory 4.2 (2009), pp. 81–100.
[Ste12a]
Wolfgang Steiner. “Digital expansions with negative real bases”. Acta Math. Hungar.
(2012). To appear.
[Ste12b]
Wolfgang Steiner. “On the structure of (−β)-integers”. RAIRO Theor. Inform. Appl. 46.1
(2012), pp. 181–200.
[Tav12]
Antoine Taveneaux. “Axiomatizing Kolmogorov complexity”. Theory Comput. Syst.
(2012). To appear.
[UKY09a]
Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès. “A Family of Smallest Symmetrical Four-State Firing Squad Synchronization Protocols for Ring Arrays.” Parallel Processing Letters 19.2 (2009), pp. 299–313.
[UKY09b]
Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès. “A family of smallest symmetrical four-states firing squad synchronization protocols for ring arrays”. Parallel Processing
Letters 19.2 (2009), pp. 299–313.
[Yun08a]
Jean-Baptiste Yunès. “A 4-states algebraic solution to linear cellular automata synchronization.” Inf. Process. Lett. 107.2 (2008), pp. 71–75.
[Yun08b]
Jean-Baptiste Yunès. “An intrinsically non minimal-time Minsky-like 6-states solution to
the Firing Squad synchronization problem.” RAIRO Theor. Inform. Appl. 42.1 (2008),
pp. 55–68.
[Yun09]
Jean-Baptiste Yunès. “Known CA Synchronizers made Insensitive to the Initial State of
the Initiato.” J. Cellular Automata 4.2 (2009), pp. 147–158.
[Yun12]
Jean-Baptiste Yunès. “Grids and universal computations on one-dimensional cellular automata”. Natural Computing (2012). To appear.
C-INV : Invited talks
[Ber10a]
Valérie Berthé. “Muldimensional Euclid’s algorithms in discrete geometry”. Numbers, Sequences, Lattices: Dynamical Analysis of Algorithms. Colloquium for Brigitte Vallée’s
birthday. 2010.
[Ber10b]
Valérie Berthé. “Numeration and discrete dynamical systems”. International Symposium
on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2010
GAMM - IMACS). 2010.
[Col11]
Thomas Colcombet. “Green’s Relations and Their Use in Automata Theory.” Proceedings of Language and Automata Theory and Applications, 5th International Conference
(LATA’11). Vol. 6638. Lecture Notes in Computer Science. Springer, 2011, pp. 1–21.
[Col12]
Thomas Colcombet. “Forms of Determinism for Automata (Invited Talk).” Proceedings of
29th Annual Symposium on Theoretical Aspects of Computer Science (STACS’12). Vol. 14.
LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012, pp. 1–23.
169
[CP08]
Antonio Cano Gómez, Jean-Éric Pin. “A Robust Class of Regular Languages.” Proceedings of Mathematical Foundations of Computer Science, 33rd International Symposium
(MFCS’08). Vol. 5162. Lecture Notes in Computer Science. Springer, 2008, pp. 36–51.
[Geh11]
Mai Gehrke. “Duality and Recognition.” Proceedings of Mathematical Foundations of
Computer Science, 36th International Symposium (MFCS’11). Vol. 6907. Lecture Notes
[Kap12a]
Christos A. Kapoutsis. “Minicomplexity”. Proceedings of 14th International Workshop on
Descriptional Complexity of Formal Systems (DCFS’12). To appear. 2012, pp. 20–42.
[Mai08]
Jean Mairesse. “Random walks on algebraic structures and discrete event systems”. 3rd
International Conference on Performance Evaluation Methodologies and Tools (Valuetools’08), Athènes, Grèce. 2008.
[Mai10]
Jean Mairesse. “Around Probabilistic Cellular Automata”. AUTOMATA 2010, 16th intl.
workshop on cellular automata & discrete complex systems, Nancy, Juin 2010. 2010.
[Mai12]
Jean Mairesse. “Products forms in queues, Petri nets, and probabilistic cellular automata”.
Proceedings of 19th International Conference on Analytic and Stochastic Modelling Techniques and Applications (ASMTA’12). Lecture Notes in Computer Science. Springer, 2012.
[Pin09]
Jean-Éric Pin. “Profinite Methods in Automata Theory.” Proceedings of 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS’09). Vol. 3. LIPIcs. Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009, pp. 31–50.
[Pin11a]
Jean-Éric Pin. “Equational descriptions of languages”. Proceedings of Automata and Formal Languages, 13th International Conference (AFL’11). Invited conference, to appear in
a special issue of the Int. J. Found. Comput. Sci. 2011.
[Pin11b]
Jean-Éric Pin. “Theme and Variations on the Concatenation Product”. Proceedings of Algebraic Informatics - 4th International Conference (CAI’11). Vol. 6742. Lecture Notes in
[Yun10a]
Jean-Baptiste Yunès. “Achieving Universal Computations on One-Dimensional Cellular
Automata.” Proceedings of 9th International Conference on Cellular Automata for Reseach and Industry (ACRI’09). Vol. 6350. Lecture Notes in Computer Science. Springer,
2010, pp. 660–669.
[Zie10]
Wiesław Zielonka. “Playing in stochastic environment: from multi-armed bandits to twoplayer games.” Proceedings of IARCS Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FST&TCS’10). Vol. 8. LIPIcs. Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010, pp. 65–72.
Publications [CH08a; CH08b; CHMOS08] are joint with the team “Modelisation and verification”.
[Alb07]
Marie Albenque. “Bijective combinatorics of positive braids”. Proceedings of Eurocomb
’07, Electronic Notes in Discrete Mathematics 29 (2007), pp. 225–229.
[ALMS08]
Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre. “µ-calculus Pushdown
Module Checking with Imperfect State Information.” Proceedings of the fifth IFIP International Conference On Theoretical Computer Science (IFIP TCS’08). Vol. 273. IFIP.
Springer, 2008, pp. 333–348.
[AN09]
Marie Albenque, Philippe Nadeau. “Growth function for a class of monoids”. Proceedings
of FPSAC, Discrete Math. Theor. Comput. Sci. (2009), pp. 25–38.
170
[BBCF07]
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. “A First Investigation of Sturmian Trees.” Proceedings of 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS’07). Vol. 4393. Lecture Notes in Computer Science. Springer, 2007,
pp. 73–84.
[BBCR08]
Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal. “Logic and Rational Languages
of Words Indexed by Linear Orderings.” Proceedings of the third International Computer
Science Symposium in Russia (CSR’08). Vol. 5010. Lecture Notes in Computer Science.
Springer, 2008, pp. 76–85.
[BBGL10]
Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé. “Every polyomino yields at most two square tilings”. Proceedings of the 7th international conference
on lattice path combinatorics and applications (Lattice’10). 5pp. 2010.
[BC09]
Christian W. Bach, Jérémie Cabessa. “Limit knowledge of rationality.” Proceedings of the
12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK’09). 2009,
pp. 34–40.
[BC11]
Alexis Bès, Olivier Carton. “Algebraic Characterization of FO for Scattered Linear Orderings.” Proceedings of Computer Science Logic, 20th Annual Conference of the EACSL
(CSL’11). Vol. 12. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011,
pp. 67–81.
[BCHS12]
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre. “A Saturation
Method for Collapsible Pushdown Systems”. Proceedings of Automata, Languages and
Programming, 39th International Colloquium (ICALP’12). Lecture Notes in Computer
Science. To appear. Springer, 2012.
[BCOS10]
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre. “Recursion
Schemes and Logical Reflection.” Proceedings of the 25th IEEE Symposium on Logic in
Computer Science (LICS’10). IEEE Computer Society, 2010, pp. 120–129.
[BCR08]
Alberto Bertoni, Christian Choffrut, Roberto Radicioni. “Literal Shuffle of Compressed
Words.” Proceedings of the fifth IFIP International Conference On Theoretical Computer
Science (IFIP TCS’08). Vol. 273. IFIP. Springer, 2008, pp. 87–100.
[BCR09]
Alberto Bertoni, Christian Choffrut, Roberto Radicioni. “The Inclusion Problem of
Context-Free Languages: Some Tractable Cases.” Proceedings of Developments in Language Theory, 13th International Conference (DLT’09). Vol. 5583. Lecture Notes in Computer Science. Springer, 2009, pp. 103–112.
[BDMS10] Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alexander Shen. “Ergodic-Type Characterizations of Algorithmic Randomness.” Proceedings of Logic and Theory of Algorithms,
6th Conference on Computability in Europe (CiE’10). Vol. 6158. Lecture Notes in Computer Science. Springer, 2010, pp. 49–58.
[BFMM12]
A. Bušić, N. Fates, J. Mairesse, I. Marcovici. “Density classification on infinite lattices and trees”. Proceedings of Latin American Symposium on Theoretical Informatics
(LATIN’12). Vol. 7256. Lecture Notes in Computer Science. Springer, 2012, pp. 109–120.
[BFRS07]
Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch. “On the cost and
complexity of the successor function”. Proceedings of the 6th International Conference
Words (WORDS’07). 2007, pp. 43–56.
[BGL10]
Alexandre Blondin Massé, Ariane Garon, Sébastien Labbé. “Generation of double square
tiles”. Proceedings of the 7th conference on random generation of combinatorial structures
(GASCom’10). 13pp. 2010.
171
[BGM10]
Ana Bušić, Varun Gupta, Jean Mairesse. “Stability of the bipartite matching model.” SIGMETRICS Performance Evaluation Review 38.2 (2010), pp. 6–8.
[BGMS12]
Henk Barendregt, Mai Gehrke, Giulio Manzonetto, Sylvain Salvati. “Urzyczyn and Loader
are Logically Related”. Proceedings of Automata, Languages and Programming, 39th
International Colloquium (ICALP’12). Lecture Notes in Computer Science. To appear.
Springer, 2012.
[BHMN12] Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies. “The Denjoy alternative
for computable functions.” Proceedings of 29th Annual Symposium on Theoretical Aspects
of Computer Science (STACS’12). Vol. 14. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2012, pp. 543–554.
[BKL12]
Dietmar Berwanger, Łukasz Kaiser, Simon Lessenich. “Solving Counter Parity Games”.
Proceedings of Mathematical Foundations of Computer Science, 37th International Symposium (MFCS’12). Lecture Notes in Computer Science. To appear. Springer, 2012.
[BKP11]
Dietmar Berwanger, Łukasz Kaiser, Bernd Puchala. “A Perfect-Information Construction
for Coordination in Games”. Proceedings of IARCS Annual Conference on Foundations of
Software Technology and Theoretical Computer Science (FST&TCS’11). Vol. 13. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, pp. 387–398.
[BL11a]
Valérie Berthé, Sébastien Labbé. “An Arithmetic and Combinatorial Approach to ThreeDimensional Discrete Lines.” Proceedings of Discrete Geometry for Computer Imagery 16th IAPR International Conference (DGCI’11). Vol. 6607. Lecture Notes in Computer
[BL11b]
Valérie Berthé, Sébastien Labbé. “Uniformly balanced words with linear complexity and
prescribed letter frequencies”. Proceedings of the 8th International Conference Words
(WORDS’11). Vol. 63. EPTCS. 2011, pp. 44–52.
[BM12b]
Laurent Bienvenu, Benoit Monin. “von Neumann’s biased coin revisited”. Proceedings of
the 27th IEEE Symposium on Logic in Computer Science (LICS’12). To appear. IEEE
Computer Society, 2012.
[BMM11]
Ana Bušić, Jean Mairesse, Irene Marcovici. “Probabilistic cellular automata, invariant
measures, and perfect sampling.” Proceedings of 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS’11). Vol. 9. LIPIcs. Schloss Dagstuhl - LeibnizZentrum fuer Informatik, 2011, pp. 296–307.
[BMN11]
Laurent Bienvenu, Wolfgang Merkle, André Nies. “Solovay functions and K-triviality.”
Proceedings of 28th Annual Symposium on Theoretical Aspects of Computer Science
(STACS’11). Vol. 9. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011,
pp. 452–463.
[BP09]
Mário J. J. Branco, Jean-Éric Pin. “Equations Defining the Polynomial Closure of a Lattice of Regular Languages.” Proceedings of Automata, Languages and Programming, 36th
International Colloquium (ICALP’09). Vol. 5556. Lecture Notes in Computer Science.
Springer, 2009, pp. 115–126.
[Bro12a]
Christopher H. Broadbent. “Prefix Rewriting for Nested-Words and Collapsible Pushdown
Automata”. Proceedings of Automata, Languages and Programming, 39th International
Colloquium (ICALP’12). Lecture Notes in Computer Science. To appear. Springer, 2012.
[Bro12b]
Christopher H. Broadbent. “The Limits of Decidability for First Order Logic on CPDA
Graphs.” Proceedings of 29th Annual Symposium on Theoretical Aspects of Computer Science (STACS’12). Vol. 14. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
2012, pp. 589–600.
172
[BS12b]
Laurent Bienvenu, Alexander Shen. “Random Semicomputable Reals Revisited.” Computation, Physics and Beyond - International Workshop on Theoretical Computer Science,
WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday.
[BST10b]
Laurent Bienvenu, Frank Stephan, Jason Teutsch. “How Powerful Are Integer-Valued Martingales?” Proceedings of Logic and Theory of Algorithms, 6th Conference on Computability in Europe (CiE’10). Vol. 6158. Lecture Notes in Computer Science. Springer, 2010,
pp. 59–68.
[Car09]
Olivier Carton. “Left and Right Synchronous Relations.” Proceedings of Developments in
Language Theory, 13th International Conference (DLT’09). Vol. 5583. Lecture Notes in
[Car10]
Olivier Carton. “Right-Sequential Functions on Infinite Words.” Proceedings of the fifth
International Computer Science Symposium in Russia (CSR’10). Vol. 6072. Lecture Notes
[Car12]
Olivier Carton. “Two-way transducers with a two-way output tape”. Proceedings of Developments in Language Theory, 16th International Conference (DLT’12). Lecture Notes in
Computer Science. Springer, 2012.
[CCP11]
Olivier Carton, Thomas Colcombet, Gabriele Puppis. “Regular Languages of Words over
Countable Linear Orderings.” Proceedings of Automata, Languages and Programming,
38th International Colloquium (ICALP’11). Vol. 6756. Lecture Notes in Computer Science. Springer, 2011, pp. 125–136.
[CD08]
Jérémie Cabessa, Jacques Duparc. “The Algebraic Counterpart of the Wagner Hierarchy.”
Proceedings of Logic and Theory of Algorithms, 4th Conference on Computability in Europe (CiE’08). Vol. 5028. Lecture Notes in Computer Science. Springer, 2008, pp. 100–
109.
[CDFM09] Jérémie Cabessa, Jacques Duparc, Alessandro Facchini, Filip Murlak. “The Wadge Hierarchy of Max-Regular Languages.” Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS’09). Vol. 4.
[CF07]
Christian Choffrut, Achille Frigeri. “Definable sets in weak Presburger arithmetic.” Proceedings of Theoretical Computer Science, 10th Italian Conference (ICTCS’07). World
Scientific, 2007, pp. 175–186.
[CGP08]
Antonio Cano Gómez, Giovanna Guaiana, Jean-Éric Pin. “When Does Partial Commutative Closure Preserve Regularity?” Proceedings of Automata, Languages and Programming, 35th International Colloquium (ICALP’08). Vol. 5126. Lecture Notes in Computer
[CH08a]
Julien Cristau, Florian Horn. “Graph Games on Ordinals.” Proceedings of IARCS Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FST&TCS’08). Vol. 2. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2008,
pp. 143–154.
[CH08b]
Julien Cristau, Florian Horn. “On Reachability Games of Ordinal Length.” Proceedings of
Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM’08). Vol. 4910. Lecture Notes in Computer
173
[CHMOS08]
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre. “Winning Regions of Higher-Order Pushdown Games.” Proceedings of the 23rd IEEE Symposium on Logic in Computer Science (LICS’08). IEEE Computer Society, 2008, pp. 193–
204.
[Cho11]
Christian Choffrut. “On relations of finite words over infinite alphabets.” Proceedings of
Automata and Formal Languages, 13th International Conference (AFL’11). 2011, pp. 25–
27.
[CHS11]
Arnaud Carayol, Axel Haddad, Olivier Serre. “Qualitative Tree Languages.” Proceedings
of the 26th IEEE Symposium on Logic in Computer Science (LICS’11). IEEE Computer
Society, 2011, pp. 13–22.
[CK09]
Christian Choffrut, Juhani Karhumäki. “Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.” Proceedings of the fourth International
Computer Science Symposium in Russia (CSR’09). Vol. 5675. Lecture Notes in Computer
[CKL10]
Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy. “Regular Temporal Cost Functions.” Proceedings of Automata, Languages and Programming, 37th International Colloquium (ICALP’10). Vol. 6199. Lecture Notes in Computer Science. Springer, 2010,
pp. 563–574.
[CL08a]
Thomas Colcombet, Christof Löding. “The Nesting-Depth of Disjunctive µ-Calculus for
Tree Languages and the Limitedness Problem.” Proceedings of Computer Science Logic,
17th Annual Conference of the EACSL (CSL’08). Vol. 5213. Lecture Notes in Computer
[CL08b]
Thomas Colcombet, Christof Löding. “The Non-deterministic Mostowski Hierarchy and
Distance-Parity Automata.” Proceedings of Automata, Languages and Programming, 35th
International Colloquium (ICALP’08). Vol. 5126. Lecture Notes in Computer Science.
Springer, 2008, pp. 398–409.
[CL10]
Thomas Colcombet, Christof Löding. “Regular Cost Functions over Finite Trees.” Proceedings of the 25th IEEE Symposium on Logic in Computer Science (LICS’10). IEEE
Computer Society, 2010, pp. 70–79.
[CLP11]
Thomas Colcombet, Clemens Ley, Gabriele Puppis. “On the Use of Guards for Logics with
Data.” Proceedings of Mathematical Foundations of Computer Science, 36th International
Symposium (MFCS’11). Vol. 6907. Lecture Notes in Computer Science. Springer, 2011,
pp. 243–255.
[CMMP10] Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. “On the Expressive Power of FO[ + ].” Proceedings of Language and Automata Theory and Applications,
4th International Conference (LATA’10). Vol. 6031. Lecture Notes in Computer Science.
Springer, 2010, pp. 190–201.
[Col07a]
Thomas Colcombet. “A Combinatorial Theorem for Trees.” Proceedings of Automata,
Languages and Programming, 34th International Colloquium (ICALP’07). Vol. 4596. Lecture Notes in Computer Science. Springer, 2007, pp. 901–912.
[Col07b]
Thomas Colcombet. “Factorisation Forests for Infinite Words.” Proceedings of Fundamentals of Computation Theory, 16th International Symposium (FCT’07). Vol. 4639. Lecture
[Col09]
Thomas Colcombet. “The Theory of Stabilisation Monoids and Regular Cost Functions.”
Proceedings of Automata, Languages and Programming, 36th International Colloquium
(ICALP’09). Vol. 5556. Lecture Notes in Computer Science. Springer, 2009, pp. 139–150.
174
[CP07]
Laura Chaubard, Jean-Éric Pin. “Open problems on regular languages: an historical perspective”. Proceedings of Semigroups and formal languages. Word Scientific, 2007,
pp. 39–56.
[Cri09]
Julien Cristau. “Automata and temporal logic over arbitrary linear time.” Proceedings of
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS’09). Vol. 4. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik, 2009, pp. 133–144.
[CS12]
Arnaud Carayol, Olivier Serre. “Collapsible Pushdown Automata and Labeled Recursion
Schemes: Equivalence, Safety and Effective Selection”. Proceedings of the 27th IEEE
Symposium on Logic in Computer Science (LICS’12). To appear. IEEE Computer Society, 2012.
[CZ09]
Thomas Colcombet, Konrad Zdanowski. “A Tight Lower Bound for Determinization of
Transition Labeled Büchi Automata.” Proceedings of Automata, Languages and Programming, 36th International Colloquium (ICALP’09). Vol. 5556. Lecture Notes in Computer
[DMPY12]
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff. “Separating multilinear
branching programs and formulas”. Proceedings of the 44th Annual ACM Symposium on
Theory of Computing (STOC’12). To appear. ACM, 2012.
[EFGMS10]
Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit. “On Lazy Representations and Sturmian Graphs.” Proceedings of Implementation and
Application of Automata - 15th International Conference (CIAA’10). Vol. 6482. Lecture
Notes in Computer Science 7381. Springer, 2010, pp. 125–134.
[FIMY11]
Enrico Formenti, Katsunobu Imai, Bruno Martin, Jean-Baptiste Yunès. “A Boolean approach to cellular automata random sequences generation.” Proceedings of 17th International Workshop on Cellular Automata and Discrete Complex Systems (Automata 2011).
2011.
[FK11]
Diana Fischer, Łukasz Kaiser. “Model Checking the Quantitative µ-Calculus on Linear
Hybrid Systems”. Proceedings of Automata, Languages and Programming, 38th International Colloquium (ICALP’11). Vol. 6756. Lecture Notes in Computer Science. Springer,
2011, pp. 404–415.
[FL09]
Christiane Frougny, Anna Chiara Lai. “On Negative Bases.” Proceedings of Developments
in Language Theory, 13th International Conference (DLT’09). Vol. 5583. Lecture Notes in
[Fri09]
Achille Frigeri. “Automata and Logic on p-adic numbers.” Proceedings of Theoretical
Computer Science, 11th Italian Conference (ICTCS’09). 2009, pp. 117–120.
[FZG10]
Marie Ferbus-Zanda, Serge Grigorieff. “ASMs and Operational Algorithmic Completeness of Lambda Calculus.” Fields of Logic and Computation, Essays Dedicated to Yuri
Gurevich on the Occasion of His 70th Birthday. Vol. 6300. Lecture Notes in Computer
[GGP08]
Mai Gehrke, Serge Grigorieff, Jean-Éric Pin. “Duality and Equational Theory of Regular
Languages.” Proceedings of Automata, Languages and Programming, 35th International
Colloquium (ICALP’08). Vol. 5126. Lecture Notes in Computer Science. Springer, 2008,
pp. 246–257.
[GGP10]
Mai Gehrke, Serge Grigorieff, Jean-Éric Pin. “A Topological Approach to Recognition.”
175
[GHM08]
Rob M.P. Goverde, Bernd Heidergott, Glenn Merlet. “A fast approximation algorithm for
the Lyapunov exponent of stochastic max-plus systems”. Proceedings of the International
Workshop on Discrete Event Systems (WODES’08). 2008, pp. 49–54.
[GMSZ08]
Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun. “Tree Pattern Rewriting Systems.” Proceedings of Automated Technology for Verification and Analysis, 6th International Symposium (ATVA’08). Vol. 5311. Lecture Notes in Computer Science. Springer,
2008, pp. 332–346.
[GS09]
Vincent Gripon, Olivier Serre. “Qualitative Concurrent Stochastic Games with Imperfect
Information.” Proceedings of Automata, Languages and Programming, 36th International
pp. 200–211.
[GV10]
Serge Grigorieff, Pierre Valarcher. “Evolving Multialgebras Unify All Usual Sequential
Computation Models.” Proceedings of 27th Annual Symposium on Theoretical Aspects of
Computer Science (STACS’10). Vol. 5. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer
[GV12b]
Serge Grigorieff, Pierre Valarcher. “Functionals using Bounded Information and the Dynamics of Algorithms”. Proceedings of the 27th IEEE Symposium on Logic in Computer
Science (LICS’12). To appear. IEEE Computer Society, 2012.
[GZ07a]
Hugo Gimbert, Wiesław Zielonka. “Limits of Multi-Discounted Markov Decision Processes.” Proceedings of the 22nd IEEE Symposium on Logic in Computer Science
(LICS’07). IEEE Computer Society, 2007, pp. 89–98.
[GZ07b]
Hugo Gimbert, Wiesław Zielonka. “Perfect Information Stochastic Priority Games.” Proceedings of Automata, Languages and Programming, 34th International Colloquium
[GZ10]
Hugo Gimbert, Wiesław Zielonka. “Blackwell-Optimal Strategies in Priority Mean-Payoff
Games”. Proceedings of 1st International Symposium on Games, Automata, Logics and
Formal Verification (GandALF 2010). Vol. 25. EPTCS. 2010, pp. 7–21.
[Had12]
Axel Haddad. “IO vs OI in Higher-Order Recursion Schemes”. Proceedings of the 8th
Workshop on Fixed Points in Computer Science (FICS 2012). Vol. 77. EPTCS. 2012,
pp. 23–30.
[Hag11]
Matthew Hague. “Parameterised Pushdown Systems with Non-Atomic Writes.” Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FST&TCS’11). Vol. 13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2011, pp. 457–468.
[HL11]
Matthew Hague, Anthony Widjaja Lin. “Model Checking Recursive Programs with Numeric Data Types.” Proceedings of Computer Aided Verification - 23rd International Conference (CAV’11). Vol. 6806. Lecture Notes in Computer Science. Springer, 2011, pp. 743–
759.
[HMN11]
Serge Haddad, Jean Mairesse, Hoang-Thach Nguyen. “Synthesis and Analysis of ProductForm Petri Nets.” Proceedings of Applications and Theory of Petri Nets, 32nd International Conference (PETRI NETS’11). Vol. 6709. Lecture Notes in Computer Science.
Springer, 2011, pp. 288–307.
[HMOS08]
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre. “Collapsible Pushdown Automata and Recursion Schemes.” Proceedings of the 23rd IEEE Symposium on
Logic in Computer Science (LICS’08). IEEE Computer Society, 2008, pp. 452–461.
176
[JK12b]
Timo Jolivet, Jarkko Kari. “Consistency of multidimensional combinatorial substitutions”. Proceedings of the seventh International Computer Science Symposium in Russia
(CSR’12). Lecture Notes in Computer Science. To appear. Springer, 2012.
[Kai12]
Łukasz Kaiser. “Learning Games from Videos Guided by Descriptive Complexity”. Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI’12). To
appear. AAAI Press, 2012.
[Kap11a]
Christos A. Kapoutsis. “Nondeterminism is essential in small 2FAs with few reversals”.
[Kap11b]
Christos A. Kapoutsis. “Two-way automata versus logarithmic space”. Proceedings of the
sixth International Computer Science Symposium in Russia (CSR’11). Vol. 6651. Lecture
[KB11]
Denis Kuperberg, Michael Vanden Boom. “Quasi-Weak Cost Automata: A New Variant
of Weakness.” Proceedings of IARCS Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FST&TCS’11). Vol. 13. LIPIcs. Schloss
[KB12]
Denis Kuperberg, Michael Vanden Boom. “On the Expressive Power of Cost Logics over
Infinite Words”. Proceedings of Automata, Languages and Programming, 39th International Colloquium (ICALP’12). Lecture Notes in Computer Science. To appear. Springer,
2012.
[KHTT12]
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen. “How much randomness is needed
for statistics?” Proceedings of Logic and Theory of Algorithms, 8th Conference on Computability in Europe (CiE’12). Lecture Notes in Computer Science. To appear. Springer,
2012.
[KL12]
Christos A. Kapoutsis, Nans Levebvre. “Analogs of Fagin’s Theorem for small nondeterministic finite automata”. Proceedings of Developments in Language Theory, 16th International Conference (DLT’12). Lecture Notes in Computer Science. Springer, 2012, pp. 202–
213.
[KMP12]
Ines Klimann, Jean Mairesse, Matthieu Picantin. “Implementing computations in automaton (semi)groups”. Proceedings of Implementation and Applications of Automata, 17th
International Conference (CIAA 2012). Vol. 7381. Lecture Notes in Computer Science.
Springer, 2012, pp. 240–252.
[KP09b]
Pascal Koiran, Sylvain Perifel. “A Superpolynomial Lower Bound on the Size of Uniform
Non-constant-depth Threshold Circuits for the Permanent.” Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC’09). IEEE Computer Society,
2009, pp. 35–40.
[KP12a]
Christos A. Kapoutsis, Giovanni Pighizzini. “Reversal hierarchies for small 2DFAs”. Proceedings of Mathematical Foundations of Computer Science, 37th International Symposium (MFCS’12). Lecture Notes in Computer Science. To appear. Springer, 2012.
[KP12b]
Christos A. Kapoutsis, Giovanni Pighizzini. “Two-way automata characterizations of
L/poly versus NL”. Proceedings of the seventh International Computer Science Symposium in Russia (CSR’12). Lecture Notes in Computer Science. To appear. Springer, 2012,
pp. 222–233.
[KS11a]
Łukasz Kaiser, Łukasz Stafiniak. “First-Order Logic with Counting for General Game
Playing”. Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence
(AAAI’11). AAAI Press, 2011, pp. 791–796.
177
[KS11b]
Łukasz Kaiser, Łukasz Stafiniak. “Translating the Game Description Langauge to Toss”.
Proceedings of the 2nd International General Game Playing Workshop (GIGA’11). 2011,
pp. 91–98.
[Kup11]
Denis Kuperberg. “Linear temporal logic for regular cost functions.” Proceedings of 28th
Annual Symposium on Theoretical Aspects of Computer Science (STACS’11). Vol. 9.
[MN09]
Jean Mairesse, Hoang-Thach Nguyen. “Deficiency Zero Petri Nets and Product Form.”
Proceedings of Applications and Theory of Petri Nets, 30th International Conference
(PETRI NETS’09). Vol. 5606. Lecture Notes in Computer Science. Springer, 2009,
pp. 103–122.
[MY12]
Luidnel Maignan, Jean-Baptiste Yunès. “A Spatio-Temporal Algorithmic Point of View on
Firing Squad Synchronisation Problem”. Proceeding of Cellular Automata - 10th International Conference on Cellular Automata for Research and Industry (ACRI 2012). Lecture
Notes in Computer Science. To appear. Springer, 2012.
[PS08]
Jean-Éric Pin, Pedro V. Silva. “A Mahler’s theorem for functions from words to integers.” Proceedings of 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS’08). Vol. 1. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
Germany, 2008, pp. 585–596.
[Ste11]
Wolfgang Steiner. “On the Delone property of (−β)-integers”. Proceedings of the 8th International Conference Words (WORDS’11). Vol. 63. EPTCS. 2011, pp. 247–256.
[Tav11]
Antoine Taveneaux. “Towards an Axiomatic System for Kolmogorov Complexity.” Proceedings of Logic and Theory of Algorithms, 7th Conference on Computability in Europe
(CiE’11). Vol. 6735. Lecture Notes in Computer Science. Springer, 2011, pp. 280–289.
[UKY08]
Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès. “A family of smallest symmetrical four-state firing squad synchronization protocols for one-dimensional ring cellular automata.” Proceedings of Automata 2008: Theory and Applications of Cellular Automata.
Luniver Press, Frome, UK, 2008, pp. 174–186.
[UKY09c]
Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès. “A Two-Dimensional OptimumTime Firing Squad Synchronization Algorithm and Its Implementation”. Proceedings of
the International Workshop on Natural Computing (IWNC’09). Information and Communications Technology 2. 2009, pp. 342–351.
[UYK08]
Hiroshi Umeo, Jean-Baptiste Yunès, Naoki Kamikawa. “About 4-States Solutions to the
Firing Squad Synchronization Problem.” Proceedings of 8th International Conference on
Cellular Automata for Reseach and Industry (ACRI’08). Vol. 5191. Lecture Notes in Computer Science. Springer, 2008, pp. 108–113.
[Yun07]
Jean-Baptiste Yunès. “Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4-Steps Solution.” Proceedings of Machines, Computations,
and Universality, 5th International Conference (MCU’07). Vol. 4664. Lecture Notes in
[Yun08c]
Jean-Baptiste Yunès. “Goto’s construction and Pascal’s triangle: new insights into cellular
automata synchronization.” Proceedings of the First Symposium on Cellular Automata
”Journées Automates Cellulaires” (JAC’08). MCCME Publishing House, Moscow, 2008,
pp. 195–203.
178
[Yun10b]
Jean-Baptiste Yunès. “Achieving Universal Computations on One-Dimensional Cellular
Automata”. Proceedings of the 9th International Conference on Cellular Automata for Research and Industry (ACRI’10). Vol. 6350. Lecture Notes in Computer Science. Springer,
2010, pp. 660–669.
[ZGK12]
Faried Abu Zaid, Erich Grädel, Łukasz Kaiser. “The Field of Reals is not omegaAutomatic”. Proceedings of 29th Annual Symposium on Theoretical Aspects of Computer
Science (STACS’12). Vol. 14. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
2012, pp. 577–588.
C-COM : International or national conferences without proceedings
• Workshop Numeration, 14–18 June 2010, Lorentz Center, Leiden, Netherlands. V. Berthé.
• BIRS Outstanding Challenges in Combinatorics on Words, February 2012, Banff, Canada.
V. Berthé.
• KIAS Workshop, Korea, 27 September–1st October 2010. V. Berthé.
[AGM08]
Eitan Altman, Bruno Gaujal, Jean Mairesse. “Guest Editorial.” Discrete Event Dynamic
Systems 18.4 (2008), pp. 445–446.
[BM09]
François Baccelli, Jean Mairesse. “Guest Editorial.” Queueing Syst. 62.4 (2009), pp. 309–
310.
[BR10a]
Valérie Berthé, Michel Rigo, eds. Combinatorics, automata, and number theory. Vol. 135.
Encyclopedia of Mathematics and its Applications. 636 pages. Cambridge University
Press, 2010.
[Mai11]
Jean Mairesse. “Foreword: Special section on performance evaluation methodologies.”
Discrete Event Dynamic Systems 21.1 (2011), p. 39.
[MS12]
Jean Mairesse, Giovanni Stea. “Guest Editorial”. Performance Evaluation (2012).
OS : Scientific works
[Car08]
Olivier Carton. Langages formels, calculabilité et complexité. 240 pages. Vuibert, 2008.
[Kai11]
Łukasz Kaiser. Logic and Games on Automatic Structures. Vol. 6810. Lecture Notes in
Artificial Intelligence. Springer, 2011.
COS : Chapters in scientific works
[BCL08]
Achim Blumensath, Thomas Colcombet, Christof Löding. “Logical theories and compatible operations.” Logic and Automata: History and Perspectives [in Honor of Wolfgang
Thomas]. Vol. 2. Texts in Logic and Games. Amsterdam University Press, 2008, pp. 73–
106.
[BR10b]
Valérie Berthé, Michel Rigo. “Preliminaries”. Combinatorics, automata, and number theory. Ed. by Valérie Berthé and Michel Rigo. Vol. 135. Encyclopedia of Mathematics and
its Applications. 636 pages. Cambridge University Press, 2010, pp. 1–33.
[BST10a]
Valérie Berthé, Anne Siegel, Jörg Thuswaldner. “Substitutions, Rauzy fractals and tilings”.
Combinatorics, automata, and number theory. Ed. by Valérie Berthé and Michel Rigo.
Vol. 135. Encyclopedia of Mathematics and its Applications. 636 pages. Cambridge University Press, 2010, pp. 248–323.
179
[CPP08a]
Olivier Carton, Dominique Perrin, Jean-Éric Pin. “Automata and semigroups recognizing
infinite words.” Logic and Automata: History and Perspectives [in Honor of Wolfgang
168.
[CPP08b]
Olivier Carton, Dominique Perrin, Jean-Éric Pin. “Automata and semigroups recognizing
infinite words”. Logic and Automata: History and Perspectives [in Honor of Wolfgang
167.
[Fro07]
Christiane Frougny. “Non-standard number representation: computer arithmetic, betanumeration and quasicrystals”. Physics and theoretical computer science. Vol. 7. NATO
Secur. Sci. Ser. D Inf. Commun. Secur. Amsterdam: IOS, 2007, pp. 155–169.
[FS10]
Christiane Frougny, Jacques Sakarovitch. “Number representation and finite automata”.
Combinatorics, automata and number theory. Vol. 135. Encyclopedia Math. Appl. Cambridge: Cambridge Univ. Press, 2010, pp. 34–107.
[FZ12]
Marie Ferbus-Zanda. “Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality”. Logic, Epistemology, and the Unity of Science. To
appear. Springer, 2012.
[FZG11]
Marie Ferbus-Zanda, Serge Grigorieff. “Is Randomness native to Computer Science? Ten
Years Later”. Randomness Through Computation: Some Answers, More Questions. Ed. by
Hector Zenil. World Scientific, 2011, pp. 243–263.
[FZG12]
Marie Ferbus-Zanda, Serge Grigorieff. “Kolmogorov Complexity in perspective. Part I:
Information Theory and Randomness”. Logic, Epistemology, and the Unity of Science. To
appear. Springer, 2012.
[GZ08]
Hugo Gimbert, Wiesław Zielonka. “Applying Blackwell optimality: priority mean-payoff
games as limits of multi-discounted games.” Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Vol. 2. Texts in Logic and Games. Amsterdam
University Press, 2008, pp. 331–356.
[MY11]
Jacques Mazoyer, Jean-Baptiste Yunès. “Computations on Cellular Automata”. Handbook
of Natural Computing. Ed. by Grzegorz Rozenberg, Thomas H.W. Bäck, and Joost N. Kok.
Springer, 2011.
[Pin10]
Jean-Éric Pin. “Automates réversibles: combinatoire, algèbre et topologie”. Leçons de
mathématiques d’aujourd’hui. Ed. by É. Charpentier. Vol. 4. Cassini, 2010.
PV : Popularization works
[Ber11c]
√
Valérie Berthé. “Nombres et représentations. Les décimales de 2 sont-elles aléatoires?”
Image des mathématiques (2011). URL: http://images.math.cnrs.fr/Nombre
s-et-representations.html.
180
Chapter 6
6.1
Leader: Olivier S ERRE (Since January 2011)
Former leader: Jean M AIRESSE
6.1.1
6.1.1.1
Current members
Permanent members (2012)
• Valérie B ERTH É, DR CNRS. Since 15/03/2010.
• Laurent B IENVENU, CR CNRS. Since 01/10/2009.
• Olivier C ARTON, Professeur Université Paris Diderot-Paris 7.
• Christian C HOFFRUT, Professeur Université Paris Diderot-Paris 7.
• Thomas C OLCOMBET, CR CNRS. Since 01/07/2007.
• Marie F ERBUS -Z ANDA, Maı̂tre de conférence Paris Diderot-Paris 7.
• Christiane F ROUGNY, Professeur émérite Université Paris 8.
• Mai G EHRKE, DR CNRS. Since 01/10/2011.
• Serge G RIGORIEFF, Professeur émérite Université Paris Diderot-Paris 7.
• Łukasz K AISER, CR CNRS. Since 01/10/2010.
• Ines K LIMANN, Maı̂tre de conférence Paris Diderot-Paris 7.
• Jean M AIRESSE, DR CNRS.
• Sylvain P ERIFEL, Maı̂tre de conférence Paris Diderot-Paris 7. Since 01/09/2008.
• Matthieu P ICANTIN, Maı̂tre de conférence Paris Diderot-Paris 7.
• Jean-Éric P IN, DR CNRS.
• Olivier S ERRE, CR CNRS.
• Wolfgang S TEINER, CR CNRS.
• Jean-Baptiste Y UN ÈS, Maı̂tre de conférence (HdR) Paris Diderot-Paris 7.
• Wiesław Z IELONKA, Professeur Université Paris Diderot-Paris 7.
6.1.1.2
Ph.D students and post-doctoral researchers (2012)
PhD students
181
CHAPTER 6. APPENDIX: AUTOMATA AND APPLICATIONS
• Dion C OUMANS. Advisor: M. Gehrke.
• Luc DARTOIS. Advisors: O. Carton and J.-É. Pin.
• Laure DAVIAUD. Advisors: T. Colcombet and J.-É. Pin.
• Axel H ADDAD. Advisor: A. Carayol (LIGM, Université Paris Est) and O. Serre.
• Timo J OLIVET. Advisors: J. Kari (Turku, Finland) and V. Berthé.
• Denis K UPERBERG. Advisors: O. Carton and T. Colcombet.
• Irène M ARCOVICI. Advisor: J. Mairesse.
• Benoı̂t M ONIN. Advisor: L. Bienvenu and E. Asarin (Équipe Modélisation et vérification).
• Charles PAPERMAN. Advisors: O. Carton and J.-É. Pin.
• Yann P EQUIGNOT. Advisors: J. Duparc (Université de Lausanne, Switzerland) and J.-É. Pin.
• Antoine TAVENEAUX. Advisors: L. Bienvenu and S. Laplante (Équipe Algorithmique et complexité).
• Sam VAN G OOL. Advisor: M. Gehrke.
• Lorijn VAN ROOIJEN. Advisors: M. Gehrke and M. Zeitoun (Université de Bordeaux 1).
Post-doctoral researchers
• Christopher B ROADBENT (funded by Fondation Sciences Mathématiques de Paris).
28/09/2011 to 01/10/2012.
From
• Stefan G ÖLLER (funded by ERC project GALE). From 05/03/2012 to 30/09/2012.
• Matthew H AGUE (funded by région Île de France). From 01/09/2011 to 31/08/2012.
• Rupert H ÖLZL (funded by a Feodor Lynen Research Fellowship by the Alexander von Humboldt
Foundation). From 04/01/2011 to 31/12/2012.
• Christos K APOUTSIS (funded by a Marie Curie fellowship). From 01/09/2010 to 31/08/2012.
• Luidnel M AIGNAN (ATER, Université Paris Diderot-Paris 7). From 01/09/2011 to 30/08/2012.
• Amaldev M ANUEL (funded by ERC project GALE). From 02/04/2012 to 02/04/2014.
6.1.2
6.1.2.1
Former members
• Luc B OASSON, Professeur Université Paris Diderot-Paris 7. Retired since 01/09/2010.
6.1.2.2
Ph.D students and post-doctoral researchers (2007-2011)
PhD Students
• Marie A LBENQUE, Tresses, animaux, cartes : à l’interaction entre combinatoire et probabilités. Advisors: J.-F. Marckert (LaBRI, Université de Bordeaux 1) and J. Mairesse. Defended
3/12/2008. M. Albenque is now a CNRS researcher at LIX (École Polytechnique).
• Jérémie C ABESSA, A game theoretical approach to the algebraic counterpart of the Wagner hierarchy. Advisors: J. Duparc (Université de Lausanne, Switzerland) and J.-É. Pin. Defended
28/08/2007. J. Cabessa is now a chargé de cours at UNI Lausanne and EPFL Lausanne.
• Laura C HAUBARD, Méthodes algébriques pour les langages formels. Applications à la logique
et à la dynamique symbolique. Advisor: J.-É. Pin. Defended 05/04/2007. L. Chaubard is now an
engineer at DGA.
182
• Julien C RISTAU, Automates et logique temporelle sur les ordres linéaires. Advisor: O. Carton.
Defended 13/12/2010. J. Cristau is now an engineer at Logilab.
• Thu-Ha DAO -T HI, Les files et les reseaux zero-automatiques. Advisor: J. Mairesse. Defended
03/11/2007. T.-H. Dao-Thi is now a CNRS researcher at PRISM (Université de Versailles SaintQuentin-en-Yvelines).
• Achille F RIGERI, Problèmes de définissabilité logiques sur N, Z et Zp : applications des automates finis. Advisor: C. Choffrut. Defended 24/03/2009. A. Frigeri is now a temporary research
assistant at the Department of Electronics and Computer Science of the Politecnico di Milano.
• Guillaume D ELALLEAU, Substitutions sur la droite et dans le plan. Advisor: V. Berthé. Defended
17/11/2011.
• Karel K LOUDA, Combinatorics on beta-numeration. Advisors: Ch. Frougny and E. Pelantova
(CTU, Prague, Czech Republic). Defended 19/11/2010. K. Klouda is now an assistant-professor
at CTU Prague.
• Sébastien L ABB É, Structure des pavages, droites discrètes 3D et combinatoire des mots. Advisors: V. Berthé & S. Brlek (Université du Québec, Canada). Defended 4/05/2012. S. Labbé has
just received a two-year postdoc grant from FQRNT (Québec).
• Anna Chiara L AI, On expansions in non-integer base. Advisors: Ch. Frougny and P. Loreti
(Universita La Sapienza, Roma, Italy). Defended 09/03/2010. A. C. Lai is now a postdoctoral
researcher at Universita La Sapienza, Roma.
• Hoang-Thach N GUYEN, Reseaux de Petri stochastiques a forme produit. Advisor: J. Mairesse.
Defended 18/04/2012. H.-T. Nguyen will start a postdoc soon.
Post-doctoral researchers
• Ali A KHAVI (maı̂tre de conférence université de Caen, délégation CNRS). From 01/09/2005 to
31/08/2007.
• Achim B LUMENSATH (funded by ERC project GALE). From 01/04/2011 to 01/05/2012.
• Ana B U ŠI Ć (funded by ANR project MASED). From 01/09/2008 to 31/08/2009.
• Lucas G ERIN (funded by GAMMA). From 01/01/2009 to 31/08/2010
• Zur I ZHAKIAN (funded by ESF AutoMathA project). 6 months in 2008.
• Roberto M ERCAS (funded by the Spanish Ministry for research). From 01/01/2010 to 01/07/2010.
• Glenn M ERLET (funded by ANR project MASED). From 01/09/2006 to 31/08/2007.
• Éric T HIERRY (maı̂tre de conférence université ÉNS de Lyon, délégation CNRS). From
01/09/2007 to 31/08/2009.
• Konrad Z DANOWSKI (funded by ANR project JADE). From 01/09/2008 to 31/08/2009.
6.1.2.3
Long-term visitors (2007-2011)
• Mai G EHRKE (University of Nijmegen, Netherlands). 6 month (2010).
6.1.2.4
Others (2007-2011)
We list below the students that made an internship in our group while they were Master students (2nd
year) in France.
• Florent C APELLI (ÉNS Lyon), 2011.
• Luc DARTOIS (ÉNS Cachan), 2010.
183
• Laure DAVIAUD (ÉNS Cachan), 2011.
• Antoine D ELIGNAT-L AVAUD (ÉNS Cachan), 2011.
• David D URRLEMAN (ÉNS Paris), 2008.
• Axel H ADDAD (ÉNS Cachan), 2010.
• Denis K UPERBERG (ÉNS Lyon), 2009.
• Irène M ARCOVICI (ÉNS Lyon), 2009.
• Benoı̂t M ONIN (ÉNS Lyon), 2011.
• Hoang-Thach NG UYEN (École Polytechnique), 2008.
• Charles PAPERMAN (Université Paris Diderot-Paris 7), 2011.
• Antoine TAVENEAUX (ÉNS Lyon), 2010.
We list below the students that made an internship in our group while they were Master students (1st
year) in France.
• Nathaniel C ARR É (École Polytechnique), 2011.
• Guillaume L AGARDE (ÉNS Lyon), 2012.
6.1.3
Visitors
The following researchers have visited the group:
• Vérónica B ECHER (University of Buenos Aires, Argentina). 1 month (2007), 1 month (2008), 2
weeks (2009), 2 weeks (2010), 2 weeks (2012).
• Mai G EHRKE (University of Nijmegen, Netherlands). 1 months (2008).
• Peter G RABNER (TU Graz, Austria). 1 month (2007).
• Noam G REENBERG (Victoria University of Wellington, New Zealand). 1 month (2011).
• Juhani K ARHUM ÄKI (Turku University, Finland). 1 month (2008).
• Jarkko K ARI (Turku University, Finland). 1 month (2012).
• Cor K RAAIKAMP (TU Delft, Netherlands). 1 month (2009).
• Christof L ÖDING (RWTH Aachen, Germany). 1 month (2008).
• André N IES (University of Auckland , New Zealand). 1 month (2011).
• Jörg T HUSWALDNER (Montanuniversität Leoben, Austria). 1 month (2011).
• Hiroshi U MEO (Osaka University, Japan). 1 month (2009).
6.1.4
Team organization
6.1.4.1
See Section 1.4
6.1.4.2
Team activities
There are several seminars/working groups within the team. The one currently active are listed below.
• A weekly seminar. Information available at
http://www.liafa.univ-paris-diderot.fr/web9/manifsem/listmanifannee fr.php?typecongres=3
• A reading group (taking place every two weeks) on Calculability, Complexity and Randomness.
184
• A weekly working group on Recognisability (ANR FREC).
• A reading group on Logic, Automata, Algebra and Games. Information available at
http://www.liafa.univ-paris-diderot.fr/∼colcombe/RG LAG en.html
Along the period some other working groups have been active.
• A monthly working group on Games (co-organised with LSV): 2008–2010.
• A weekly reading group on the book of S. Arora et B. Barak, Computational Complexity: A
Modern Approach: 2010–2011.
• A working group on Mixing Times: 2011–2012.
• A working group on Discrete Event Systems. Information available at
http://liafa.jussieu.fr/∼klimann/SED/#exposes
6.1.4.3
Participation in the scientific community and administrative responsibilities
In CNRS
• From 2007 to 2010, V. Berthé was Chargée de mission Interface Mathématiques-Informatique for
the INS2I and INSMI institutes from CNRS.
• Since 2011, J. Mairesse is Chargé de mission Interface Mathématiques-Informatique for the INS2I
and INSMI institutes from CNRS.
In Foundations, in Federations
• Since 2011, V. Berthé is deputy-director of the Fondation Sciences Mathématiques de Paris.
• Since 2010, J. Mairesse is deputy-director of the Fédération de Recherche en Mathématiques de
Paris Centre (FR 2830).
In groupements de recherche (GdR)
• From 2006 to 2009, Ch. Frougny was deputy-director of GDR 673 of CNRS Informatique
Mathématique (IM).
• Since 2009, Ch. Frougny is a member of steering committee of GDR IM, in charge of young
actions.
• Since 2008 V. Berthé is a member of the scientific council of GDR Calcul Scientifique (GDR
3275).
• From 2006 to 2010, J. Mairesse was the head of the working group SDA2: Systèmes Dynamiques,
Automates et Algorithmique of GDR IM.
• Since 2010, V. Berthé is the co-head with Guillaume Theyssier (LAMA, université de Savoie) of
the working group SDA2: Systèmes Dynamiques, Automates et Algorithmique of GDR IM.
In steering commitees, executive boards or scientific councils of international and national structures
• Since 2009 J. Mairesse is a member of the Steering Committee of the École de Printemps
d’Informatique Théorique.
• Since 2009, M. Gehrke is a member of the executive board of Discrete, Interactive and Algorithmic Mathematics, Algebra and Number Theory (DIAMANT), one of the four mathematics clusters
in the Netherlands.
• Since 2007, J. Mairesse is a member of the executive board of the Société de Mathématiques
Appliquées et Industrielles (SMAI).
185
• From 2004 to 2010, J. Mairesse was a member of the executive board of the group MAS (Modèles
Aléatoires et Statistiques) of the SMAI.
• Since 2011, V. Berthé is a member of the scientific council of the city of Paris.
• Since 2004, V. Berthé is a member of the scientific council of the Centre International de rencontres mathématiques (CIRM).
• Since 2009, M. Gehrke is a member of the scientific board of the Lorentz International Center for
workshops in the Sciences.
• Since 2010, V. Berthé is a member of the scientific council Réseau Africain de Géométrie et
Algèbre Appliquées au développement (RAGAAD).
• Since 2011, J.-É. Pin is a member of the council of EATCS (European Association of Theoretical
Computer Science).
In the university
• From 2008 to 2010, J. B. Yunès was a Chargé de Mission at Université Paris Diderot-Paris 7 for
the Technologie de l’Information et de la Communication pour l’Enseignement (TICE).
• Until 2008, C. Choffrut was the head of the Thesis committee for computer science at Université
Paris Diderot-Paris 7.
In Research team heading
• From 2006 to 2010, J. Mairesse was the head of the team Automates et Applications.
• Since 2011, O. Serre is the head of the team Automates et Applications.
6.2
6.2.1
Management of international projects
AutoMathA (2005–2010). Type of project: Research Networking Programme of the European Science
Foundation. Full title: Automata: From mathematics to applications. Partners: 15 European
countries. Head: J.-É. Pin . Global budget: 600Ke. In LIAFA, all researchers from the Automates et applications group were involved in the project, as well as some researchers from the
Modélisation et Vérification group.
GALE (2011–2014). Type of project: ERC starting independent researcher grant. Full title: Games,
Automata, and Logics’ Extensions. Partners: LIAFA. Coordinator: T. Colcombet. Budget (for
LIAFA): 930Ke In LIAFA, the researchers involved in the project are Thomas Colcombet, Achim
Blumensath, Laure Daviaud, Stefan Göller and Amaldev Manuel.
Algorithmic Randomness for Non-Uniform Measures (2011–2012). Type of projet: Project FranceBerkeley. Partners: LIAFA, LIRMM (CNRS et Université de Montpellier 2) and University of
California Berkeley (USA). Coordinator: L. Bienvenu. Montant de la collaboration (pour le LIAFA): 7Ke.
In LIAFA, the researchers involved in the project are L. Bienvenu and his PhD students.
Non-standard representation of numbers: combinatorics, dynamics and finite automata (2007–
2008). Type of project: PHC Amadeus. Partners: LIAFA and TU Graz (Austria). Coordinators:
Ch. Frougny and Peter Grabner (TU Graz). Budget (for LIAFA): 4ke In LIAFA, the researchers
involved in the project were Ch. Frougny and W. Steiner.
Games for synthesis and verification of reactive systems (2007–2008). Type of project: PHC Polonium. Partners: LIAFA and Department of Computer Science (Warsaw University, Poland). Coordinators: W. Zielonka and D. Niwinski.In LIAFA, the researchers involved in the project were
O. Serre and W. Zielonka.
186
Suites infinies et aléatoriété algorithmique (2006–2008). Type of project: Bilateral project programme SECyT-FRIC. Partners: LIAFA and Universidad de Buenos Aires (Argentina). Coordinator: J.-É. Pin and V. Becher. In LIAFA, the researchers involved in the project were O. Carton,
S. Grigorieff and J.-É. Pin.
Aléatoriété et combinatoire des mots (2009–2010). Type of project: Bilateral project MINCyT- INRIA/CNRS 2009-2010. Partners: LIAFA and Universidad de Buenos Aires (Argentina). Coordinator: J.-É. Pin and V. Becher. In LIAFA, the researchers involved in the project were L. Bienvenu,
O. Carton, S. Grigorieff, J.-É. Pin and M. Raffinot.
PHC Picasso (2009–2010). Type of project: PHC Picasso. Partners: LIAFA and Universitad de Valencia (Spain). Coordinator: J.-É. Pin and A. Ballester-Bolinches. Budget (for LIAFA): 2500e
In LIAFA, the researchers involved in the project were O. Carton, C. Choffrut, J. Cristau and
J.-É. Pin.
6.2.2
Management of national projects
MASED (2006–2009). Type of project: ANR Jeunes chercheuses et jeunes chercheurs. Full title: Marches Aléatoires et Systèmes à Événements Discrets. Partners: LIAFA. Coordinator:
J. Mairesse. Budget (for LIAFA): 120Ke In LIAFA, the researchers involved in the project were
M. Albenque, A. Akhavi, A. Bušić, I. Klimann, J. Mairesse, G. Merlet and M. Picantin.
DyCoNum (2006–2010). Type of project: ANR Jeunes chercheuses et jeunes chercheurs. Full title:
Études diophantiennes, dynamiques et combinatoires de différentes numéations. Partners: LIAFA, IRISA (CNRS et Université de Rennes 1) and Institut Camille Jordan (CNRS et Université
Claude Bernard Lyon 1). Coordinator: W. Steiner. Budget (for LIAFA): 38Ke In LIAFA, the
researchers involved in the project were Ch. Frougny and W. Steiner.
JADE (2008–2012). Type of project: ANR Jeunes chercheuses et jeunes chercheurs. Full title: Jeux,
Automates, Décidabilité et Extensions. Partners: LIAFA. Coordinator: T. Colcombet. Budget (for
LIAFA): 90Ke In LIAFA, the researchers involved in the project were T. Colcombet and O. Serre.
Mathematically and Computationally Relevant Dualities (2009–2013). Type of project: Netherlands National Project. Partners: LIAFA and University of Nijmegen (Netherlands). Head:
M. Gehrke . Budget (for LIAFA): 2 PhD grants. In LIAFA, the researchers involved in the
project are Mai Gehrke and Sam van Gool.
6.2.3
Management of local projects
Groupes d’automates (2010–2011). Type of project: Projet inter-disciplinaire Univ. Paris DiderotParis 7. Partners: LIAFA and IMJ (CNRS, Univ. Pierre et Marie Curie et Univ. Paris Diderot).
Head (for LIAFA): J. Mairesse. Budget (for LIAFA): 8ke. In LIAFA, the researchers involved in
the project were I. Klimann, M. Picantin, J. Mairesse.
6.2.4
GASICS (2008–2011). Type of project: EuroCORE of the European Science Foundation. Full title:
Games for . Partners: CFV (Centre fédéré en vérification, Belgium), RWTH Aachen (Germany),
Aalborg University (Denmark), LSV (ÉNS Cachan), LIAFA and Unviersity of Warwick (UK).
Coordinator: J.-F. Raskin (CFV). In LIAFA, the researchers involved in the project were N. Fijalkow, F. Horn, F. Laroussinie, J.-É. Pin and O. Serre.
Proyecto MTM2010-19938-C03-01 (2010–2012). Type of project: Project funded by MICINN
(Spain). Full title: Propiedades aritmeticas y estructurales de los grupos. Aplicaciones. Coordinator: A. Ballester-Bolinchers (Universidad de Valencia). In LIAFA, the researcher involved in
the project is J.-É. Pin.
187
Fractals and topological structures arising from dynamics (2008–2009). Type of project: PHC
Amadeus. Partners: IRISA (CNRS, INRIA et Univ. Rennes 1), LIAFA, LIRMM (CNRS and
Université Montpellier 2), Montanuniversität Leoben (Austria) and TU Wien (Austria). Coordinators: V. Berthé (LIRMM) and J. Thuswaldner (Leoben). In LIAFA, the researcher involved in
the project was W. Steiner.
From fractals to numeration (2011–2012). Type of project: PHC Amadeus. Partners: IML (Université d’Aix-Marseille), IRISA (CNRS, INRIA et Univ. Rennes 1), LIAFA, LIRMM (CNRS and
Université Montpellier 2), and Montanuniversität Leoben (Austria) and TU Wien (Austria). Coordinators: A. Siegel (IRISA) and J. Thuswaldner (Leoben). In LIAFA, the researchers involved
in the project are V. Berthé and W. Steiner.
Principe variationnel et points génériques dans systèmes dynamiques (2012). Type of project:
PHC Orchid. Partners:LAMA (CNRS and Université Paris-Est Créteil Val de Marne), LAMFA
(CNRS, Université de Picardie Jules Verne), LIAFA, and National Dong Hwa University (Taiwan,
China). Coordinators: L. Liao (LAMA) and J.-C. Ban (National Dong Hwa University). In
LIAFA, the researcher involved in the project is W. Steiner.
6.2.5
Participation in national projects
LAREDA (2007–2009). Type of project: . Full title: Lattice Reduction Algorithms: Dynamics, Probabilities, Experiments, Applications. Partners: GREYC (CNRS et Université de Caen), LIRMM
(CNRS et Université Montpellier 2), IRISA (CNRS, INRIA et Université de Rennes 1), LIP
(CNRS et ÉNS Lyon) and IMB (CNRS et Université de Bourgogne). Coordinator: Brigitte Vallée
(GREYC). Coordinator in LIAFA: V. Berthé 1 . In LIAFA, the researcher involved in the project
was V. Berthé.
SubTile (2009–2012). Type of project: ANR blanche. Full title: Substitutions et pavages. Partners:
CPHT, Institut Camille Jordan, IGM, IML, IMT, LAMFA, LATP, LIF, LIP, LIRMM, LMO, and
Laboratoire J.-A. Dieudonné. Coordinator: P. Arnoux (IML). In LIAFA, the researcher involved
in the project is V. Berthé.
Kidico (2010–2013). Type of project: ANR Blanche. Full title: Knowledge Integration for Digital
convolution, Image Segmentation and Measurement. Partners: LSIIT, LIAFA, LORIA, LIMOS,
ISIT, LAMA, LIRMM, I3M and LIGM. Coordinator: M. Tajine (LSIIT). In LIAFA, the researcher
involved in the project is V. Berthé.
Categorical and Algebraic Models of Computation (2010–2013). Type of project: Netherlands national project. Partners: LIAFA and . Coordinator: Henk Barendregt (University of Nijmegen,
Netherlands). Budget (for LIAFA): 1 year postdoctoral grant. In LIAFA, the researcher involved
in the project is Mai Gehrke.
FREC (2010–2014). Type of project: ANR Blanche. Full title: Frontières de la reconnaissabilité. Partners: LaBRI and LIAFA. Coordinator: Pascal Weil (LaBRI). Coordinator in LIAFA: J.-É. Pin.
Budget (for LIAFA): 208ke. In LIAFA, the researchers involved in the project are O. Carton,
T. Colcombet, L. Daviaud, L. Dartois, M. Gehrke, N. Fijalkow, D. Kuperberg, C. Paperman, J.É. Pin, Y. Pequignot and O. Serre.
AMIS (2011–2014). Type of project: ANR Jeunes chercheuses et jeunes chercheurs. Full title: Algorithmic Methods for Infinite Structures. Partners: LIGM and LIAFA. Coordinator: A. Carayol
(LIGM). Coordinator in LIAFA: O. Serre. In LIAFA, the researchers involved in the project are
O. Serre and A. Haddad.
1. Actually the project was still managed in LIRMM
188
6.3
6.3.1
6.3.1.1
Editorial duties
Editorial board chair
RAIRO ITA. C. Choffrut and O. Serre are editor in chief of the journal RAIRO ITA
6.3.1.2
Annals of Applied Probability. Since 2010, J. Mairesse is an editor.
Queueing Systems. Since 2009, J. Mairesse is an editor.
International Journal of Algebra and Computation. J.-É. Pin is an editor.
RAIRO ITA. Since 2010, O. Carton is an editor.
Semigroup Forum. J.-É. Pin is an editor and a member of the council.
The Houston Journal of Mathematics. Since 2009, M. Gehrke is an editor.
6.3.2
6.3.2.1
Management of scientific conferences
Steering committee chair
AutoMathA. Automata: from Mathematics to Applications. J.-É. Pin (2007–2010).
6.3.2.2
GandALF. International Symposium on Games, Automata, Logics and Formal Verification.
W. Zielonka (since 2011).
CCR. Computability, Complexity and Randomness. L. Bienvenu (2010–2013).
TACL Topologies, Algebras, and Categories in Logic. M. Gehrke (since 2003).
6.3.2.3
Program committee chair
VALUETOOLS 2009 4th Int. Conf. on Performance Evaluation Methodologies and Tools, IEEE, Pisa,
Italy, 2009. J. Mairesse.
Stochastic Networks 2008 8th Stochastic Networks Conference, Paris, 2008 J. Mairesse (with F. Baccelli).
6.3.2.4
AFL 2008 Automata and Formal Languages, Balatonféred, 2008. O. Carton and Christian Choffrut.
The Algebra and Geometry around Knots and Braids St-Petersbourg, 2007. J. Mairesse.
ALCOP 2012 Algebra and Coalgebra meet Proof Theory, Prague, 2012. M. Gehrke.
ARITH 18 IEEE International Symposium on Computer Arithmetic, Montpellier, 2007. Ch. Frougny.
AUTOMATA 2010 International workshop on Cellular Automata and Discrete Complex Systems,
Nancy, 2010. J.-B. Yunès.
Colloque à l’occasion du 60ème anniversaire de B. Vallée Nombres, Séquences, Réseaux : analyse
dynamique d’algorithmes, Caen, 2010. V. Berthé
CALCO 2007 Conference on Algebra and Coalgebra in Computer Science, Bergen, 2007. J.-É. Pin.
CALCO 2009 Conference on Algebra and Coalgebra in Computer Science, Udine, 2009. J.-É. Pin.
189
CANT 2012 Combinatorics, Automata and Number Theory, Marseille, 2012. J. Mairesse.
CCR 2010 Computability, Complexity and Randomness, Notre Dame, 2010. L. Bienvenu.
CCR 2011 Computability, Complexity and Randomness, Cape Town, 2011. L. Bienvenu.
CCR 2012 Computability, Complexity and Randomness, Cambridge, 2012. L. Bienvenu.
CIAA 2007 International Conference on Implementation and Application of Automata, Prague, 2007.
J.-É. Pin.
CMCS 2012 Coalgebraic Methods in Computer Science, Tallinn, 2012. M. Gehrke.
CSL 2007 Computer Science Logic, Lausanne, 2007. J.-É. Pin.
CSR 2009 Computer Science Symposium in Russia, Ekaterinburg, 2007. J.-É. Pin.
CSR 2011 Computer Science Symposium in Russia, Saint-Petersburg, 2011. O. Carton.
DLT 2008 Developments in Language Theory, Kyoto, 2008. O. Carton.
DLT 2011 Developments in Language Theory, Milano, 2011. C. Choffrut.
FCT 2007 Foundations of Computer Science, 2007. J.-É. Pin.
FINCO 2007 Foundations of Interactive Computation, 2007. J.-É. Pin.
Forum Jeunes mathématiciennes V. Berthé (2010–2013).
FoSSaCS 2011 Foundations of Software Science and Computational Structures, 2011. O. Serre.
FST&TCS 2012 IARCS Annual Conference on Foundations of Software Technology and Theoretical
Computer Science, 2012 T. Colcombet.
GaLoP 2009 Games for Logic and Programming Languages, 2009. O. Serre.
GANDALF 2011 International Symposium on Games, Automata, Logics and Formal Verification, Minori, 2010. T. Colcombet.
ICALP 2008 International Colloquium on Automata Languages and Programming, Reykjavik, 2008.
W. Zielonka.
ICALP 2009 International Colloquium on Automata Languages and Programming, Rhodes, 2009.
C. Choffrut.
IFIP TCS 2010 6th IFIP International Conference on Theoretical Computer Science, Brisbane, 2010.
V. Berthé.
INFINITY 2008 10th International Workshop on Verification of Infinite-State Systems, Toronto,2008.
T. Colcombet.
IWIGP 2011 International Workshop on Interactions, Games and Protocols, Saarbrucken, 2011.
W. Zielonka.
JAC 2010 Journees Automates Cellulaires, Turku, 2010. J. Mairesse.
JMC 2012 Journées Machines à états finis et Combinatoire, Rouen, 2012. J. Mairesse.
Journées Montoises 2010 13èmes Journées Montoises d’Informatique Théorique, Amien, 2010.
V. Berthé and J. Mairesse.
LATA 2008 Conference on Language and Automata Theory and Applications, Tarragona, 2008.
Ch. Frougny and J.-É. Pin.
Laminations and symbolic dynamics 2012 , Marseille, 2012. V. Berthé.
LATIN 2008 American Theoretical Informatics Symposium, 2008. J.-É. Pin.
MFCS 2008 International Symposium of Computer Science, Torun, 2008. W. Zielonka.
MFCS 2009 International Symposium of Computer Science, 2009. J.-É. Pin.
190
MFCS 2010 International Symposium of Computer Science, 2010. T. Colcombet and J.-É. Pin.
Numeration 2011 , Liège, 2011. V. Berthé, Ch. Frougny and W. Steiner.
RNC 2007 7th Conference on Real Numbers and Computers, 2007. Ch. Frougny.
SOFSEM 2008 Current Trends in Theory and Practice of Computer Science, High Tatras, 2008.
C. Choffrut and W. Zielonka.
SOFSEM 2010 Current Trends in Theory and Practice of Computer Science, , 2010. O. Serre.
SOFSEM 2012 Current Trends in Theory and Practice of Computer Science, Spindleruv Mlyn, 2012.
W. Zielonka.
STACS 2009 Annual Symposium on Theoretical Aspects of Computer Science, 2009. Ch. Frougny.
STACS 2011 Annual Symposium on Theoretical Aspects of Computer Science, Dortmund, 2011.
C. Choffrut and T. Colcombet.
Stochastic Networks Conference 2010 Cambridge, 2010. J. Mairesse.
WORDS 2009 7th International Conference on Words, Salerno, 2009. C. Choffrut.
WORDS 2011 7th International Conference on Words, Prague, 2011. Ch. Frougny.
6.3.3
6.3.3.1
Local arrangements committee chair
International Conferences:
Stochastic Networks 2008. Conference organised in ÉNS, Paris, June 2008. J. Mairesse (with F. Baccelli).
Numeration: Mathematics and Computer Science. Conference organised in CIRM, Marseille, 23–
27 March 2009. W. Steiner.
International School:
CANT’12. International School and Conference on Combinatorics, Automata and Number Theory,
CRIM, Marseille, May 2012. V. Berthé.
Workshops:
JORCAD’08. Workshop organised in Rouen, September 2008. J. Mairesse.
ALEA’09. Workshop organised in CIRM, Marseille, March 2009. J. Mairesse (with A. Micheli and
D. Poulalhon).
Distance Automata and Generalisations Workshop organised in LIAFA, Paris, 16–18 November
2009. T. Colcombet.
FRAC-SDA2-NAFIT. Workshop organised in Nice, December 2009. J. Mairesse.
Recursion Schemes and Pushdown Automata. Workshop organised in LIAFA, Paris, 25–26 March
2010. O. Serre.
Digital expansions, dynamics and tilings. Workshop organised in Aussois, 4–10 April 2010.
W. Steiner.
GT Jeux. Workshop of the GT CMF (GDR-IM), Paris, 25–26 October 2010. O. Serre
Automata and logic for data manipulating programs. Workshop organised in LIAFA, Paris, 7–8 December 2010. Ł. Kaiser and O. Serre.
Computability and randomness. Workshop organised in LIAFA, Paris, 7–8 June 2011. L. Bienvenu.
GT CMF. Workshop of the GT CMF (GDR-IM), Paris, 22–24 June 2011. S. Perifel.
Journées Calculabilités. Workshop organised in LIAFA, Paris, 5–6 March 2012. L. Bienvenu.
191
6.3.3.2
Local arrangements committee member
Journées d’Informatique Mathématique. Annual worskhop of GDR IM organised in Paris since
2007. Ch. Frougny.
École Jeunes Chercheurs. Annual school of GDR IM organised in France since 2007. Ch. Frougny.
Numeration 2008 . Conference organised in Prague, 26–30 May 2008. Ch. Frougny and W. Steiner.
Equational Theory of Regular Languages. Workshop organised in Brno, 5–6 March 2009. J.-É. Pin.
Automata and Algorithmic Logic. Workshop organised in Stuttgart, 28–29 June 2010. T. Colcombet.
Logic Colloquium (LC 2010). Conference organised in Paris, July 2010. T. Colcombet and J.-É. Pin.
Combinatorics on Words. Workshop organised in Mathematisches Forschungsinstitut Oberwolfach,
22-28 August 2010. V. Berthé (with J. Karhumäki, D. Nowotka and J. Shallit).
FoSSaCS 2010. International Conference on Foundations of Software Science and Computational
Structures, Paris, 31 August–3 September 2010. O. Serre.
Computability, Complexity and Randomness. Workshop organised in Dagstuhl, 9–13 January 2011.
L. Bienvenu.
Workshop on Sand Pile Model. Workshop organised in LIAFA, Paris, 7–8 April 2011. J.-B. Yunès.
GAMES 2011. Annual Workshop of the ESF Networking Programme on Games for Design and Verification, Paris, 31 August–3 September 2011. T. Colcombet, O. Serre and W. Zielonka.
6.3.4
6.3.4.1
International
CAUL. Member of the Advisory Committee, Centro de Álgebra da Universidade de Lisboa (Portugal).
J.-É. Pin.
FNRS. Expert for the Fonds de la Recherche Scientifique (Belgium). J. Mairesse.
6.3.4.2
National
ANR blanche et JCJC Member of Comité Scientifique Disciplinaire. Christiane Frougny (2007), Jean
Mairesse (2007–2008).
PEDR Member of jury PEDR, 2008. Christiane Frougny.
AERES Évaluateur. Christiane Frougny, Jean Mairesse.
6.3.4.3
École Normale Supérieure de Cachan O. Serre (2012)
IUT de Fontainebleau 2012 Christian Choffrut (2012)
Université de Besançon I. Klimann (2008–2009),
Université Bordeaux 1 W. Zielonka (2012), J. Mairesse (2007–2008,2009,2010, 2011: chaire CNRS,
2012), O. Serre (2011: chaire CNRS, 2012)
Université de Caen J. Mairesse (2007–2008)
Université de Cergy-Pontoise Ch. Frougny (2009)
Université Joseph Fourier, Grenoble V. Berthé (2010: chaire CNRS), J. Mairesse (2011: chaire
CNRS)
192
Université de la Méditerranée (Aix-Marseille II) C. Choffrut (2008), W. Steiner (2009), T. Colcombet (2012)
Université de Montpellier 2 V. Berthé (2011), J. Mairesse (2011, 2012)
Université de Nice V. Berthé (2012,2011,2010: chaire CNRS)
Université Paris Diderot – Paris 7 Ch. Frougny (2007–2008), J. Mairesse (2007–2008, 2009), S. Perifel (2010), O. Serre (2007–2008), V. Berthé (2012)
Université Paris-Est Marne-la-vallée I. Klimann (2007), T. Colcombet (2009: chaire CNRS),
Ch. Frougny (2009–2010), J. Mairesse (2010)
Université Paris Sud S. Perifel (2010)
Université de Provence (Aix-Marseille I) M. Gehrke (2012), S. Grigorieff (2007–2008), O. Serre
(2007–2008)
Université de Rouen C. Choffrut (2007–2008), Ch. Frougny (2008–2010)
Université de Strasbourg V. Berthé (2012)
Université de Versailles St-Quentin-en-Yvelines V. Berthé (2010: chaire CNRS), J. Mairesse
(2012: chaire CNRS)
6.4
Teaching, advising, and evaluation activities
6.4.1
6.4.1.1
Theses and HdR defended
J.-B. Yunès. À propos d’automates cellulaires suivi par Des fonctions Booléennes.
12/12/2007.
6.4.1.2
Defended
Doctoral theses
Marie A LBENQUE. Tresses, animaux, cartes : à l’interaction entre combinatoire et probabilités. Advisors: J.-F. Marckert (LaBRI, Université de Bordeaux 1) and J. Mairesse. Defended 3/12/2008.
Jérémie C ABESSA. A game theoretical approach to the algebraic counterpart of the Wagner hierarchy.
Advisors: J. Duparc (Université de Lausanne, Switzerland) and J.-É. Pin. Defended 28/08/2007.
Laura C HAUBARD. Méthodes algébriques pour les langages formels. Applications à la logique et à
la dynamique symbolique. Advisor: J.-É. Pin. Defended 05/04/2007. L. Chaubard is now an
engineer at DGA.
Julien C RISTAU. Automates et logique temporelle sur les ordres linéaires. Advisor: O. Carton. Defended 13/12/2010.
Guillaume D ELALLEAU. Substitutions sur la droite et dans le plan. Advisor: V. Berthé. Defended
17/11/2011.
Thu-Ha DAO -T HI. Les files et les reseaux zero-automatiques. Advisor: J. Mairesse. Defended
03/11/2007.
Achille F RIGERI. Problèmes de définissabilité logiques sur N, Z et Zp : applications des automates
finis. Advisor: C. Choffrut. Defended 24/03/2009
Karel K LOUDA. Combinatorics on beta-numeration. Advisors: Ch. Frougny and E. Pelantova (CTU,
Prague, Czech Republic). Defended 19/11/2010.
Sébastien L ABB É. Structure des pavages, droites discrètes 3D et combinatoire des mots. Advisors:
V. Berthé & S. Brlek (Université du Québec, Canada). Defended 4/05/2012.
193
Anna Chiara L AI. On expansions in non-integer base. Advisors: Ch. Frougny and P. Loreti (Universita La Sapienza, Roma, Italy). Defended 09/03/2010.
Hoang-Thach N GUYEN. Reseaux de Petri stochastiques a forme produit. Advisor: J. Mairesse. Defended 18/04/2012.
6.4.2
6.4.2.1
Thesis and habilitation reports
Reports for Habilitations à Diriger les Recherches
V. Berthé. Reviewer for the Habilitation thesis of L. Fuchs, Fondements algébriques de la modélisation
géométrique, Université de Strasbourg, 2010.
C. Choffrut. Reviewer for the Docentship in Mathematics of J. Honkala, Turku University, Finland,
2007.
Reviewer for the Habilitation thesis of D. Rossin, Analyse combinatoire de modèles physiques et
biologiques, Université Paris Diderot-Paris 7, 2007.
Reviewer for the Habilitation thesis of P.Q. Nguyen, Théorie et pratique de la Cryptanalyse à clef
publique, École Normale Supérieure de Paris, 2007.
Ch. Frougny. Reviewer for the Habilitation thesis of L. Imbert, Arithméxotiques, Montpellier, 2008.
J. Mairesse. Reviewer for the Habilitation thesis of J.-B. Yunès, À propos d’automates cellulaires suivi
par Des fonctions Booléennes, Université Paris Diderot-Paris 7, 2007.
Reviewer for the Habilitation thesis of S. Haar, Law and partial order - Nonsequential behavior
and probability in asynchronous sytems, Université de Rennes 1, 2008.
Reviewer for the Habilitation thesis of T. Bonald, Évaluation de performance de réseaux de
données, Université Pierre et Marie Curie-Paris 6, 2010.
President of the committee for the Habilitation thesis of E. Jeandel, Propriétés structurelles et
calculatoires des pavages, Université de Marseille, 2011.
J.-É. Pin. President of the committee for the Habilitation thesis of P.-C. Héam, Automates finis pour la
fiabilité logicielle et l’analyse d’accessibilité, Université de Besançon, 2009.
President of the committee for the Habilitation thesis of C. Nicaud, Analyse d’algorithmes et
génération aléatoire en théorie des langages, Université de Marne-la-Vallée, 2011.
Reviewer for the Habilitation thesis of P. Habermehl, Contribution à la vérification de systèmes
avec structures de données complexes à l’aide d’automates, Université Paris Diderot-Paris 7,
2009.
Reviewer for the Habilitation thesis of T. Touili, Modélisation et Analyse d’Accessibilité des Programmes Récursifs Concurrents, Université Paris Diderot-Paris 7, 2009.
Reviewer for the Habilitation thesis of M. Kunc , Implicit Language Equations, Brno University,
Czech Republic, 2010.
Reviewer for the Habilitation thesis of M. Rigo, Systèmes de numération abstraits et combinatoire
des mots, Université Paris 11, 2010.
J.-B. Yunès. Reviewer for the Habilitation thesis of C. Prieur, Réseaux sociaux, algorithmes, identités,
Université Paris Diderot-Paris 7, 2012.
6.4.2.2
Thesis reports
V. Berthé. Reviewer for the PhD thesis of M. Said, Géométrie multi-résolution des objets discrets
bruités, Université de Chambéry, 2010.
Reviewer for the PhD thesis of A. Blondin-Massé, À l’intersection de la combinatoire des mots et
de la géométrie discrète : palindromes, symétries et pavages, UQAM, Montréal, Canada, 2011.
194
O. Carton. Reviewer for the PhD thesis of R. de Souza, Étude structurelle des transducteurs de norme
bornée, ÉNST, 2008.
Reviewer for the PhD thesis of B. Cagnard, Étude topologique de fonctions définissables par
automate, Université de Corse, 2008.
Reviewer for the PhD thesis of S. Hassen, Synchronisation de grammaires de graphes, Université
de La Réunion, 2009.
Reviewer for the PhD thesis of J. M. Sastre-Martinez, Algorithmes performants à états finis pour
l’application de grammaires locales, Université Paris Est, 2011.
Reviewer for the PhD thesis of T. V. Duc, Des codes pour engendrer les langages de mots infinis,
Université de Nice, 2011.
C. Choffrut. Reviewer for the PhD thesis of E. Czeizler, Intricacies of word equations, Turku University, Finland, 2007.
Reviewer for the Licentiate thesis of A. Saarela, A new proof of Hmelevski’s Theorem, Turku University, Finland, 2009.
Reviewer for the PhD thesis of J. Lin, Size constaint clustering, Milano University, Italy, 2012.
Reviewer for the PhD thesis of P.-Y. Angrand, Contribution à l’étude des expressions rationelles,
et à l’étude des systèmes d’énumération abstraits, ÉNST, 2012.
Ch. Frougny. Reviewer for the PhD thesis of N. Aubrun, Dynamique symbolique des systèmes 2D et
des arbres infinis, Université Paris Est, 2011.
S. Grigorieff Reviewer for the PhD thesis of H. Zenil, Une approche expérimentale à la théorie algorithmique de la complexité, Université Paris 1 Panthéon-Sorbonne, 2011.
J. Mairesse Reviewer for the PhD thesis of M.-A. Tran, Insensibilité dans les réseaux de files d’attente
et applications au partage de ressources informatiques, École Polytechnique, 2007.
Reviewer for the PhD thesis of C. Holtzmann, Sous-groupe de petit indice des groupes de tresses
et systèmes de réécriture, Université de Bourgogne, 2008.
Reviewer for the PhD thesis of J. Fromentin, Forme normale tournante des tresses, Université de
Caen, 2009.
Reviewer for the PhD thesis of L. Boyer, Comportements typiques dans les automates cellulaires,
Université de Chambéry, 2010.
M. Picantin External Examiner for the PhD thesis of M. Cummings, Garside Groups and Enumeration
of Partitions, Warwick university, UK, 2009.
J.-É. Pin Reviewer for the PhD thesis of A. Costa, Profinite semigroups and symbolic dynamics, Porto
university, Portugal, 2007.
Reviewer for the PhD thesis of V. Bárány, Automatic Presentations of Infinite Structures, RWTH
Aachen, Germany, 2007.
Reviewer for the PhD thesis of R. Jungers, Infinite Matrix Products. From the joint spectral radius
to combinatorics, Université de Louvain la Neuve, Belgium, 2008.
Reviewer for the PhD thesis of J. Otero Pombo, Robust Lexical Analysis, Vigo University, Spain,
2009.
Reviewer for the PhD thesis of X. Allamigeon, Static analysis of memory manipulations by abstract interpretation Algorithmics of tropical polyhedra, and application to abstract interpretation, École Polytechnique, 2009.
Reviewer for the PhD thesis of A. Moura, Pseudovarieties: idempotent-generated semigroups and
representations of DA, Porto university, Portugal, 2009.
Reviewer for the PhD thesis of T. Place, Decidable Characterizations for Tree Logics, École Normale Supérieure de Cachan, 2010.
Reviewer for the PhD thesis of S. Toruńczyk, Languages of profinite words and the limitedness
problem, Warsaw University, Poland, 2011.
195
O. Serre Reviewer for the PhD thesis of A. Da Costa Lopes, Propriétés de jeux multi-agents, École
Normale Supérieure de Cachan, 2011.
W. Steiner Reviewer for the PhD thesis of C. Kalle, Expansions and Extensions, Universiteit Utrecht,
Netherlands, 2009.
6.4.3
6.4.3.1
Teaching
University courses at M2R level
MPRI Theory of computations, L. Bienvenu and S. Perifel. [Link to the course webpage].
MPRI Mathematical Foundations of Automata Theory, O. Carton and J.-É. Pin. [Link to the course
webpage].
MPRI Game theory techniques in computer science, O. Serre and W. Zielonka. [Link to the course
webpage].
MPRI Modélisation par automates finis, C. Choffrut, T. Colcombet, Ch. Frougny and I. Klimann. [Link
to the course webpage].
MPRI Cours de mise à niveau en Probabilités, J. Mairesse (from 2005 to 2007).
MPRI Dynamique et algorithmique des réseaux, J. Mairesse (from 2006 to 2009).
CTU Prague Periodicity and finiteness in non-standard numeration systems, Ch. Frougny, March 2011.
TU Graz Automata, languages and numeration systems, Ch. Frougny, March 2012.
6.4.3.2
Special thematic programs and specialist courses
Research Schools
ALEA Journées ALEA, école thématique du CNRS. Marseille, 2007. J. Mairesse.
ENS Lyon Research school on computability and complexity, Lyon, 2011. S. Perifel.
ENS Lyon Research school on computability and complexity, Lyon, 2012. L. Bienvenu.
EJCIM “Ecole Jeunes Chercheurs en Informatique Mathématique”, Rennes, 2012. Applications de
systèmes dynamiques discrets, V. Berthé.
EPIT “Ecole de Printemps d’Informatique Théorique”, Bordeaux, 2012. Automata with counters,
T. Colcombet.
EPIT “Ecole de Printemps d’Informatique Théorique”, Bordeaux, 2012. Profinite approach to language
theory,
Spring School on Algorithmic Game Theory École thématique du CNRS (GDR RO), Paris, 2012.
Introduction to game theory, O. Serre.
Other
Rencontres algorithmique et programmation “Jeux concurrents”, CIRM, 2009, O. Serre.
Univ. Madagascar École de Combinatoire et Algorithmique de Madagascar, Antananarivo, 2011.
Cours de programmation, J.-B. Yunès.
ISN Lectures for high school teachers for the forthcoming speciality “Informatique et Science du
Numérique” (ISN), 2012. L. Bienvenu and J.-B. Yunès.
196
6.4.3.3
Board of examiners
ÉNS Paris J. Mairesse was an examiner in the first year selection process of École Normale Supérieure
de Paris (“Informatique Fondamentale”) until 2007.
ÉNS Paris O. Carton was an examiner in the first year selection process of École Normale Supérieure
de Paris (“TIPE Option informatique”) until 2007.
ÉNS Paris O. Serre was an examiner in the first year selection process of École Normale Supérieure de
Paris (“Informatique Fondamentale”) from 2008 to 2010.
ÉNS Cachan O. Serre is an examiner in the third year selection process of École Normale Supérieure
de Cachan (written and/or oral examination) since 2009.
ÉNS Paris O. Serre is an examiner in the first year selection process of École Normale Supérieure de
Paris (“TIPE Option informatique”) since 2011.
6.4.3.4
Popularization
Mathematic Park I. Markovici and A. Taveneaux are members of the steering committee of Mathematic Park, a seminar for high school and undergraduate students and their teachers. See
http://www.ihp.fr/fr/seminaire/mathematic-park.
International Mathematical Olympiad Antoine Taveneaux is one the coaches of the France team for
the International Mathematical Olympiad.
MATh.en.JEANS A. Taveneaux is a member of the executive board of MATh.en.JEANS. He is also
taking care of two high schools (Collège Camille Claudel and Collège du Moulin des Prés).
Fête de la Science Numerous talks from the members of the group.
High schools Several talks by J.-B. Yunès.
Collège Belgique “Arithmétique, automates et géométrie discrète; Fractions continues en géométrie
discrète arithmétique”, 2011, V. Berthé.
La Recherche “Un ordinateur pourra-t-il répondre à cette question ?”, La recherche, 449 (01/2011),
T. Colcombet.
Cité des Sciences et de l’Industrie Talk on cryptography and complexity, 2011, S. Perifel.
√
Images des mathématiques “Nombres et représentations. Les décimales de 2 sont-elles aléatoires?”,
2011, V. Berthé.
Movies J. Mairesse was the scientific advisor for the movie “Le modèle Turing” produced by CNRS
Images in 2012, and on the same topic he took part to the “Researchers’ Film Festival”. See
http://www.filmdechercheur.eu.
Mathematic Park “Fractions continues et tracés de droites”, 2012, V. Berthé.
6.4.4
Prices and distinctions
• CNRS Bronze medal awarded to T. Colcombet in 2011.
• Prize and subvention of the Simone and Cina del Duca Foundation awarded by the French
Academy of Science to J. Mairesse in 2009.
• Election of J.-É. Pin to the Academia Europeae.
• Best paper awards in ICALP’08 for [GGP08].
• Best paper awards in ICALP’11 for [CCP11].
• Best paper awards in Int. Conf. on Petri Nets’11 for [HMN11].
197
198
Partie V
Equipe Combinatoire
199
Chapitre 1
1.1
Thématique générale et principaux objectifs
1.1.1
Constitution de l’équipe
L’équipe combinatoire du LIAFA a été créée en Janvier 2011. Elle est formée de huit permanents :
– Guillaume Chapuy (CR)
– Sylvie Corteel (DR)
– Enrica Duchi (MdC)
– Jeremy Lovejoy (CR)
– Roberto Mantaci (MdC - HDR)
– Anne Micheli (MdC)
– Dominique Poulalhon (MdC)
– Vlady Ravelomanana (Pr)
Notons que Dominique Poulalhon (MdC) est en détachement au CNRS de 2009 à 2013 au LIX et sera
de retour en Juin 2013.
La combinatoire est un thème historique et important du LIAFA. Daniel Krob (DR) et Michel Morvan
(Pr) ont été les piliers de la thématique jusqu’à leur départ aux débuts des années 2000. Dominique
Rossin (CR) a ensuite pris la direction de l’équipe puis a quitté le LIAFA pour le LIX en 2010. En 2007,
la “partie combinatoire” de l’équipe Algorithmique et Combinatoire était formée de E. Duchi (MdC,
arrivée en 2007), J. Lovejoy (CR, arrivé en 2007), A. Micheli (MdC depuis 2002), R. Mantaci (MdC
depuis 1992), D. Poulalhon (MdC depuis 2003), D. Rossin (CR) et des doctorants M. Bouvel et O.
Mallet. Dans la période 2007-2012, le groupe a également inclus temporairement O. Bodini (délégation
CNRS), F. Disanto (doctorant en cotutelle), JS. Kim (postdoctorant), P. Nadeau (ATER) et V. Pilaud
(ATER). Mais c’est depuis l’arrivée de Vlady Ravelomanana en tant que professeur en 2009 et de Sylvie
Corteel et Guillaume Chapuy en 2010 que le groupe a vraiment pu se former, avec un recentrage des
thématiques autour de la combinatoire énumérative et de l’analyse d’algorithmes.
Les débuts de l’équipe ont d’abord été non officiels. Nous avons commencé par créer un séminaire
hebdomadaire en Mars 2010 organisé par Sylvie Corteel et Vlady Ravemolamanana. Puis en Septembre
2010, nous avons créé un groupe de lecture organisé par Guillaume Chapuy. C’est suite à cette émulation
scientifique que la direction du LIAFA a décidé de la création de l’équipe combinatoire.
L’équipe combinatoire est une équipe ancrée dans les thématiques de l’informatique théorique. Nos
spécialités sont la combinatoire énumérative et l’analyse d’algorithmes. De plus, nous sommes une
équipe ouverte à l’interdisciplinarité. Ainsi Jeremy Lovejoy est un chercheur qui vient de la section
01 (Mathématiques) et travaille à l’interface de la combinatoire et de la théorie des nombres. Nous
201
CHAPITRE 1. RAPPORT SCIENTIFIQUE : COMBINATOIRE
nous intéressons aussi aux interactions entre la combinatoire algébrique, la physique théorique et les
probabilités. Pendant l’année 2011-2012, nous accueillons Jérémie Bouttier (CEA Saclay en délégation).
La spécialité de Jérémie est la physique combinatoire et il est maintenant membre associé de l’équipe.
Notre autre membre associé est Philippe Biane (DR CNRS) qui est probabiliste.
La thématique combinatoire a également vu une évolution pour l’encadrement de doctorants. Ainsi dans
la période 2007-2012, trois thèses ont été soutenues : Olivier Mallet (2008 sous la direction de Jeremy
Lovejoy), Mathilde Bouvel (2009 sous la direction de Dominique Rossin) et Filippo Disanto (2010 en
cotutelle sous la direction d’Enrica Duchi et Simone Rinaldi (Université de Sienne)). Actuellement cinq
thèses sont en préparation :
– 2009- : Adeline Pierrot (direction de D. Rossin) AMN
– 2010- : Sandrine Dasse-Hartaut (direction S. Corteel) AM Paris Diderot
– 2011- : Robin Langer (direction S. Corteel) ANR IComb
– 2011- : Elie de Panafieu (direction V. Ravelomanana) AMN
– 2011- : Antoine Crouzet (direction V. Ravelomanana) Prof en lycée
Au LIAFA, nous avons des interactions avec plusieurs équipes. Les interactions les plus naturelles sont
avec l’équipe automates et en particulier les personnes qui s’intéressent aux systèmes dynamiques
discrets. Ainsi trois projets de recherche ont été menés conjointement avec des membres des deux
équipes sur la période 2007-2012 (Mairesse-Micheli-Poulalhon, Mantaci-Yunès et Chapuy-Klimann).
Mais d’autres interactions voient le jour naturellement. Ainsi en Juin 2012 Eugène Asarin (Vérification)
a fait un exposé au séminaire sur ses travaux sur les séries génératrices liées aux automates temporisés.
Jean-Eric Pin (Automates) sera orateur en Octobre 2012. Nous étudierons les interactions possibles
avec les gens autour de Paul-André Melliès à PPS. Nous avons aussi des interactions naturelles avec le
département de mathématiques de l’Université Paris-Diderot avec des chercheurs du LPMA (S. Péché,
J. Salez) et de l’IMJ (B. Keller, M. Vergne).
Nous avons des collaborations avec des chercheurs et enseignants-chercheurs de Paris 6, Paris 13, Marne
la Vallée, Orsay, Polytechnique, Marseille, Bordeaux et Lyon. Notre positionnement géographique central fait que plusieurs chercheurs franciliens participent à nos activités scientifiques et ceci amènent
beaucoup de discussions et de collaborations. De plus, notre équipe est naturellement internationale
puisque certains de nos membres viennent de Madagascar, d’Italie et des Etats-Unis. Même si nos collaborations sont principalement avec ces pays, nous collaborons aussi avec des chercheurs d’Espagne,
du Canada et de l’Irlande.
Les thèmes de recherche de l’équipe se déclinent autour de plusieurs axes que nous présenterons cidessous. Néanmoins tous les membres participent à plusieurs axes et cela fait notre force. Nous pouvons
ainsi attaquer les problèmes avec les techniques appropriées et collaborer activement.
– Combinatoire énumérative et bijective (B, Ch, Co, D, L, Ma, Mi, P, Ro)
– Combinatoire algébrique (Ch, Co)
– Combinatoire analytique (Co, Ra)
– Combinatoire des cartes planaires et de genre supérieur (B, Ch, Mi, P)
– Structures aléatoires (Ch, Ra)
– Algorithmes de génération aléatoire et exhaustive (D, Ma, P)
– Algorithmes combinatoires (Mi, P, Ro)
– Séries hypergéométriques (Co, L)
202
(Code : B=Bouttier, Ch=Chapuy, Co=Corteel, D=Duchi, L=Lovejoy, M=Mantaci, Mi=Micheli,
P=Poulalhon, Ra=Ravelomanana, Ro=Rossin)
Dans la partie suivante, nous mettrons en avant quelques résultats significatifs dans la plupart des thèmes
présentés ci-dessous.
1.2
Exemples de résultats significatifs
C. Alfes (Cologne, Allemagne), K. Bringmann (Cologne, Allemagne), J. Lovejoy (LIAFA) et R.
Osburn (UCD, Irlande) ; q-séries et fonctions Mock Theta Dans une série d’articles en collaboration
avec C. Alfes, K. Bringmann, et R. Osburn, nous étudions la mock-modularité des séries basiques
hypergéometriques (q-séries). Nous trouvons des q-séries qui sont à la fois des formes mock modulaires
de poids 3/2, à la fois des eigenforms pour les opérateurs de Hecke, et à la fois des fonctions
génératrices pour les nombres de classes de Hurwitz. Nous nous laissons guider par la combinatoire.
Par exemple, notre premier exemple est la fonction génératrice pour les surpartitions pondérées de la
parité du rang de Dyson. Nous trouvons également des fonctions mock thêta, dont certaines familles
infinies construites à partir de la chaı̂ne de Bailey. Certains résultats ont été publiés dans Math. Proc.
Cambridge Phil. Soc. et les autres sont soumis à un journal international (voir arXiv :1008.3474 et
arXiv :1201.6194).
M. Albenque (LIX) et J. Bouttier (LIAFA) ; Cartes et constellations. Dans l’article ”Constellations
and multicontinued fractions” co-écrit avec M. Albenque (LIX), nous développons une extension de
la théorie combinatoire des fractions continues introduite par Flajolet. L’objectif est de prouver une
formule conjecturée par P. Di Francesco (CEA) reliant combinatoire énumérative (comptage d’une famille de cartes planaires appelées constellations) et systèmes intégrables (équations KP, originellement
introduites en physique ondulatoire). Notre premier résultat est la preuve, par une méthode bijective
élémentaire, de la formule dans le cas des ”triangulations eulériennes”. Nous obtenons également
des expressions déterminantales dans le cas général. Ce travail sera présenté à FPSAC2012 (voir
arXiv :1112.6379).
M. Bousquet-Mélou (LABRI), G. Chapuy (LIAFA) et L.F. Préville-Ratelle (Montréal) ; Démonstration
des conjectures de François Bergeron sur les intervalles de Tamari. Il s’agit de la réalisation d’un projet
de recherche ambitieux démarré en 2010 avec M. Bousquet-Mélou (Bordeaux) and L.-F. PrévilleRatelle (Montréal). Ces conjectures trouvent leur origine dans la théorie très active outre-Atlantique des
algèbres coinvariantes, et dans les généralisations de la fameuse “conjecture n!” démontrée par Haiman
en 2002. Elles concernent l’énumération d’objets appelés intervalles de Tamari, et plus généralement
l’étude fine d’une représentation associée du groupe symétrique. La résolution du problème repose sur
l’application inattendue de techniques trouvant leur origine dans le domaine de l’énumération de cartes
combinatoires, ce qui suggère un lien fructueux entre les deux domaines et d’importantes possibilités
d’ouvertures et de développements futurs. Ce travail sera présenté à FPSAC2012 (voir arXiv :1109.2398
et arXiv :1202.5925 ).
S. Corteel (LIAFA) et L. Williams (Berkeley) ; Combinatoire des moments des polynômes orthogonaux. Sylvie Corteel (LIAFA) et Lauren Williams (Berkeley) ont récemment proposé une interprétation
combinatoire des moments des polynômes d’Askey Wilson. Ces travaux sont principalement combinatoires, bien que ces moments ne soient ni des entiers, ni à coefficients positifs. C’est grace à la
physique statistique et au modèle d’exclusion, que ce probleme a pu être resolu. Ces travaux permettent
de boucler un chantier engagé par P. Flajolet en 1980 et mis sous forme de théorie par X. Viennot dans
les années 80 sur la combinatoire des fractions continues et des moments des polynômes orthogonaux.
203
En effet les polynômes d’Askey Wilson sont les polynômes orthogonaux les plus généraux. Ces travaux
sont publiés dans Duke Mathematical Journal (2011) et Transactions of the AMS (2012).
H. Daudé (Marseille), V. Ravelomanana (LIAFA) ; Analyse d’algorithmes et transition de phase Nous
considérons le problème de satisfiabilité des formules 2− XOR où chaque instance est une conjonction
d’équations booléennes (clauses) de la forme x ⊕ y = 0 ou x ⊕ y = 1. Une formule de m clauses
impliquant n variables booléennes
est constituée de m clauses choisies aléatoirement uniformément
parmi toutes les n(n−1)
clauses
possibles.
Quand n tend vers l’infini et m approche n/2, la formule
m
est sujette à une transition de phase : la probabilité de satisfiabilité décroı̂t vers zéro. En utilisant une
approche combinatoire et analytique, nous proposons une description précise des régions sous-critique
et critique de la transition de phase des formules 2−XOR. Ce travail est publié dans Algorithmica (2011).
F. Disanto (Sienna), E. Duchi (LIAFA), S. Rinaldi (Sienna), G. Schaeffer (LIX) ; Sur les permutations
avec un nombre fixé de points intérieurs. Nous définissons les records d’une permutation σ comme
ses minima (resp. maxima) de gauche à droite et de droite à gauche. Un point (i, j) avec j = σ(i)
est un point intérieur de la permutation si et seulement si ce n’est pas un record. Les permutations
n’ayant pas de points intérieurs sont appellées carrées. On considère l’énumération des permutations
avec un nombre fixé de points intérieurs. En étendant une construction obtenue avec D. Poulalhon pour
l’énumération des permutations carrées, on arrive à montrer que la série génératrice des permutations
avec un nombre fixé i de points intérieurs est algébrique de degré 2. Plus précisement elle est rationelle
en la série génératrice de Catalan. Notre approche est constructive et permet aussi d’énumérer les
permutations selon leurs différents types de records. Ce travail a été présenté à EuroComb 2011.
J. Mairesse (LIAFA), A. Micheli (LIAFA) et Dominique Poulalhon (LIX) ; Algorithme de minimisation de tresses à 4 brins. La théorie des tresses, sous-ensemble de la théorie des nœuds, est liée à des
problèmes algébriques, ainsi que des problèmes de mécanique statistique. Le problème de l’isotopie est
un problème central en théorie des nœuds très difficile dans le cas général qui devient plus facile (mais
non trivial) dans le cas des tresses grâce à la structure de groupe de l’ensemble. Le problème consiste à
déterminer si deux diagrammes de tresse (ou deux mots de tresse) définissent la même tresse. Un autre
problème en théorie des tresses consiste à se demander si étant donné un mot de tresse, il existe un
représentant de la même tresse plus court en nombre de générateurs. Ce problème, qui ne semble pas
très éloigné du problème de l’isotopie de deux mots de tresse, est pourtant un problème NP-complet. Ce
qui n’interdit pas l’existence d’un algorithme polynomial à nombre de brins fixés. C’est le cas lorsque le
nombre de brins est égal à 3, mais, avant nos travaux, aucun algorithme polynomial n’était connu pour
les tresses avec un plus grand nombre de brins : le seul algorithme connu, exponentiel, ne peut répondre
à cette question pour 4 brins que si le mot de tresse est de longueur inférieure ou égale à 13. Depuis 3
ans, nous travaillons sur ce problème de minimisation dans le cas de 4 brins, pour lequel nous avons
décrit un algorithme cubique ; la preuve de la correction de l’algorithme est en cours de rédaction.
R. Mantaci (LIAFA), P. Massazza (Université de l’Insubria, Italie) et J-B. Yunes (LIAFA) ; Algorithmes
de génération exhaustive. R. Mantaci s’est récemment intéressé à la génération exhaustive de structures
combinatoires au moyen d’algorithmes CAT (constant amortized time). Dans les travaux communs
avec Paolo Massazza (Université de l’Insubria, Varese, Italie) et avec Jean-Baptiste Yunes (LIAFA)
l’approche choisie est celle de trouver un ordre linéaire qui étend l’ordre partiel défini naturellement
sur les posets que ces objets forment. Ceci a permis la génération de certaines familles de partitions
linéaires, telles que les configurations accessibles des systèmes dynamiques discrets SPM (Piles de
sable) et IPM (pile de glace) aussi bien dans leur variante unilatérale que bilatérale, de l’ensemble de
toutes les partitions planes d’un entier n ou de certaines familles de polyominos tels que le polyomi204
nos parallélogramme. Tout récemment, une nouvelle approche a été utilisé dans les travaux en cours
avec Wenjie Fang (étudiant M2 en stage au LIAFA), permettant d’obtenir des algorithmes CAT pour la
génération des piles de sable et de glace. Cette approche est basée sur des propriétés combinatoires des
objets, plutôt que sur la dynamique du système.
1.3
Animation scientifique, rayonnement, prix et récompenses
La conférence la plus importante pour notre équipe est la conférence FPSAC : Formal Power Series and Algebraic Combinatorics. Nous participons activement à cette conférence par
des soumissions chaque année. Par exemple, Guillaume Chapuy fait deux exposés cette année
(avec des coauteurs différents) et Adeline Pierrot et Robin Langer présentent un poster. Nous
sommes aussi actifs dans l’organisation de cette conférence. Jeremy Lovejoy a fait partie du comité de programme en 2008 et Sylvie Corteel en 2006, 2010 et 2012. Toute l’équipe participera à l’organisation de cette conférence en 2013 qui aura lieu à l’Université Paris-Diderot
http://www.liafa.univ-paris-diderot.fr/fpsac13. Les autres conférences importantes auxquelles nous participons sont SODA, STACS et AofA. Vlady Ravelomanana a présenté un
papier à SODA cette année par exemple. Nous organisons aussi des conférences et ateliers ponctuels :
en 2011 un atelier sur les piles de sable organisés par Roberto Mantaci et Jean-Baptiste Yunès (équipe
automates) http://www.liafa.jussieu.fr/ yunes/WSPM/WSPM/Main.html et en 2012
une conférence internationale sur les séries hypergéométriques organisée par Jeremy Lovejoy et Tanguy
Rivoal (Lyon) http://www.liafa.jussieu.fr/ lovejoy/hypergeometric.html.
Au niveau national, nous participons fortement au GDR-IM et en particulier aux groupes de travail
ALEA et Combinatoire algébrique. À peu près toute l’équipe se déplace au CIRM pour les journées
ALEA en Mars chaque année. Anne Micheli et Dominique Poulalhon ont organisé les journées ALEA
2009 en collaboration avec Jean Mairesse de l’équipe automates (avec un financement de l’ANR
GAMMA). L’ANR IComb a participé au financement des journées ALEA 2012.
Au niveau francilien, nous participons activement au rapprochement de la communauté francilienne par l’intermédiaire du séminaire de combinatoire Philippe Flajolet. Ce séminaire bimestriel
a lieu à l’Institut Henri Poincaré. Il a été créé par Sylvie Corteel et Michèle Soria sous l’impulsion de Philippe Flajolet en Octobre 2010. Il propose à chaque séance trois séminaires de chercheurs confirmés et en général les thématiques sont diverses : combinatoire énumérative, combinatoire analytique, analyse d’algorithmes, combinatoire algébrique, physique combinatoire. Le but
de ce séminaire est de rassembler la communauté francilienne, mais des chercheurs provinciaux
de Bordeaux, Caen, Calais, Rouen et Lyon viennent aussi régulièrement. Page web du séminaire :
http://www-apr.lip6.fr/sem-comb-anal-enum.html.
Bien que relativement jeune, l’équipe a déja obtenu quelques récompenses. Guillaume Chapuy a obtenu
le prix du meilleur article étudiant à la conférence FPSAC 2009 et le prix de thèse de l’école polytechnique en 2010 avant d’être recruté au CNRS. Sylvie Corteel a obtenu un bon classement (dans les 400
premiers sur plus de 9000) à l’ERC starting grant en 2008 et a ainsi obtenu une ANR Jeune Chercheur.
Jeremy Lovejoy a obtenu aussi un bon classement à l’ERC starting grant en 2009 mais l’ANR n’a plus
souhaité financé les jeunes bien classés à l’ERC.
1.4
Fonctionnement interne
Le séminaire hebdomadaire de combinatoire, commencé en Mars 2010, est organisé par S. Corteel et V.
Ravelomanana. Le groupe de lecture hebdomadaire, commencé en Septembre 2010, est organisé par G.
Chapuy. L’équipe a été officialisée en Janvier 2011.
Pour les crédits obtenus, la période précédente a été très bénéfique. S. Corteel et J. Lovejoy sont financés
par l’ANR JCJC IComb (2008-2013) obtenu suite à un bon classement à l’ERC starting grant 2008.
205
Cette ANR finance aussi la plupart des activités de l’équipe (stages, missions, séminaires, organisation
de colloque). Plusieurs membres de l’équipe participent aussi à l’ANR blanc Magnum (2010-2014), en
particulier V. Ravelomanana et A. Micheli. Quelques missions ont aussi été payées par le laboratoire
et l’ERC starting grant Explore Maps (G. Schaeffer LIX). Nous venons également d’obtenir une ANR
JCJC portée par G. Chapuy.
Les professeurs invités par l’Université Paris-Diderot dans l’équipe sont :
– 2011 : R. Osburn (UCD, Irlande) collaboration avec J. Lovejoy
– 2012 : O. Bernardi (MIT, USA) collaboration avec G. Chapuy
– 2013 : A. Rechnitzer (UCB, Canada) collaboration avec S. Corteel
– 2013 : S. Rinaldi (Sienne, Italie) collaboration avec E. Duchi
Notre principal source pour le recrutement de doctorants est le MPRI, grâce aux deux cours auxquels
nous participons : C2-10 et C2-15. Mais nous avons aussi recruté une australienne sur un financement
ANR et un professeur de lycée. Pour les post-doctorants, nous avons recruté J.S. Kim sur un financement
ANR et nous avons choisi ensemble qui soutenir pour la FSMP (2012 : A. Morales (MIT) pour collaborer
avec G. Chapuy). Malheureusement, l’offre a été faite tard et notre candidat avait déjà accepté un autre
poste. Il n’y a pas eu de poste de Maı̂tre de Conférences en combinatoire à l’Université Paris Diderot
sur la période. Nous avons soutenu de très bons candidats CR pour les concours CNRS (V. Pilaud, A.
Sportiello et J. Salez). Ils ont tous été classés. Sportiello a été recruté CR1 et nommé au LIPN, Pilaud a
été recruté CR2 en section 01 et nommé au LIX et J. Salez a été recruté maı̂tre de conférences en math
à Paris-Diderot.
206
Chapitre 2
Nom du Directeur de l’unité : Pierre Fraigniaud
Nom du responsable de l’équipe : Sylvie Corteel
2.1
Effectifs
L’équipe combinatoire a été créée en Janvier 2011. Elle est formée de huit permanents :
– Dominique Poulalhon (MdC) en délégation au LIX
et de cinq doctorants :
– 2009- : Adeline Pierrot (direction de D. Rossin) AMN
– 2010- : Sandrine Dasse-Hartaut (direction S. Corteel) AM
– 2011- : Robin Langer (direction S. Corteel) ANR IComb
– 2011- : Elie de Panafieu (direction V. Ravelomanana) AMN
– 2011- : Antoine Crouzet (direction V. Ravelomanana) Prof en lycée
2.2
1. E. Duchi a obtenu en collaboration avec D. Poulalhon et G. Schaeffer une preuve bijective de la
formule d’Hurwitz.
2. A. Micheli a obtenu en collaboration avec D. Poulalhon et J. Mairesse un algorithme de minimisation de tresses à quatre brins.
3. G. Chapuy a obtenu avec V. Féray et E. Fusy un modèle d’arbres pour les cartes unicellulaires.
4. J. Lovejoy a obtenu avec K. Bringmann un lien entre surpartitions et nombres de classe.
5. V. Ravelomanana a obtenu avec H. Daudé des résultats de transition de phase pour Random 2XORSAT.
207
CHAPITRE 2. FICHE RÉSUMÉ : COMBINATOIRE
2.3
Bilan quantitatif
Cinq doctorants en Juin 2012. Deux nouveaux à partir de Septembre 2012.
Trois candidats CR (V. Pilaud, J. Salez et A. Sportiello) classés en 2011 et 2012 mais pas affectés dans
l’équipe. Recrutement de G. Chapuy (CR CNRS), V. Ravelomanana (Pr P7) et promotion de S.
Corteel (DR CNRS).
Production : 61 articles journaux, 21 conférences avec actes
2.3.1
Publications
1. S. Ahlgren, K. Bringmann, J. Lovejoy. `-adic properties of smallest parts functions ?. Adv. Math.
228.1 (2011), pp. 629-645.
2. G. Borot, J. Bouttier, E. Guitter. A recursive approach to the O(n) model on random maps via
nested loops. J. Phys. A : Math. Theor. 45.045002 (2012).
3. S. Corteel, L. K. Williams. Tableaux combinatorics for the asymmetric exclusion process and
Askey-Wilson polynomials. Duke Math. J. 159.3 (2011), pp. 385 ?415.
4. M. Bousquet-Mélou, G. Chapuy, Louis-François Préville-Ratelle. The representation of the symmetric group on m-Tamari intervals. In : Proceedings of the 24th International Conference on
Formal Power Series and Algebraic Combinatorics. Nagoya, Japan, 2012.
5. H. Daudé, C. Martinez, V. Rasendrahasina, V. Ravelomanana. The MAX-CUT of sparse random
graphs. In : SODA. 2012, pp. 265-271.
2.3.2
Rayonnement
– Organisation d’un groupe de lecture et d’un séminaire hebdomadaire pour l’équipe et plusieurs
chercheurs franciliens de Marne la Vallée, Polytechnique et le CEA Saclay (Guillaume Chapuy,
Sylvie Corteel et Vlady Ravelomanana)
– Canadam 2009 : Conférence plénière (S. Corteel)
– 2012 : Organisation de la conférence “Hypergeometric series and their generalizations in algebra,
geometry, number theory and physics” (Jeremy Lovejoy)
– 2010-2014 : ANR Blanc Magnum (Paris 6, Paris 7, Paris 13)
– 2009 : Prix du meilleur papier étudiant à FPSAC 2009 (Guillaume Chapuy)
2.3.3
L’équipe participe à un cours de combinatoire au niveau Licence et à deux cours de niveau 2 du MPRI :
analyse d’algorithmes et aspects algorithmiques de la combinatoire. Le Master Pro proposera au prochain quinquennal un cours en analyse d’algorithmes.
208
Chapitre 3
Laboratory’s name : LIAFA, UMR 7089
Laboratory director’s name : Pierre Fraigniaud
Team leader’s name : Sylvie Corteel
3.1
Members
The team was created in Januray 2011. We have eight permanent members :
– Dominique Poulalhon (MdC) en délégation au LIX
5 graduate students :
– 2009- : Adeline Pierrot (supervised by D. Rossin) AMN
– 2010- : Sandrine Dasse-Hartaut (supervised by S. Corteel) AM
– 2011- : Robin Langer (supervised by S. Corteel) ANR IComb
– 2011- : Elie de Panafieu (supervised by V. Ravelomanana) AMN
– 2011- : Antoine Crouzet (supervised by V. Ravelomanana) Hight school teacher
3.2
Scientific outcomes
1. E. Duchi gave a bijective proof of Hurwitz formula with D. Poulalhon and G. Schaeffer.
2. A. Micheli has obtained a minimization algorithm for 4 braids with D. Poulalhon and J. Mairesse.
3. G. Chapuy proposed with V. Féray and E. Fusy a tree model for unicellular maps.
4. J. Lovejoy in collaboration with K. Bringmann proposed a link between overpartitions and class
numbers.
5. V. Ravelomanana obtained with H. Daudé some results on phase transition for Random 2XORSAT.
209
CHAPITRE 3. EXECUTIVE SUMMARY : COMBINATORICS
3.3
Five PhD students in 2012. Two new from September 2012 (supervised by J. Lovejoy and G. Chapuy).
Three candidates for CNRS were ranked and/or hired (V. Pilaud, J. Salez and A. Sportiello) in 2011
and 2012. Hiring : G. Chapuy (CR CNRS), V. Ravelomanana (Pr P7) and promotion of S. Corteel
(DR CNRS).
Production : 61 journal papers, 21 conference papers
3.3.1
Publications
1. S. Ahlgren, K. Bringmann, J. Lovejoy. `-adic properties of smallest parts functions ?. Adv. Math.
228.1 (2011), pp. 629-645.
2. G. Borot, J. Bouttier, E. Guitter. A recursive approach to the O(n) model on random maps via
nested loops. J. Phys. A : Math. Theor. 45.045002 (2012).
3. S. Corteel, L. K. Williams. Tableaux combinatorics for the asymmetric exclusion process and
Askey-Wilson polynomials. Duke Math. J. 159.3 (2011), pp. 385 ?415.
4. M. Bousquet-Mélou, G. Chapuy, Louis-François Préville-Ratelle. The representation of the symmetric group on m-Tamari intervals. In : Proceedings of the 24th International Conference on
Formal Power Series and Algebraic Combinatorics. Nagoya, Japan, 2012.
5. H. Daudé, C. Martinez, V. Rasendrahasina, V. Ravelomanana. The MAX-CUT of sparse random
graphs. In : SODA. 2012, pp. 265-271.
3.3.2
Habilitation à Diriger des Recherches : Sylvie Corteel (Mai 2010)
3.3.3
– Reading group and seminar organized for the team members and several confirmed researchers
from Marne la Vallée, Polytechnique end CEA Saclay (Organizers : Guillaume Chapuy, Sylvie
Corteel et Vlady Ravelomanana)
– Canadam 2009 : Plenary speaker (S. Corteel)
– Editorial work : editorial committee of Annals of Combinatorics
– 2012 : Organisation of the conference “Hypergeometric series and their generalizations in algebra,
geometry, number theory and physics” (Jeremy Lovejoy) at IHP
– 2010-2014 : ANR Blanc Magnum (Paris 6, Paris 7, Paris 13)
– 2009 : Best student paper, FPSAC 2009 (Guillaume Chapuy)
3.3.4
Teaching
The team participates in one undergraduate class at the Université Paris-Diderot, sophomore level, in
combinatorics and two graduate classes at the MPRI : analysis of algorithms and algorithmic aspects of
combinatorics. The “Master pro” at the Université Paris-Diderot will propose an analysis of algorithms
class from 2013.
210
Chapitre 4
4.1
4.1.1
Objectifs scientifiques
Auto-évaluation
L’équipe combinatoire est jeune et est en cours de structuration. Les thème centraux de l’équipe sont
la combinatoire énumérative et l’analyse d’algorithmes ; mais de nombreux autres thèmes sont présents
dans l’équipe. Pour les années à venir, notre objectif est de profiter au maximum de nos forces présentes
pour former un groupe fort. Nous souhaitons aussi nous renforcer par notre politique de membres associés et nos interactions avec, entre autres, nos partenaires franciliens mais aussi par l’attraction de
nouveaux membres (doctorants, post-doctorants et permanents. Ainsi deux nouveaux doctorants arriveront en 2012 sous la direction de G. Chapuy et J. Lovejoy. Des post-doctorants seront embauchés sur
l’ANR Cartaplus. Nous utiliserons aussi les possibilités de la Fondation Sciences Mathématiques de Paris, de la Mairie de Paris, du DIM mathématiques, de l’Université Paris-Diderot et des projets inter-Idex
pour le recrutement de non-permanents et l’invitation de chercheurs étrangers. Nous continuerons aussi
d’inciter les jeunes docteurs brillants à candidater dans notre équipe.
Nous résumons l’auto-évaluation de l’équipe dans la figure 4.1.
4.1.2
Evolution par rapport à la période précédente
En 2007, la partie “combinatoire” de l’équipe Algorithmique et Combinatoire était assez affaiblie suite
au départ de Daniel Krob et de Michel Morvan. De plus, quasiment tous les recrutements et les mutations
avaient été effectué dans les thématiques de l’algorithmique des graphes, de l’algorithmique distribuée
et des réseaux. Suite au recrutement de V. Ravelomanana (Pr P7), puis à l’arrivée de S. Corteel (CNRS)
et au recrutement de G. Chapuy (CNRS), nous avons atteint une masse critique et formé une équipe.
Notre grande évolution est en matière de doctorants. En effet il y a eu deux thèses (plus une en cotutelle) soutenues dans la thématique combinatoire entre 2003 et 2007. Actuellement cinq thèses sont
en préparation encadrées par D. Rossin (1), S. Corteel (2) et V. Ravelomanana (2). A la rentrée 2012,
nous prévoyons l’arrivée de deux nouveaux étudiants encadrés respectivement par G. Chapuy et J. Lovejoy : W. Fang (ENS) et J. Dousse (ENS Lyon). Cette évolution du groupe a évidemment influencé
une évolution scientifique. Le groupe se concentre dorénavant sur des aspects liant combinatoire bijective, analytique, algébrique et énumérative mais aussi avec de fortes interactions avec la physique, les
probabilités et la théorie des nombres.
4.1.3
Objectifs de l’équipe
Les objectifs de l’équipe sont de nous placer comme un des intervenants incontournables dans la recherche française et internationale, mais aussi de fonctionner comme un groupe où chaque membre
a sa place. Nous venons de pays et de domaines différents et travaillons régulièrement avec des
211
CHAPITRE 4. PROJET SCIENTIFIQUE : COMBINATOIRE
mathématiciens et des physiciens. Notre but en tant qu’équipe est de garder notre bonne humeur en
offrant une place à tous (locaux et visiteurs). Pour cela nous organisons le groupe de lecture du mardi
avec une thématique différente chaque année. En 2012, nous avons ainsi étudier les équations KP provenant de la physique thórique et leur lien avec l’énumération de carte. Ce groupe a ainsi réuni les
doctorants et permanents de léquipe mais aussi des doctorants et permanents de du CEA, de l’IGM et
du LIX. Nous gardons avant tout en tête notre objectif principal : des résultats de recherche judicieux.
Ainsi nous présentons en 2012 de nombreux résultats à SODA et FPSAC.
4.1.4
Programme prévu dans le contexte local, national et international
Notre particularité actuelle est d’être un groupe qui a des forces dans différents domaines de la combinatoire : bijective, analytique, algébrique et énumérative tout en collaborant avec des physiciens et
des mathématiciens. Nos objectifs à moyen terme sont de continuer nos travaux de recherche dans nos
domaines d’excellence et de nous positionner comme des experts mondiaux de ces domaines. Nous
détaillons ci-dessous trois de nos domaines d’excellence.
4.1.4.1
Combinatoire des cartes
Le but de ce thème est de continuer le développement de la combinatoire bijective des cartes et de
concevoir une approche générale pour expliquer des formules d’énumération mystérieuse apparues
récemment. En plus de l’ingrédient bijectif, le but est aussi d’y ajouter de la combinatoire algébrique
et de la physique théorique pour obtenir de nouveaux résultats et en particulier les propriétés statistiques. Enfin un objectif est d’utiliser les objects combinatoires pour résoudre des problèmes venant
de la combinatoire algébrique. Une thèse commencera sur ce thème en 2012 et l’ANR JCJC Cartaplus
commencera en 2013.
4.1.4.2
Séries hypergéométriques et fonctions symétriques
Dans ce thème, nous souhaitons continuer nos recherches sur les séries hypergéométriques et leur lien
avec la combinatoire et la théorie des nombres ; et en particulier les fonctions Mock-Theta. Nous souhaitons aussi nous diversifier avec des généralisations de ces questions par des méthodes et des problèmes
de physiques, de polynômes orthogonaux (multivariés) et des fonctions symétriques. Ceci donne lieu à
beaucoup de très jolis problèmes énumératifs. Deux thèses sont en cours sur ces thèmes et une thèse
commencera en 2012. Ce thème est financé par l’ANR IComb.
4.1.4.3
Analyse d’algorithmes et combinatoire analytique
Le but de ce thème est de poursuivre les recherches dans la lignée lancée par Philippe Flajolet : l’analyse
d’algorithmes en utilisant la combinatoire analytique. Nous souhaitons aussi aller plus loin et attaquer
des problèmes liés fortement à l’informatique actuelle. En particulier, nous souhaiterions développer
les études des réseaux aléatoires et la candidature de J. Salez au CNRS cette année allait dans ce sens.
Nous souhaitons aussi développer nos interactions avec les probabilistes. Deux thèses sont en cours sur
ces thèmes. Ce thème est financé par l’ANR Magnum.
Tous ces thèmes sont des thèmes pointus et extrèmement actifs mondialement. Nous sommes en bonne
place pour relever ces défis avec nos collaborateurs. D’autres thèmes seront développés dans l’équipe
comme les algorithmes de génération, la combinatoire des permutations, les jolies bijections. . .
4.1.5
Prospective, positionnement dans la communauté scientifique, et évolution à moyen terme
La combinatoire est par essence une discipline d’interfaces. Ses techniques et ses problématiques sont
constamment renouvelées par de très nombreuses interactions avec d’autres domaines de l’informatique
212
théorique, mais aussi avec les autres sciences dures. Pour se maintenir au plus haut niveau dans ce
renouvellement constant, trois éléments clés sont l’attractivité vis à vis de l’extérieur, l’effervescence
au sein du groupe, et l’encadrement de doctorants. Ces trois éléments complémentaires reposent
sur un état d’esprit tourné vers la remise en question permanente via de nombreux groupes de travail
et séminaires, via la participation à l’organisation de conférences, et via la complémentarité toujours
nourrie des thèmes de recherche et des compétences mutuelles des membres de l’équipe.
Notre projet est de nous positionner comme une équipe-clé de la combinatoire en France et dans la
région parisienne. Nous pouvons y parvenir du fait des compétences de notre groupe, mais aussi de
notre situation géographique. Ainsi, plusieurs chercheurs franciliens (Polytechnique, Marne la Vallée)
assistent à notre groupe de lecture et à notre séminaire. Ce séminaire est par ailleurs une étape naturelle
dans la visite en France de nombreux chercheurs étrangers. Cette attractivité n’est pas un objectif isolé,
elle est la condition de l’épanouissement de notre recherche, elle en est le ferment. Développer ce cycle
vertueux (attractivité → meilleure recherche → attractivité), déjà initié ces dernières années, comme
le montre la fréquentation croissante de nos séminaires et la qualité de nos membres associés, est un
important objectif à moyen terme.
Sur le plan scientifique, nos succès futurs s’appuieront sur la complémentarité des compétences mutuelles des membres de l’équipe : notre spécificité est d’être pluridisciplinaires au sein même de la combinatoire. Si nous restions individuellement isolés, cette variété pourrait être une faiblesse, mais du fait
de l’effervescence qui règne dans nos groupes de travail qu’il est notre projet d’entretenir, elle fait notre
force. Nous voulons devenir une équipe moteur qui allie les techniques de combinatoire énumérative
(historiquement LABRI - Xavier Viennot), de combinatoire algébrique (historiquement LITP - Alain
Lascoux et Marcel-Paul Schützenberger) et de combinatoire analytique (historiquement INRIA Rocquencourt - Philippe Flajolet). Nous pourrons ainsi saisir les opportunités de recherche qui s’ouvriront
dans ces domaines et à leurs interfaces, mais aussi les initier (comme nous l’avons fait ces dernières
années dans les domaines des polynômes orthogonaux, ou des graphes aléatoires ou des cartes).
Pour atteindre ces objectifs, nous comptons sur nos permanents, nos membres associés mais aussi sur
nos partenaires franciliens, nationaux et internationaux. L’essentiel sera pour nous de maintenir une
ambiance scientifique bouillonnante. Dans cet esprit, nous souhaitons nous impliquer fortement dans
la formation des jeunes chercheurs et leur accompagnement vers une carrière prometteuse. Cela repose
sur l’enseignement de la combinatoire (dès la licence puis dans les cours spécialisés du M2 MPRI), sur
l’encadrement de doctorants et leur association à toutes nos activités, et plus largement sur le recrutement
éventuels de postdocs ou permanents en fonction des opportunités que nous saurons saisir, ou créer.
Plus généralement, en plus de nos activités de recherche, nous participons au rayonnement et à l’organisation du domaine par d’autres activités scientifiques. Nous sommes à l’origine du séminaire de
Combinatoire Philippe Flajolet à l’Institut Henri Poincaré qui a lieu tous les deux mois et regroupe la
communauté combinatoire francilienne et accueille de prestigieux orateurs internationaux. Nous allons
aussi organiser la conférence internationale FPSAC en 2013 qui est la conférence la plus importante du
domaine (environ 180 à 200 participants par an). Nous participons aussi à une proposition de trimestre
combinatoire à l’IHP en collaboration avec des chercheurs de Paris 6, de Paris-Sud et de Marne la Vallée.
4.1.6
Prospective, positionnement dans la communauté scientifique, d’évolution à long terme
Comme le montre notre projet à moyen terme, nous souhaitons devenir une plaque tournante de la
combinatoire française et mondiale, visible et incontournable. À long terme, nous imaginons une équipe
combinatoire forte, inscrite dans une large structure dédiée à l’informatique théorique, avec une réelle
existence géographique (un lieu de visite naturel pour les combinatoristes du monde entier), et porteuse
d’une vision de la combinatoire. Nous espérons avoir une influence sur une, puis plusieurs générations
de jeunes chercheurs, en leur insufflant notre conception de la combinatoire tournée vers la variété des
213
techniques, la prise de recul dans les problématiques, et l’innovation.
En termes de placement et de communautés, nous souhaitons rester pour longtemps à la pointe des communautés FPSAC et AofA, c’est à dire de la combinatoire algébrique, bijective, et analytique, sans manquer de saisir les opportunités qui se présenteront dans la constitution de nouveaux groupes de recherche
nationaux et internationaux. Nous souhaitons ainsi contribuer au développement de notre domaine en
concertation et en collaboration avec les acteurs franciliens (LIX, LIP6, LIPN, IGM), nationaux (LABRI, ICJ) européens et internationaux.
Enfin, nous imaginons développer une politique de membres associés similaire à celle initiée il y a
longtemps par le LaCIM, à Montréal, qui a su construire au fil des années une longue liste de partenaires
prestigieux au sein de plusieurs générations. Aujourd’hui, presque tout combinatoriste dans le monde a
un lien, fût-il ténu, avec cette équipe de Montréal. Par exemple, quatre membres de léquipe font partie
du LIRCO (LIA entre le CNRS et le LaCIM), et un membre de léquipe est membre associé du LaCIM.
Notre projet à long terme est de nous retrouver dans vingt ou trente ans dans une situation comparable
à celle du LaCIM aujourd’hui, tout en conservant le dynamisme et la spécificité de notre vision de la
combinatoire.
4.2
4.2.1
Mise en œuvre du projet
Politique scientifique
Notre politique scientifique est en cours d’élaboration. Pour le moment, nous fonctionnons en mode
collégial et prenons des décisions pour les étudiants postdocs, invités et candidats CNRS ensemble.
Pour les collaborations et discussions scientifiques, tout se fait naturellement car nous échangeons et
communiquons quotidiennement.
4.2.2
Partenariats dans la recherche et l’enseignement supérieur
Nos partenariats dans la recherche englobent tous les laboratoires français où la combinatoire est
représentée : IGM, LIP6, LIX, LaBRI, LIPN, ICJ. Nous continuerons ces interactions ainsi que la
participation aux groupes de travail du GDR-IM ALEA et combinatoire algébrique. Nous veillerons
à continuer nos collaborations internationales et mettre en place des partenariats officiels avec nos pays
de prédilections. En particulier, plusieurs membres de l’équipe ont un lien étroit avec Madagascar et
des partenariats officiels d’enseignement se mettent en place. De plus, nous continuerons nos liens privilégiés avec les Etats-Unis, le Canada, l’Allemagne, l’Italie. . .
4.2.3
Vie de l’équipe
Nous sommes très actifs dans le recrutement de doctorants grâce aux cours de combinatoire et d’analyse
d’algorithmes du MPRI mais aussi par d’autres filières. Ainsi nous avons actuellement une doctorante
australienne (Master U. of Melbourne) et un doctorant professeur en lycée (M2 proba). Nous continuerons notre prospective. Au niveau postdoctoral, nous proposons des candidats au concours de la FSMP
(une dizaine de candidats sérieux nous ont contacté en 2011) et avons recruté JS Kim grâce à l’ANR
IComb. Nous aurons de bons candidats dans les années à venir. Nous sommes aussi actifs pour accueillir des professeurs invités chaque année et nous continuerons cette politique qui permet de mettre
en oeuvre des collaborations à long terme. Pour continuer à fonctionner comme un bon groupe, nous souhaitons encourager et soutenir les enseignants-chercheurs dans leur recherche et encourager nos maı̂tres
de conférences à (co)-encadrer les étudiants et à plus collaborer avec les chercheurs. Nous soutiendrons
les demandes de délégation. Nous devons permettre aux maı̂tres de conférence d’avoir une activité de
recherche importante. Pour développer nos compétences, nous comptons aussi sur le recrutement de
nouveaux permanents. Ainsi depuis notre création, nous avons eu plusieurs candidats brillants qui ont
214
proposé notre équipe comme équipe d’affectation potentielle pour un recrutement CNRS : Vincent Pilaud (2011), Justin Salez (2012) et Andrea Sportiello (2011-2012 et qui avait aussi candidaté dans notre
équipe à une chaire junior de la FSMP et a été classé deuxième). Ils ont tous été classés aux concours
CNRS. Nous continuerons cette politique d’incitation de jeunes chercheurs brillants et nous espérons
que l’Institut INS2I choisira à l’avenir d’affecter un nouveau chercheur CNRS dans notre équipe. Nous
espérons aussi à moyen terme pouvoir accueillir un nouveau maı̂tre de conférences. En particulier, nous
cherchons quelqu’un dans le domaine des structures aléatoires qui pourrait travailler et collaborer en
particulier avec V. Ravelomanana mais aussi avec G. Chapuy.
4.2.4
Recherche de moyens
Pour la recherche de moyens, deux membre de l’équipe ont postulé aux ERC starting grants et ont été
bien classés. Néanmoins à part quelques petits projets bilatéraux, l’ANR est notre financeur principal.
Nous continuerons à soumettre à l’ANR. Par exemple, G. Chapuy vient d’obtenir une ANR JCJC avec
des chercheurs du CEA et du LIX. Il est le porteur de ce projet. En 2012, nous soumettrons d’autres
demandes à l’ANR. Nous avons d’autres projets. En particulier, nous comptons multiplier nos projets
bilatéraux européens : Espagne, Allemagne, Irlande. . . et aussi en Amérique du Nord, en particulier avec
le France-Berkeley fund. Nous serons aussi attentifs aux financements européens (ESF et ERC).
4.2.5
Diffusion des résultats
Notre stratégie de publication restera classique : soumission aux conférences importantes (AofA, SODA,
FPSAC) et aux journaux internationaux.
215
P
Pe eu
u de
d’ re
af c
fe ru
ct te
at m
io en
ns ts
da
ns
–
EXTERNE
F IGURE 4.1 – Analyse SWOT de l’équipe combinatoire
e
ip
ac
e
en
M
l’é
qu
té
216
NEGATIF
–
s
ni
le
tu
na
or
io
at s
pp
rn ale
O
ité te n c
iv in io o
ct s nat std
tra on s po
at rati ion ts
rte bo rat ida
Fo lla bo nd
– Co olla ca S
– C ns R
Bo t CN
e
–
–
–
Je
In un
M ter es
– pro ise acti se
Be je en on
au ts pl s s
co co ac cie
up mm e d nt
de un e ifiq
ue
do s
s
c
Fo
to
ra
rc
nt
e
s
–
–
Fa
es
de
un
s
m
m
tre
co
aı̂
s
m
x
on
au e cati
n
i
ie nc bl
ut re pu
e
So nfé e
ss
– co u d
le
Pe
ib
–
S W
O T
POSITIF
INTERNE
Chapitre 5
ACL : Articles dans des revues internationales ou nationales
[ABDH12a]
J.-C. Aval, A. Boussicault, S. Dasse-Hartaut. “Dyck tableaux”. Theoretical Computer
Science (2012). to appear.
[ABL11a]
S. Ahlgren, K. Bringmann, J. Lovejoy. “`-adic properties of smallest parts functions”. Adv.
Math. 228.1 (2011), pp. 629–645.
[ABL11b]
C. Alfes, K. Bringmann, J. Lovejoy. “Automorphic properties of generating functions for
generalized odd rank moments and odd Durfee symbols”. Math. Proc. Cambridge Philos.
Soc. 151.3 (2011), pp. 385–406.
[ACS09]
G. E. Andrews, S. Corteel, C. D. Savage. “On q-series identities arising from lecture hall
partitions”. Int. J. Number Theory 5.2 (2009), pp. 327–337.
[BBG12]
G. Borot, J. Bouttier, E. Guitter. “A recursive approach to the O(n) model on random maps
via nested loops”. J. Phys. A: Math. Theor. 45.045002 (2012).
[BBLNOPR11] F. Barsi, A. A. Bertossi, C. Lavault, A. Navarra, S. Olariu, M. Cristina Pinotti,
V. Ravelomanana. “Efficient Location Training Protocols for Heterogeneous Sensor and
Actor Networks”. IEEE Trans. Mob. Comput. 10.3 (2011), pp. 377–391.
[BBPR10b]
F. Bassino, M. Bouvel, A. Pierrot, D. Rossin. “Deciding the finiteness of the number of
simple permutations contained in a wreath-closed class is polynomial”. Pure Mathematics
and Applications 21.2 (2010).
[BBR11]
F. Bassino, M. Bouvel, D. Rossin. “Enumeration of Pin-Permutations”. Electronic Journal
of Combinatorics 18.1 (2011). Paper P57.
[BC11a]
O. Bernardi, G. Chapuy. “A bijection for covered maps, or a shortcut between HarerZagiers and Jacksons formulas”. J. Comb. Theory, Ser. A 118.6 (2011), pp. 1718–1748.
[BC11b]
O. Bernardi, G. Chapuy. “Counting unicellular maps on non-orientable surfaces”. Adv.
Appl. Math. 47.2 (2011), pp. 259–275.
[BDPR07]
A. Bernini, F. Disanto, R. Pinzani, S. Rinaldi. “Permutations defining convex permutominoes”. J. Integer Seq. 10.9 (2007), Article 07.9.7, 26.
[BG12]
J. Bouttier, E. Guitter. “Planar maps and continued fractions”. Comm. Math. Phys. 303.3
(2012), pp. 623–662.
[BHL11]
K. Bringmann, K. Hikami, J. Lovejoy. “On the modularity of the unified WRT invariants
of certain Seifert manifolds”. Adv. in Appl. Math. 46.1-4 (2011), pp. 86–93.
[BL08]
K. Bringmann, J. Lovejoy. “Rank and congruences for overpartition pairs”. Int. J. Number
Theory 4.2 (2008), pp. 303–322.
217
CHAPITRE 5. LISTE DES PUBLICATIONS : COMBINATOIRE
[BL09]
K. Bringmann, J. Lovejoy. “Overpartitions and class numbers of binary quadratic forms”.
Proc. Natl. Acad. Sci. USA 106.14 (2009), pp. 5513–5516.
[BLO09]
K. Bringmann, J. Lovejoy, R. Osburn. “Rank and crank moments for overpartitions”. J.
Number Theory 129.7 (2009), pp. 1758–1772.
[BLO10]
K. Bringmann, J. Lovejoy, R. Osburn. “Automorphic properties of generating functions
for generalized rank moments and Durfee symbols”. Int. Math. Res. Not. IMRN 2 (2010),
pp. 238–260.
[BP08b]
M. Bouvel, E. Pergola. “Posets and Permutations in the Duplication-Loss Model”. Pure
Mathematics and Applications 19.2-3 (2008), pp. 71–80.
[BP10]
M. Bouvel, E. Pergola. “Posets and Permutations in the Duplication-Loss Model: Minimal
Permutations with d Descents”. Theoretical Computer Science 411.26-28 (2010).
[BR09]
M. Bouvel, D. Rossin. “A variant of the tandem duplication - random loss model of genome rearrangement”. Theoretical Computer Science 410 (2009), pp. 847–858.
[CFGMN11] G. Chapuy, É. Fusy, O. Giménez, B. Mohar, M. Noy. “Asymptotic enumeration and
limit laws for graphs of fixed genus”. J. Comb. Theory, Ser. A 118.3 (2011), pp. 748–777.
[Cha11]
G. Chapuy. “A new combinatorial identity for unicellular maps, via a direct bijective approach”. Adv. Appl. Math. 47.4 (2011), pp. 874–893.
[CJVW11]
S. Corteel, M. Josuat-Vergès, L. K. Williams. “The matrix ansatz, orthogonal polynomials,
and permutations”. Adv. in Appl. Math. 46.1-4 (2011), pp. 209–225.
[CK11a]
G. Chapuy, I. Klimann. “On the supports of recognizable series over a field and a single
letter alphabet”. Inf. Process. Lett. 111.23-24 (2011), pp. 1096–1098.
[CK11b]
S. Choi, J.-S. Kim. “Combinatorial rigidity of 3-dimensional simplicial polytopes”. Internation Mathematics Research Notices 8 (2011), pp. 1935–1951.
[CK11c]
S. Corteel, J.-S. Kim. “Combinatorics on permutation tableaux of type A and type B”.
European J. Combin. 32.4 (2011), pp. 563–579.
[CKL09]
D. Choi, S.-Y. Kang, J. Lovejoy. “Partitions weighted by the parity of the crank”. J. Combin. Theory Ser. A 116.5 (2009), pp. 1034–1046.
[CL09]
S. Corteel, J. Lovejoy. “Overpartitions and the q-Bailey identity”. Proc. Edinb. Math. Soc.
(2) 52.2 (2009), pp. 297–306.
[CLM08]
S. Corteel, J. Lovejoy, O. Mallet. “An extension to overpartitions of the RogersRamanujan identities for even moduli”. J. Number Theory 128.6 (2008), pp. 1602–1621.
[CN09]
S. Corteel, P. Nadeau. “Bijections for permutation tableaux”. European J. Combin. 30.1
(2009), pp. 295–310.
[CRVP10]
J. Cardinal, V. Ravelomanana, M. Valencia-Pabon. “Minimum sum edge colorings of multicycles”. Discrete Applied Mathematics 158.12 (2010), pp. 1216–1223.
[CSV11]
S. Corteel, C. Savelief, M. Vuletić. “Plane overpartitions and cylindric partitions”. J. Combin. Theory Ser. A 118.4 (2011), pp. 1239–1269.
[CW10]
S. Corteel, L. K. Williams. “Staircase tableaux, the asymmetric exclusion process, and
Askey-Wilson polynomials”. Proc. Natl. Acad. Sci. USA 107.15 (2010), pp. 6726–6730.
[CW11]
S. Corteel, L. K. Williams. “Tableaux combinatorics for the asymmetric exclusion process
and Askey-Wilson polynomials”. Duke Math. J. 159.3 (2011), pp. 385–415.
[DDPR12]
F. Disanto, E. Duchi, R. Pinzani, S. Rinaldi. “Polyominoes Determined by Permutations:
Enumeration via Bijections”. Annals of Combinatorics 16.1 (2012), pp. 57–75.
218
[DFPR07]
F. Disanto, A. Frosini, R. Pinzani, S. Rinaldi. “A closed formula for the number of convex
permutominoes”. Electron. J. Combin. 14.1 (2007), Research Paper 57, 17.
[DFPR08]
F. Disanto, A. Frosini, M. Poneti, S. Rinaldi. “A poset structure for row convex permutominides”. Pure Math. Appl. (PU.M.A.) 19.2-3 (2008), pp. 81–91.
[DFPR10]
F. Disanto, L. Ferrari, R. Pinzani, S. Rinaldi. “Catalan pairs: A relational-theoretic approach to Catalan numbers”. Adv. in Appl. Math. 45.4 (2010), pp. 505–517.
[DFR11]
F. Disanto, A. Frosini, S. Rinaldi. “Square involutions”. J. Integer Seq. 14.3 (2011), Article
11.3.5, 15.
[DFRP08]
F. Disanto, A. Frosini, S. Rinaldi, R. Pinzani. “The combinatorics of convex permutominoes”. Southeast Asian Bull. Math. 32.5 (2008), pp. 883–912.
[DHH12]
S. Dasse-Hartaut, P. Hitczenko. “Greek letters in random staircase tableaux”. Random
Structures and Algorithms (2012). to appear.
[DR11]
H. Daudé, V. Ravelomanana. “Random 2 XORSAT Phase Transition”. Algorithmica 59.1
(2011), pp. 48–65.
[DRS08]
E. Duchi, S. Rinaldi, G. Schaeffer. “The number of Z-convex polyominoes”. Adv. in Appl.
Math. 40.1 (2008), pp. 54–72.
[DS08]
E. Duchi, G. Schaeffer. “A combinatorial approach to jumping particles: the parallel TASEP”. Random Structures Algorithms 33.4 (2008), pp. 434–451.
[FPP11]
J. Ferté, V. Pilaud, M. Pocchiola. “On the number of simple arrangements of five double
pseudolines”. Discrete Comput. Geom. 45.2 (2011), pp. 279–302.
[FPS08]
E. Fusy, D. Poulalhon, G. Schaeffer. “Dissections, orientations, and trees with applications
to optimal mesh encoding and random sampling”. ACM Trans. Algorithms 4.2 (2008),
Art.19, 48pp.
[FPS09]
E. Fusy, D. Poulalhon, G. Schaeffer. “Bijective counting of plane bipolar orientations and
Schnyder woods”. European J. Combin. 30.7 (2009), pp. 1646–1658.
[Kim11a]
J.-S. Kim. “Chain enumeration of k-divisible noncrossing partitions of classical types”. J.
Comb. Theory, Ser. A 118 (2011), pp. 879–898.
[Kim11b]
J.-S. Kim. “Front representation of set partitions”. SIAM Journal Discrete Mathematics 25
(2011), pp. 447–461.
[Kim11c]
J.-S. Kim. “New interpretations for noncrossing partitions of classical types”. J. Comb.
Theory, Ser. A 118 (2011), pp. 1168–1189.
[LM08a]
J. Lovejoy, O. Mallet. “n-color overpartitions, twisted divisor functions, and RogersRamanujan identities”. South East Asian J. Math. Math. Sci. 6.2 (2008), pp. 23–36.
[LM08b]
J. Lovejoy, O. Mallet. “Overpartition pairs and two classes of basic hypergeometric series”. Adv. Math. 217.1 (2008), pp. 386–418.
[LO08]
J. Lovejoy, R. Osburn. “Rank differences for overpartitions”. Q. J. Math. 59.2 (2008),
pp. 257–273.
[LO09]
J. Lovejoy, R. Osburn. “M2 -rank differences for partitions without repeated odd parts”. J.
Théor. Nombres Bordeaux 21.2 (2009), pp. 313–334.
[LO10]
J. Lovejoy, R. Osburn. “M2 -rank differences for overpartitions”. Acta Arith. 144.2 (2010),
pp. 193–212.
[LO11]
J. Lovejoy, R. Osburn. “Quadratic forms and four partition functions modulo 3”. Integers
11 (2011), A4, 6.
219
[Lov08b]
J. Lovejoy. “Rank and conjugation for a second Frobenius representation of an overpartition”. Ann. Comb. 12.1 (2008), pp. 101–113.
[Lov10a]
J. Lovejoy. “On identities involving the sixth order mock theta functions”. Proc. Amer.
Math. Soc. 138.7 (2010), pp. 2547–2552.
[Lov10b]
J. Lovejoy. “Partitions with rounded occurrences and attached parts”. Ramanujan J. 23.1-3
(2010), pp. 307–313.
[Lov12a]
J. Lovejoy. “Ramanujan-type partial theta functions and conjugate Bailey pairs”. Ramanujan J. (2012). to appear.
[MMR10]
R. Mantaci, S. Mantaci, A. Restivo. “Balance Properties and Distribution of Squares in
Circular Words.” Int. J. Found. Comput. Sci. 21.4 (2010), pp. 647–664.
[MPP11]
B. Matschke, J. Pfeifle, V. Pilaud. “Prodsimplicial-neighborly polytopes”. Discrete Comput. Geom. 46.1 (2011), pp. 100–131.
[NPRSC10]
A. Navarra, M. C. Pinotti, V. Ravelomanana, F. B. Sorbelli, R. Ciotti. “Cooperative training for high density sensor and actor networks”. IEEE Journal on Selected Areas in Communications 28.5 (2010), pp. 753–763.
[PS09]
V. Pilaud, F. Santos. “Multitriangulations as complexes of star polygons”. Discrete Comput. Geom. 41.2 (2009), pp. 284–317.
[Rav10a]
V. Ravelomanana. “Birth and growth of multicyclic components in random hypergraphs”.
Theor. Comput. Sci. 411.43 (2010), pp. 3801–3813.
Publication [CK11a] is joint with team ”Automata”.
C-INV : Conférences invitées
[Cor09]
S. Corteel. “Enumeration of Fillings of Young Diagrams”. Canadam 09. Montréal, Canada, 2009.
C-ACTI : Communications avec actes de conférences internationales
[AB12]
M. Albenque, J. Bouttier. “Constellations and multicontinued frc-actions: application to
Eulerian triangulations”. Proceedings of the 24th International Conference on Formal Power Series and Algebraic Combinatorics. Nagoya, Japan, 2012.
[BCMR09] M. Bouvel, C. Chauve, M. Mishna, D. Rossin. “Average-Case Analysis of Perfect Sorting
by Reversals”. CPM’ 09: Proceedings of the 20th annual symposium on Combinatorial
Pattern Matching. Vol. 5577. Lecture Notes in Computer Science. Springer, 2009, pp. 314–
325.
[BDGR11]
N.-R. Beaton, F. Disanto, A. Guttmann, S. Rinaldi. “On the enumeration of column-convex
permutominoes”. 23rd International Conference on Formal Power Series and Algebraic
Combinatorics (FPSAC 2011). Discrete Math. Theor. Comput. Sci. Proc., AO. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2011, pp. 111–122.
[BMCPR12]
M. Bousquet-Mélou, G. Chapuy, Louis-François Préville-Ratelle. “The representation
of the symmetric group on m-Tamari intervals”. Proceedings of the 24th International
Conference on Formal Power Series and Algebraic Combinatorics. Nagoya, Japan, 2012.
[BP11]
J. Bokowski, V. Pilaud. “On the generation of topological (nk )-configurations”. 23rd Canadian Conference on Computational Geometry (CCCG’11). 2011.
220
[BRV07]
M. Bouvel, D. Rossin, S. Vialette. “Longest Common Separable Pattern Among Permutations”. CPM ’07: Proceedings of the 18th annual symposium on Combinatorial Pattern
Matching. Vol. 4580. Lecture Notes in Computer Science. London, Canada: SpringerVerlag, 2007, pp. 316–327.
[CFF12]
G. Chapuy, V. Féray, É. Fusy. “A simple model of trees for unicellular maps”. Proceedings
of the 24th International Conference on Formal Power Series and Algebraic Combinatorics. Nagoya, Japan, 2012.
[CJVPR09] S. Corteel, M. Josuat-Vergès, T. Prellberg, M. Rubey. “Matrix ansatz, lattice paths and
rook placements”. 21st International Conference on Formal Power Series and Algebraic
Combinatorics (FPSAC 2009). Discrete Math. Theor. Comput. Sci. Proc., AK. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2009, pp. 313–324.
[CN08]
S. Corteel, P. Nadeau. “Bijections for permutation tableaux”. 20th Annual International
Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008). Discrete Math. Theor. Comput. Sci. Proc., AJ. Assoc. Discrete Math. Theor. Comput. Sci.,
Nancy, 2008, pp. 13–24.
[DDRS11]
F. Disanto, E. Duchi, S. Rinaldi, G. Schaeffer. “Permutations with few internal points”.
The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011. Vol. 38. Electronic Notes in Discrete Mathematics. Elsevier, 2011, pp. 291–
296.
[DFPR09]
F. Disanto, L. Ferrari, R. Pinzani, S. Rinaldi. “Combinatorial properties of Catalan pairs”.
European Conference on Combinatorics, Graph Theory and Applications (EuroComb
2009). Vol. 34. Electron. Notes Discrete Math. Elsevier Sci. B. V., Amsterdam, 2009,
pp. 429–433.
[DMRR12]
H. Daudé, C. Martı́nez, V. Rasendrahasina, V. Ravelomanana. “The MAX-CUT of sparse
random graphs”. SODA. 2012, pp. 265–271.
[DP08]
E. Duchi, D. Poulalhon. “On square permutations”. Fifth Colloquium on Mathematics and
Computer Science. Discrete Math. Theor. Comput. Sci. Proc., AI. Assoc. Discrete Math.
Theor. Comput. Sci., Nancy, 2008, pp. 207–222.
[GBN07]
D. Gouyou-Beauchamps, P. Nadeau. “Growth diagrams, Ribbon tableaux, Involution principle”. Proceedings of the 19th International Conference on Formal Power Series and
Algebraic Combinatorics. Tianjin, 2007.
[Lan12]
R. Langer. “Enumeration of Cylindric Plane Partitions”. Proceedings of the 24th International Conference on Formal Power Series and Algebraic Combinatorics. Nagoya, Japan,
2012.
[Mal08]
O. Mallet. “n-color overpartitions, lattice paths, and multiple basic hypergeometric series”.
20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008). Discrete Math. Theor. Comput. Sci. Proc., AJ. Assoc. Discrete Math.
Theor. Comput. Sci., Nancy, 2008.
[MM11]
R. Mantaci, P. Massazza. “From Linear Partitions to Parallelogram Polyominoes.” Developments in Language Theory. Ed. by Giancarlo Mauri and Alberto Leporati. Vol. 6795.
[MMR08]
R. Mantaci, S. Mantaci, A. Restivo. “Balance Properties and Distribution of Squares in
Circular Words.” Developments in Language Theory. Ed. by Masami Ito and Masafumi
Toyama. Vol. 5257. Lecture Notes in Computer Science. Springer, 2008, pp. 504–515.
221
[PRW11]
A. Pierrot, D. Rossin, J. West. “Adjacent transformations in permutations”. proceedings
of FPSAC 2011 (23th International Conference on Formal Power Series and Algebraic
Combinatorics), DMTCS proc. AO. 2011, pp. 765–776.
[PS11]
V. Pilaud, F. Santos. “The brick polytope of a sorting network”. 23th Annual International
Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011). 2011.
[RR10]
V. Rasendrahasina, V. Ravelomanana. “Limit Theorems for Random MAX-2-XORSAT”.
LATIN. 2010, pp. 320–331.
C-COM : Communications orales sans actes en conférences internationales ou nationales
[ABDH12b]
J.-C. Aval, A. Boussicault, S. Dasse-Hartaut. “The tree structure in staircase tableaux”.
Conference Génération aléatoire de structures combinatoires (GASCom). 2012.
[BBPR09]
F. Bassino, M. Bouvel, A. Pierrot, D. Rossin. “Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial.” Permutation Patterns. 2009.
[BBPR10a]
F. Bassino, M. Bouvel, A. Pierrot, D. Rossin. “A polynomial algorithm for deciding the
finiteness of the number of simple permutations in permutation classes.” Permutation Patterns. 2010.
[BBR09]
F. Bassino, M. Bouvel, D. Rossin. “Permutations en épingles et structure dans les classes
de permutations”. Journées annuelles du GT-Aléa du GdR-IM. 2009.
[BMMR09]
M. Bousquet-Melou, R. Mantaci, F. Rakotondrajao. “Polynomial classes of permutations
avoiding exactly two patterns.” Permutation Patterns. 2009.
[Bou12a]
J. Bouttier. “The nested loop approach to the O(n) model on random maps”. Workshop on
Statistical Mechanics and Conformal Invariance, MSRI Berkeley, 2012.
[Bou12b]
J. Bouttier. “The nested loop approach to the O(n) model on random maps”. Conference
on Conformal Invariance, Discrete Holomorphicity and Integrability. Helsinki, Finland,
2012.
[BP08a]
M. Bouvel, E. Pergola. “Posets and Permutations in the duplication-loss model”. Conference Génération aléatoire de structures combinatoires (GASCom). 2008.
[BR07]
M. Bouvel, D. Rossin. “A variant of the tandem duplication - random loss model of genome rearrangement”. Permutation Patterns. 2007.
[Cha10]
G. Chapuy. “Combinatorics and Analysis in Spatial Probability”. Eurandom. Eindhoven,
Netherlands, 2010.
[Cha12]
G. Chapuy. “Perspective in Discrete Mathematics”. Centre de Recerca Matemàtica. Barcelona, Spain, 2012.
[CJVK12]
S. Corteel, M. Josuat-Verges, J.S. Kim. “Combinatorics of permutation tableaux of type
B”. GAScom 2012. 2012.
[Cor10]
S. Corteel. “Tableaux escaliers et polynomes d’Askey Wilson”. Journées de Combinatoire
de Bordeaux 2010. 2010.
[CPR11]
G. Chapuy, A. Pierrot, D. Rossin. “On growth rates of wreath-closed permutation classes”.
Permutation Patterns. 2011.
[Duc12]
E. Duchi. “Preuve bijective de la formule d’Hurwitz à l’aide de mobiles.” Exposé invité
aux journés X.G. Viennot. 2012.
[Lov08a]
J. Lovejoy. “Andrews’ generalization of Selberg’s q-difference equations”. Combinatory
Analysis 2008: Partitions, q-series, and Applications. 2008.
222
[Lov09]
J. Lovejoy. “Q-series and class numbers, Mock theta functions and applications in combinatorics”. Algebraic geometry and mathematical physics. Max Planck Institute, Bonn,
Germany, 2009.
[Lov11]
J. Lovejoy. “Congruences for smallest parts functions, Modular Forms and Mock Modular
Forms and their Applications in Arithmetic”. Geometry and Physics. Trieste, Italy, 2011.
[Lov12b]
J. Lovejoy. “Ramanujan’s identities for the sixth order mock theta functions”. Symposium
on Modular Forms, Mock Theta Functions, and Applications. Cologne, Germany, 2012.
[MMP11a]
J. Mairesse, A. Micheli, D. Poulalhon. “Comment minimiser une tresse”. Journées de
Combinatoire de Bordeaux. 2011.
[MMP11b]
J. Mairesse, A. Micheli, D. Poulalhon. “Minimizing braids on four strands”. Braids. 2011.
[OKNPPP11] A. Guiedes Oliviera, E. Kim, M. Noy, A. Padrol, J. Pfeifle, V. Pilaud. “Polytopal complexes realizing products of graphs”. XIV Encuentros de Geometria Computacional. 2011.
[PR11]
A. Pierrot, D. Rossin. “On two-stack sorting”. Permutation Patterns. 2011.
[PS10]
V. Pilaud, F. Santos. “The brick polytope of a sorting network”. Culminating Workshop of
the Semester on Discrete and Computation Geometry in Lausanne. 2010.
[Rav10b]
V. Ravelomanana. “Random 2-XOR-SAT and MAX-2-XOR-SAT and their phase transitions”. Exposé long au groupe de travail Aléa. 2010.
223
224
Chapitre 6
6.1
Composition et vie scientifique
Responsable : Sylvie Corteel (DR CNRS)
6.1.1
6.1.1.1
Liste actuelle des membres
Membres permanents (2012)
Guillaume Chapuy (CR)
Sylvie Corteel (DR)
Enrica Duchi (MdC)
Jeremy Lovejoy (CR)
Roberto Mantaci (MdC - HDR)
Anne Micheli (MdC)
Dominique Poulalhon (MdC - en détachement 2009-2013)
Vlady Ravelomanana (Pr)
6.1.1.2
Doctorants et post-doctorants (2012)
2011- : Antoine Crouzet (direction Vlady Ravelomanana) Prof lycée
2010- : Sandrine Dasse-Hartaut (direction Sylvie Corteel) AM
2010- : Elie de Panafieu (direction Vlady Ravelomanana) AMN
2011- : Robin Langer (direction Sylvie Corteel) CNRS
2009- : Adeline Pierrot (direction Dominique Rossin) AMN
6.1.1.3
Visiteurs de longue durée (2012)
Pour l’année 2011-2012, en détachement du CEA.
Jérémie Bouttier (CEA)
6.1.1.4
Autres (2012)
Membres associés
Philippe Biane (DR CNRS)
Jérémie Bouttier (CEA)
225
CHAPITRE 6. ANNEXES : COMBINATOIRE
6.1.2
6.1.2.1
Anciens membres
Membres permanents (2007-2011)
Dominique Rossin (CR - HDR) mutation au LIX en 2009.
6.1.2.2
Doctorants et post-doctorants (2007-2011)
Doctorants
2006-2009 : Mathilde Bouvel (direction Dominique Rossin) CR CNRS au LABRI
2005-2008 : Olivier Mallet (direction Jeremy Lovejoy) Maı̂tre de Conférences à Rouen
2009-2010 : Matthieu Josuat-Vergès (direction Sylvie Corteel, thèse soutenue à Paris-Sud) CR CNRS
à l’IGM.
2007-2010 : Filippo Di Santo (cotutelle direction Enrica Duchi)
Post-doctorants
2008-2010 : Jang Soo Kim, Postdoc (ANR IComb) maintenant Assistant Professor University of Minnesota (USA)
2008-2009 : Olivier Mallet, Ater (Paris-Diderot) maintenant Maı̂tre de Conférences à Rouen
2007-2008 : Philippe Nadeau, Ater (Paris Diderot) maintenant CR CNRS à l’ICJ
2010-2011 : Vincent Pilaud, Ater (Paris-Diderot) maintenant CR CNRS au LIX
2008-2009 : Yann Ponty, Postdoc (ANR Gamma) maintenant CR CNRS au LIX
6.1.2.3
Visiteurs de longue durée (2007-2011)
2010-2011 : Olivier Bodini (Paris 6) en délégation CNRS
6.1.3
Visiteurs
Olivier Bernardi (Prof invité, 2 semaines)
Robert Osburn (University College Dublin - Prof invité, 1 mois)
Juan José Rué (ICMAT, Madrid, ANR Magnum 4 mois)
Marc Noy (UPC Barcelona, ANR Magnum 3 semaines)
Lauren Williams (Berkeley, ANR Gamma, 1 mois)
6.1.4
Vie de l’équipe
La vie scientifique de l’équipe s’organise autour du groupe de lecture du mardi (organisé par Guillaume
Chapuy) et du séminaire du Jeudi (organisé par Sylvie Corteel et Vlady Ravelomanana). Le groupe de
lecture est un groupe hebdomadaire qui dure environ deux heures et qui est un présentation de chapitre
de livre ou d’article préparé par un des membres du groupe. Le thème de 2010-2011 était la combinatoire
des (q, t)-Catalan basé sur un livre de Jim Haglund (University of Pennsylvania) et celui de 2011-2012
est l’énumération de cartes et les équations KP et est basé sur les travaux d’Okounkov et de Goulden
et Jackson. La plupart des membres de léquipe et principalement les doctorants participent au groupe
de lecture mais il accueille aussi des autres chercheurs de la région parisienne : Polytehcnique, Orsay et
Marne la Vallée.
Le séminaire lui est plus classique. Il dure une heure et est un exposé de travaux récents de l’orateur.
Les orateurs sont locaux, nationaux ou internationaux. Depuis sa création en Mars 2010, il a lieu environ 28 fois par an. Nous invitons particulièrement des jeunes chercheurs. L’équipe participe aussi a
226
l’organisation du séminaire de combinatoire Philippe Flajolet à l’Institut Henri Poincaré. Ce séminaire
est bimestriel et s’organise autour de trois exposés faits par des chercheurs confirmés. Il a été créé à
l’Automne 2010 par Sylvie Corteel (LIAFA) et Michèle Soria (LIP6). Son but est de regrouper la communauté francilienne de combinatoire tous les deux mois.
6.1.4.1
Implication dans l’animation scientifique et les responsabilités administratives locales,
nationales et internationales
UFR :
-2008 : Membre du conseil de l’UFR, de la commission des enseignements, responsable des moniteurs,
représentante de l’UFR auprès du Département Sciences Exactes, Dominique Poulalhon.
2007-2009 : Responsable du master Isifar, mention Informatique-Finance, Anne Micheli.
2010-2011 : Commission de suivi des étudiants des trois années de licence, Anne Micheli.
2012- : Co-responsable des classes préparatoires aux Ecoles d’Ingénieurs de l’Université Paris Diderot,
Vlady Ravelomanana.
2012- : Membre du conseil de l’UFR et du bureau de l’UFR, Anne Micheli.
Conseil scientifique de l’UFR, Sylvie Corteel (2010-2011) Guillaume Chapuy (2011- ) et Vlady Ravelomanana (2010-).
Laboratoire :
Chargée de communication du LIAFA, Sylvie Corteel.
Conseil du laboratoire, Enrica Duchi et Vlady Ravelomanana.
Animation scientifique :
2010- : Séminaire hebdomadaire, Sylvie Corteel et Vlady Ravelomanana.
2011- : Groupe de lecture hebdomadaire, Guillaume Chapuy.
2010- : Séminaire Philippe Flajolet, Sylvie Corteel.
6.2
6.2.1
Contrats et projets scientifiques
Responsabilité de projets nationaux
Projet ICOMB. Type de projet : ANR JCJC. Titre détaillé : Interaction of Combinatorics Partenaires :
LIAFA (CNRS et Univ. Diderot). Montant : 340Ke, Sylvie Corteel et Jeremy Lovejoy.
6.2.2
Participation à des projets internationaux
Création de l’Ecole Doctorale en Mathématiques et Informatique à l’Université d’Antananarivo, Vlady
Ravelomanana.
Projet franco-tunisien 09/R 15-7 DGRSRT-CNRS, Vlady Ravelomanana.
”Ramanujan-type congruences for overpartitions and overpartition pairs”, Ulysses - PHC FrancoIrlandais, Jeremy Lovejoy.
Arithmetic Properties of Coeffcients of Modular Forms, Science Foundation Ireland Research Frontiers
Programme, Jeremy Lovejoy.
6.2.3
Participation à des projets nationaux
2007-2010 : ANR blanc Gamma : titre : Génération Aléatoire : Modèles, Méthodes, Algorithmes, partenaires : LIAFA, LIP6, IGM, LIPN, LRI, responsables : Dominique Rossin (LIAFA), Michèle
Soria (LIP6), Frédérique Bassino (LIPN), Sylvie Corteel, Jeremy Lovejoy, Anne Micheli, Dominique Poulalhon, Vlady Ravelomanana.
227
2009-2012 : ANR blanc BOOLE (ANR C9 BLAN 0011 01) responsable : Danièle Gardy (PRISM –
UVSQ), Vlady Ravelomanana.
2010-2013 : ANR blanc Magnum : titre : Méthodes Algorithmiques pour la Génération aléatoire Non
Uniforme : Modèles et applications, partenaires : LIP6, INRIA, LIAFA, LIX, LIPN, IGM, responsables : Dominique Rossin (LIAFA), Michèle Soria (LIP6), Frédérique Bassino (LIPN). Roberto
Mantaci, Anne Micheli, Adeline Pierrot, Vlady Ravelomanana.
6.3
Administration de la recherche
6.3.1
Activités éditoriales
Comité éditorial de Annals of Combinatorics, Sylvie Corteel.
6.3.2
Gestion scientifique de conférences
Conference on “Prospects in q-series and modular forms,” July 14-16, 2010, University College Dublin,
Ireland, Jeremy Lovejoy.
Conférence Hypergeometric series and their generalizations in algebra, geometry, number theory and
physics, 29 Mai - 1er Juin 2012, Institut Henri Poincaré, Jeremy Lovejoy.
Séminaire Philippe Flajolet, Institut Henri Poincaré, Sylvie Corteel.
Formal Power Series and Algebraic Combinatorics, Université Paris Diderot, 24-28 Juin 2013, toute
l’équipe.
6.3.2.1
Participation à des comités de programmes
Formal Power Series and Algebraic Combinatorics 2008, 2010, 2012, Sylvie Corteel et Jeremy Lovejoy.
Canadam 2013, Sylvie Corteel.
ACM-SIAM ANALCO 2012 (Analytic Algorithmics and Combinatorics), Vlady Ravelomanana.
6.3.3
6.3.3.1
Organisation d’événements scientifiques
Présidence de comités d’organisation
Formal Power Series and Algebraic Combinatorics, Uiversité Paris Diderot, 24-28 Juin 2013.
6.3.3.2
Participation à des comités d’organisation
Journées ALEA 2009, Mars 2009, Anne Micheli et Dominique Poulalhon
TGGT 2008 (Topological and Geometric Graph Theory), Paris, 19 au 23 mai 2008, Dominique Poulalhon
6.3.4
6.3.4.1
Participant à des comités et jurys scientifiques
Au niveau international
Combinatorics Panel, National Science Foundation, Washington DC 2011, Sylvie Corteel.
6.3.4.2
Au niveau national
Comité de pilotage du groupe GDR-IM ALEA, Sylvie Corteel et Vlady Ravelomanana.
228
6.3.4.3
Commissions de spécialistes
IUT de Marne-la-Vallée (2009,2010) et l’Université de Marne-la-Vallée (2008), Anne Micheli.
Université Paris Nord (2010) et Université Bordeaux I (2010), Sylvie Corteel.
Paris Diderot (2007, 2008) et Paris Nord (2011), Dominique Poulalhon.
Université Descartes (2010, 2011, 2012), IUT Paris 5 (2011), Université Paris-Nord (2010), Vlady
Ravelomanana
6.3.4.4
Rapport de thèse
2009 Francesca de Carli (Université de Savoie, Enrica Duchi et Dominique Rossin)
2011 Hayat Cheballah (Paris Nord, Sylvie Corteel)
2011 Samuele Giraudo (Marne la Vallée, Sylvie Corteel)
2012 Adel Hamdi (Lyon, Sylvie Corteel)
Jury de thèse : Marc Sage (2012, Sylvie Corteel et Vlady Ravelomanana). Jury d’habilitation : Frédéric
Jouhet (2010, Jeremy Lovejoy).
6.4
Activités de formation, encadrement et évaluation
6.4.1
6.4.1.1
Liste des thèses et HdR soutenues
2010 : Sylvie Corteel, Diagrammes de Ferrers décorés.
6.4.1.2
Thèses de doctorat
2008 : Olivier Mallet Autour des surpartitions et des identités de type Rogers-Ramanujan (sous la
direction de Jeremy Lovejoy). Olivier est maı̂tre de conférences à l’Université de Rouen.
2009 : Mathilde Bouvel, Quelques problèmes combinatoires et algorithmiques sur les classes de permutations (sous la direction de Renzo Pinzani et Dominique Rossin). Mathilde est CR CRNS au
LABRI.
2010 : Filippo Disanto, Some combinatorial problems on permutations, polyominoes and partially
ordered sets (sous la direction de Enrica Duchi et Simone Rinaldi)
(Co-)encadrements de thèse : Hichem Kenniche (Paris Nord, Vlady Ravelomanana, soutenance 2011),
Vonjy Rasendrahasina (Paris Nord, Vlady Ravelomanana, soutenance prévue en 2012).
6.4.2
6.4.2.1
Enseignement dispensé
Cours universitaires en M2R
Cours C2-10 Algorithmique de la Combinatoire, MPRI, Dominique Poulalhon (2007), Sylvie Corteel
(2009-2011), Guillaume Chapuy (2011-2012), Jeremy Lovejoy (2012).
Cours C2-15 Analyse d’algorithmes, MPRI, Vlady Ravelomanana (2011-).
6.4.2.2
Ecoles thématiques et cours spécialisés
2011 : Conférencier invité à l’école de Combinatoire et Algorithmique de Madagascar (ECAM). Responsable du cours d’algorithmique, Roberto Mantaci.
229
2011 : Cours d’Analyse de performance et simulations en Master Recherche Econométrie à l’Université
d’Antananarivo, Vlady Ravelomanana.
2011 : Cours de Combinatoire Analytique au Département des Mathématiques de Monastir, Vlady
Ravelomanana.
2011 : Quasimodular forms and applications, Besse et Saint-Anastaise, Jeremy Lovejoy.
230
Part VI
231
Chapter 1
1.1
General context and objectives
Motivation and challenges: Computing systems are ubiquitous. Their reliability is a crucial issue
since their misbehaviors can have unacceptable impact. The complexity of modern software/hardware
systems implies the necessity of adopting formal and automated verification methods allowing either
to detect subtile bugs that may occur in these systems, or to establish their correctness w.r.t. precisely
defined criteria and specifications. It also important to develop such methods taking into account qualitative aspects (e.g., input-output relations, order constraints between events, termination of computation
phases, etc.) as well as quantitative aspects (time separating occurrences of events, cost of computations
in terms of resource consumption, etc.).
Model checking is a well established formal approach for automatic verification. It has been successfully
applied to various classes of systems, including hardware systems and some classes of software systems
such as communication protocols, device drivers, and real-time controllers. However, its extension to
wider classes of software systems, taking into account complex data and control aspects, remains a major
challenge, both from the theoretical and practical viewpoints.
Another important issue for the design of reliable systems is synthesis, that is, constructing a component
(of a system) that is able to behave in conformance with some specification (of the whole system), whatever its environment (i.e., the rest of the system) may do at each point in time. This problem is reducible
to game solving (i.e., finding a winning strategy against the environment). Closely related problems
are the verification of open systems (i.e., systems that must interact permanently with an uncontrollable
environment), and compositional model checking.
Approach and objectives: The MV team aims at developing advanced algorithmic verification methods. Her work includes investigating theoretical and foundational issues as well as developing innovative techniques and efficient tools for automatic verification: We define automata-based formal models
and logics for specifying the computations or the configurations of these systems, and we study the
fundamental properties of these modeling and specification formalisms. We investigate in particular
the decidability and the complexity of their verification problems, and the issue of designing efficient
model-checking algorithms for them. In addition, we develop powerful analysis procedures that are
able to handle wide classes of systems, either for bug detection (using under-approximations) or for
establishing correctness (using abstraction techniques).
1.2
Main results in the period 2007-2012
Automata-Based Techniques: Regular Model Checking (RMC) is a generic, automata-based, symbolic verification approach for infinite-state systems. Finite-state word/tree automata are used to represent (potentially infinite) sets of configurations and transformations. RMC is applicable to various
classes of systems such as networks of concurrent processes, programs with dynamic data structures,
programs with integer variables, etc. Our contributions to RMC in 2007-12 concern mainly:
233
CHAPTER 1. RESEARCH REPORT: MODELING AND VERIFICATION
• Algorithms for nondeterministic automata: These automata provide more compact representations of regular languages/relations than canonical automata. We have developed an efficient
algorithm for inclusion checking between tree automata, extending the approach of antichains
originally defined for word automata 1 . Moreover, we have developed efficient algorithms for
tree automata reduction. Our approach is based on defining good approximations of language
equivalence that can be checked in polynomial time [ABHKV08a; ABHKV08b; ABHKV09] 2 .
• Complexity of decision problems on automatic structures, i.e., structures for which basic relations
are representable by finite-state automata, which allows to get an automata-based decision procedure for their first-order logic. An example is Presburger arithmetic (PA). While the complexity of
deciding PA using quantifier elimination is known (there is a double-exponential non-deterministic
time lower bound and a triple exponential deterministic time upper bound), the complexity of
the automata-based decision procedure was unknown. We show in [DGH10] that it is tripleexponential as well. In [DGH12], we establish a general complexity result for the model checking
of first-order formulas on automatic structures, by a thorough analysis (using Ehrenfeucht-Fraı̈ssé
games) of the construction of an automaton recognizing the models of a formula.
Verification of Concurrent Systems: Verifying concurrent programs is hard even in the case of
boolean programs. Boolean programs with two threads and recursive procedures are Turing powerful.
Dynamic creation of threads, as well as the adopted memory model (which may not ensure sequential
consistency), are other sources of complexity. Our main contributions on this topic in 2007-12 are:
Decidability and complexity: We have identified classes of programs for which verification problems,
mainly reachability queries, are decidable. We have investigated the effect of assumptions about (1)
the network topology: acyclic networks of communicating pushdown systems [ABT08b], (2) the interaction between recursion and concurrency/task creation: asynchronous programs with task priorities
and preemption [ABT08a], ordered use of stacks [ABH08; Ati10a; Ati10b], and (3) the transmission
of information and accesses to shared memory between tasks: recursively parallel programs, a family
of programs with isolated hierarchical parallel computations corresponding to concurrency constructs
present in explicitly parallel programming languages such as C ILK and X10 [BE12a].
Under approximate analysis for bug detection: Context bounding 3 is a popular bounding concept suitable for bug detection in multi-threaded programs. Importantly, it has been shown 4 that context-bounded
analysis is compositionally reducible (by a code-to-code translation) to sequential program analysis.
This allows to leverage existing analysis tools for sequential programs to the concurrent case. However,
these works considered only programs with a fixed number of threads. In our work (in collaboration with
S. Qadeer), we have extended context-bounding to programs with dynamic creation of threads, where
the bound is defined per thread and not globally. We have established decidability and complexity results
for this case [ABQ09; ABQ11], and also proposed a new concept, called delay bounding, which leads
to a more scalable analysis[EQR11]. In [BEP11] we provide a unifying framework for bounded analysis
of concurrent programs that is compositionally reducible to sequential analysis.
Weak Memory Models: For performance reasons, modern multi-microprocessors implement weak memory consistency models that relax the program order between actions of a processor. Therefore, computations are not sequentially consistent (SC) in general, while most of the programmers are used to reason
in SC. Then, given a memory model M , two problems must be addressed: (P1) checking whether a program running under M satisfies a specification, and (P2) checking whether a program is robust against
M , that is, all its computations under M have counterparts under SC. We have established the first
decidability and complexity results for these problems:
1.
2.
3.
4.
M. De Wulf et al.: Antichains: A New Algorithm for Checking Universality of Finite Automata. CAV’06, LNCS 4144.
Paper [ABHKV08a] received the best paper award at CIAA’08.
S. Qadeer, J. Rehof: Context-Bounded Model Checking of Concurrent Software. TACAS’05, LNCS 3440, 2005.
A. Lal, T. Reps: Reducing concurrent analysis under a context bound to sequential analysis. FMSD 35(1), 2009.
234
• The state reachability problem is undecidable when writes are allowed to overtake speculatively
reads, and it becomes decidable when this relaxation is forbidden, like in TSO for instance. (TSO
is the model adopted, e.g., in SPARC and Intel x86 machine.) However, this problem is highly
complex in general (non-primitive recursive) [ABBM10; ABBM12].
• The trace-robustness problem for TSO, i.e., checking if all computations possible under TSO
are also possible under SC, is, surprisingly, only PSPACE-complete [BMM11]. We show that
checking trace-robustness against TSO can be reduced to checking state reachability under SC.
Verification of programs manipulating data structures: Reasoning about configurations of data
structures requires the use of rich logics allowing to express various kind of constraints such as
shape constraints (e.g., acyclicity, disjointness, etc.), size constraints (e.g., preservation of the length),
set/multiset constraints (e.g., preservation of the elements), and data constraints (e.g., sortedness).
Decidable logics: We have investigated logics offering a good trade-off between, on one hand, expressiveness and relevance for program specification, and on the other hand, decidability and closure properties that are useful for automatic verification. In [HIV08a; HIV08b], we introduce decidable logics for
reasoning about arrays of integers, providing a decision procedure through a translation to flat counter
automata. In [BDES09], we introduce a logic for reasoning about composite multi-linked structures,
such as lists of lists or lists of doubly-linked lists for instance, carrying data over a domain with a decidable theory. The decision procedure is by a non-trivial small model argument.
Invariant synthesis: In [BDERS10; BDES11], we develop a powerful approach, based on abstractinterpretation, for automatic synthesis of invariants of programs with dynamic singly-linked lists of
integers. We introduce new abstract domains for reasoning about various kinds of constraints on the
contents of lists, and we use them to define an efficient modular inter-procedural analysis that is accurate enough to generate, fully automatically, complex invariants for a wide class of programs. This
class includes for instance sorting algorithms such as insertion and merge-sort and the particularly challenging quick-sort, and all usual list manipulation procedures. We have implemented our approach in a
verification tool for C programs called C ELIA.
Automata-based approach: In [HHRSV11], we introduce a novel class of tree automata, called forest
automata, that is suitable for the analysis, within the RMC approach, of heap manipulating programs
with complex shapes. A heap is split into several “separated” parts such that each of them can be
represented by a tree automaton, and a hierarchical representation of heaps is considered by allowing
alphabets of the tree automata to contain other, nested tree automata. This approach has been implemented (by T. Vojnar’s group at TU Brno) and tested successfully on multiple non-trivial case studies,
showing that it compares favorably with existing automated verification tools such as Space Invader 5 .
A Model Checking-based Approach for Malware Detection: Existing antivirus systems use either
code emulation or signature detection. These techniques are limited since emulation-based systems can
only check programs for a bounded time, whereas signature-based systems are easy to get around using
obfuscation. Many of the known obfuscation techniques rely on operations on the stack such as inserting
dead code by adding useless push and pop instructions, hiding calls to the operating system, etc. We
propose in [ST12a; ST12c] 6 a novel approach for malware detection based on model checking that takes
into account the behavior of the stack. Our approach consists in (1) modeling the program as a pushdown
system, (2) using a new temporal logic, SCTPL, as a generic description language for malicious behaviors, and (3) detecting these behaviors using model-checking of pushdown systems against SCTPL. We
solve this problem by a reduction to emptiness checking of Symbolic Alternating Büchi Pushdown Systems, for which we provide an efficient algorithm 7 . We have implemented our techniques in a tool
5. J. Berdine et al.: Shape Analysis for Composite Data Structures. CAV’07, LNCS 4590.
6. [ST12c] received the EASST – Europ. Assoc. of Software Science and Technology – best paper award at ETAPS’12.
7. We extend our work in [ST11] that improves the known upper-bound for model checking pushdown systems against
CTL.
235
(called V I D EC) that was able to automatically detect more than 400 viruses, many of which could not
be detected by known antivirus systems such as Avast, Avira, and Kaspersky.
Model Checking for Extended Temporal Logics: We have investigated extensions of temporal logics
in order to take into account various aspects such as:
Timed constraints [BCL11; BLMO07; JSL08]: We have studied in particular temporal logics allowing
to express the controllability of a timed system, i.e., the fact that there exists a controller which ensures
the satisfaction of some given property.
Counting constraints [DDS12; LMP10a; LMP10b]: Correctness may depend from the satisfaction of
tight arithmetical constraints on numbers of occurrences of events in computations. We have defined
various extensions of the logics LTL and CTL with counting mechanisms, and we have investigated the
complexity of their model checking problem, establishing a wide panorama, from P to undecidability.
Open and multi-agent systems [BLLM09; Lar10; LLM10; LMO08]: Specifying open systems requires
extending temporal logics to express the fact that a system has a strategy that ensures a property, whatever the environment can do. We have produced several results on the expressiveness and the complexity
of such logics. In particular, we have proposed an expressive extension of ATL 8 allowing to reason about
complex properties on the existence of strategies for coalitions of agents.
Games: We have investigated important classes of games, taking into account various aspects such as
(1) higher-order stack manipulation [CHMOS08], (2) memory use in randomized strategies for infinite
games [CHH09; CHH11; Hor07a; Hor07b; Hor08; HTW08], (3) stochasticity and quantitative aspects
[GH08a; GH08b; GH10], and (4) fairness in 2-player games, inspired by Banach-Mazur games, and
leading to a novel class of 3-player (ABM) games: We show that winning in an ABM-game (i.e. against a
fair player) is equivalent to winning with probability one against the randomized adversary [ACYFV10].
Entropy of timed languages: In [AD09a; AD09b] 9 , we have initiated a new research line on size,
entropy and information in timed languages. For timed languages, measures of their size were defined:
volume for a fixed finite number of events, and entropy (growth rate) as asymptotic measure for an
unbounded number of events. These measures can be used for comparison of languages, and the entropy
can be viewed as information contents of a timed language. For deterministic timed automata languages,
exact formulas for volumes were given. Next, the entropy was characterized using methods of functional
analysis, as a logarithm of the leading eigenvalue (spectral radius) of a positive integral operator. Several
methods to compute the entropy were devised. Subsequently, the approach was extended to automata
with some degeneracy [AD10a]. On the other hand, the notion of entropy helps in classical problems on
languages and automata: For timed automata whose entropy is not too small most trajectories have good
properties (pumping lemma, discretizability) [BA11]. To study precisely the growth of timed languages,
we associate with them generating functions and investigate their properties [ABDP12].
1.3
Scientific services, international visibility, and collaborations
Scientific production: (1) Publications in renown journals (34) and major conferences 10 (>100). Three
best paper awards (CIAA’08, FORMATS’09, and ETAPS’12).
(2) New tools: C ELIA http://www.liafa.univ-paris-diderot.fr/celia/ (Verification of C programs with data
structures), P U M O C [ST12b] http://www.liafa.univ-paris-diderot.fr/∼song/PuMoC/ (CTL model-checker for
C/C++/Java programs), and V I D EC http://www.liafa.univ-paris-diderot.fr/∼song/videc/ (Virus detector).
Position of the team and collaborations: (1) The MV team is well recognized in the communities
of computer aided verification, concurrency, real-time and hybrid systems. She has several collabora8. R. Alur, T. Henzinger, O. Kupferman: Alternating-time Temporal Logic. JACM 49(5), 2002.
9. Paper [AD09a] received the best paper award at FORMATS’09
10. e.g., CAV, CONCUR, FORMATS, FOSSACS, FSTTCS, ICALP, LICS, MFCS, PLDI, POPL, STACS, TACAS, VMCAI.
236
tions, nationally (VERIMAG, LaBRI, LSV, LIGM, LIP6, IRCCyN, IRISA, etc.) and internationally (U.
Uppsala, TU Munich, TU Brno, U. Lübeck, Microsoft Research (Redmond and India), Chennai Math
Inst., U. Wisc.-Madison, IST Austria, U. Torino, U. Genoa, etc.). The team is member of the LIA Infinis
(Argentina), and of the LEA Struco (Czech Rep.). She is associated member of the LIA Informel (India).
(2) The MV team has participated to 8 (RNTL/ANR) national collaboration projects, coordinating 4 of
them. Additionally, she has participated to a COST european collaboration action, and to several bilateral collaboration projects with international teams. In the context of (RNTL/ANR) national research
projects, our team has established collaborations with industrials such as EDF, and also with CEA 11 .
(3) Our team has 5 common works with other teams in LIAFA and PPS 12 .
(4) F. Laroussinie is junior member of the IUF (Institut Universitaire de France). A. Bouajjani is member
of IFIP Working Group 2.2 Formal Description of Programming Concepts.
Invited contributions and stays: (1) Several invited talks in international conferences and
(open/closed) workshops, e.g., FCT, LATA, VMCAI, etc. as well as in national and international schools
for PhD students and young researchers: ECI (Buenos Aires), ECNU Summer School (Shanghai), ETR
(Paris) FSFLA (Tarragona), InfoMath (Nancy), MOVEP (Marseille), VTSA (MPI-Saarbrücken).
(2) Several invited stays in international laboratories, e.g., CMI, Microsoft research (Redmond, India),
Reykjavik, Stuttgart, Taipei, Tel Aviv, Uppsala, etc.
(3) Two invited contributions to the Handbook of Model-Checking: A. Bouajjani and T. Touili.
Editorial and evaluation activities: (1) Membership of editorial boards of international journals, e.g.,
FMSD 13 (A. Bouajjani), MSCS 14 (E. Asarin), and of steering committees: FORMATS 15 (E. Asarin),
MOVEP 16 (F. Laroussinie). Membership of the CAV Award committee 17 (A. Bouajjani).
(2) PC-chairing of major intern. conferences of our community: CAV’09, ATVA’10 (A. Bouajjani),
CAV’10 (T. Touili), CONCUR’10 (F. Laroussinie), and participation in several PC committees, e.g.,
CAV, CONCUR, FOSSACS, FSTTCS, HSCC, ICALP, LICS, POPL, STACS, TACAS, VMCAI, etc.
(3) Participation in intern. project/institution evaluation boards (FP7-ICT FET-Open prog., DFG, ULB).
(4) Participation in selection committees for professor/assist. prof. appointment in France (U. de
Provence, U. Bordeaux, U. Grenoble, INP Grenoble, INRIA) and Germany (MPI).
(5) Reviewing and/or membership of multiple PhD and Habilitation juries in France (ENS Cachan, U.
Grenoble, U. Rennes, U. Bordeaux, U. de Provence, etc.). Reviewing PhD theses in foreign universities,
e.g., TU Brno, U. Buenos Aires, U. Libre Brussels, TU Munich, U. Tel Aviv, U. Uppsala.
1.4
Internal organization and management
The team: At this date, the team is composed of 12 permanent members (3 UP7 Prof., 1 UP6 Prof.Emeritus, 6 UP7 Ass. prof. and 2 CNRS researchers), 2 post-docs, and 6 PhD students.
Organization: The MV team is organized around three closely related research topics: (T1) Model
checking, temporal logics and synthesis, (T2) Timed and hybrid systems, and (T3) Program verification.
The activities in these axes are headed and organized respectively by F. Laroussinie, E. Asarin, and A.
Bouajjani. The number of permanent members working on each of the three topics are roughly 3, 3, and
11.
12.
13.
14.
15.
16.
17.
C ELIA implemented by our team is a plug-in of Frama-C, a platform for C program analysis developed by CEA.
AA [CH08a; CH08b; CHMOS08], ADG [CDGFS11], and PPS [ACYFV10].
Formal Methods in System Design, Springer. This is the main journal of the CAV community.
Mathematical Structures in Computer Science, Cambridge Journals.
Intern. Conf. on Formal Modeling and Analysis of Timed Systems.
School for young researchers on Modeling and Verifying Parallel processes.
Annual award, which recognizes a fundamental contribution or a series of outstanding contributions to the CAV field.
237
6 respectively. Most of the work in the team is carried out collegially within small collaborative groups.
The team has a weekly seminar 18 . (Talk announcements are broadly diffused in the area.) The first
goal is to attract talks by external researchers on recent work or tutorials by experts on various topics of
interest. The second goal is to allow locals to expose their work and get feedback, which contributes to
the communication inside the team. The first slot of each month is reserved to a local speaker.
Students are encouraged to attend doctoral schools, and members of the team are encouraged to attend at
least once every year a major conference in our area such as CAV, CONCUR, ETAPS, or POPL, even if
they do not have a paper to present at that event. (For instance, all students have been sent to ETAPS’12.)
Students are also encouraged to visit other research groups. (For instance, Antoine Durand-Gasselin is
visiting Rajeev Alur at U Penn for 4 months this year.) Students are closely supervised and encouraged to
defend their theses within 3 to 4 years. Six PhD theses have been defended. Assistant professors (MdC)
and researchers (CR) are encouraged to develop a research project and to present a Habilitation. Two
Habilitations have been defended (P. Habermehl and T. Touili) and one is in preparation (M. Sighireanu).
Evolution of the permanent staff: In 2007 (end of previous period), Luc Boasson (Pr) and JeanBaptiste Yunes (MdC) left MV to join AA, and Carole Delporte (MdC) and Hugues Fauconnier (MdC)
moved to ADG. During 2007-12, two MdC’s left our team: Thierry Cachat who, for personal reasons, is
in leave since Sept. 2008, and Antoine Meyer who got in Aug. 2009 a CNRS “chair position” and moved
to LIGM at U. Marne-la-Vallée. In this period, our team hired one professor: François Laroussinie in
2007 19 and three MdC’s: Constantin Enea (T3) in 2009, Arnaud Sangnier (T1 and T3) in 2010, and
Aldric Degorre (T2) in 2011. She has also hired a CNRS researcher, Florian Horn (T1 and T2) in 2009.
Post-docs: Our team had in this period six post-docs, each of whom stayed for 1 to 2 years, working
on topic T3: Séverine Fratani (now MdC at Marseille), Ahmed Rezine (now Assit. Prof. at Linköping,
Sweden), Constantin Enea (MdC in the team), Roland Meyer (Junior-Prof. at Kaiserslautern, Germany),
Gennaro Parlato (Lecturer at Southampton, UK), and Michael Emmi (still with us for a 3rd year).
Evolution of the scientific topics: In the last few years, our team has strengthened her activities in
formal verification, and she has also developed new research directions, mainly:
• A new activity has been lunched recently in T2 on the use of entropy and information theory to
develop an original approach for quantitative reasoning. The current work concerns timed systems, but the approach has many potential applications: defining quality measures for abstractions,
notion of approximate satisfaction, probabilistic model-checking, etc.
• The activity in T3 expanded from infinite-state verification (for abstract automata-based models)
to source-code program verification, leading to new contacts in other communities. While the
team maintains her strong presence in conferences where she is used to publish like CAV, CONCUR, TACAS, ICALP, FSTTCS, etc., she is also publishing in conferences of the programming
languages and program analysis communities such as POPL, PLDI, ESOP, SAS, etc. In addition to partners in the model-checking community, our team has collaborations with academic
researchers in the program analysis community as well as with researchers at Microsoft Research.
Funding and financial management: The main funding source of the team is through its participation
in ANR projects. The team got this way funding for several post-doc and PhD grants, as well as for
consumables, equipment, and travels expenses. In addition, F. Laroussinie has a financial support from
IUF. The management of the resources is made by the responsible of each project, in agreement with the
head of the team. In normal time, (almost) every member of the team is involved in a funded project.
A solidarity principle is applied within the team which consists in using, as much as possible, available
resources to cover the needs of those who are not involved in a funded project.
18. http://www.liafa.univ-paris-diderot.fr/web9/manifsem/listmanifannee en.php?typecongres=4.
19. 2 professors left our team in 2003-07: P. Gastin (2004) and A. Muscholl (2006), and one joined: E. Asarin (2003).
238
Chapter 2
Intitulé de l’unité: LIAFA, UMR 7089
Directeur de l’unité: Pierre Fraigniaud
Responable de l’équipe: Ahmed Bouajjani
2.1
Effectifs
2007: 1 CR CNRS, 3 PR UP7, 1 PR UP6, 8 MdC UP7, 2 post-docs, 8 doctorants
2012: 2 CR CNRS, 3 PR UP7, 1 PR-Emérite UP6, 6 MdC, 1 post-doc, 6 doctorants
Personnels ayant quitté l’équipe: 2007: L. Boasson (PR) et J-B. Yunes (MdC) rejoignent AA, C. Delporte (MdC) et H. Fauconnier (MdC) rejoignent ADG. 2008: T. Cachat (MdC) en détachement.
2009: A. Meyer (MdC) obtient une chaire CNRS au LIGM. 6 Doct. (166m), 5 PostDocs (69m).
Recrutement: 2007: F. Laroussinie (PR, UP7). 2009: C. Enea (MdC, UP7) et F. Horn (CNRS CR).
2010: A. Sangnier (MdC, UP7). 2011: A. Degorre (MdC, UP7).
2.2
Vérification de programmes avec structures de données: Complexité de problèmes sur les structures automatiques [DGH10; DGH12]. Décidabilité de logiques pour raisonner sur des programmes
manipulant un tas de mémoire [BDES09; HIV08b]. Techniques de vérification basées sur les automates/logiques/interprétation abstraite [BDES11; BHIKV09; HHRSV12]. Outil C ELIA.
Vérification de programmes concurrents: Décidabilité et complexité [ABQ11; ABT08a; Ati10a;
Ati10b; BE12a]. Procédures efficaces de détection de bugs basées sur une séquentialisation compositionnelle [ABEL12; BE12b; BEP11]. Décidabilité, complexité, et techniques efficaces pour la vérification
de programmes s’exécutant sur des modèles mémoire faibles [ABBM10; ABBM12; ABP11; BMM11].
Malware Detection: Approche basée sur le model checking, utilisant une logique temporelle appropriée
pour la description des comportement malicieux, et des algorithmes efficaces de model checking pour
automates à pile (modélisant les programmes) [ST12a; ST12c]. Deux outils: P U M O C, un model-checker
pour programmes C/C++/Java avec procédures [ST11; ST12b], et V I D EC, un détecteur de virus.
Logiques temporelles et jeux: Décidabilité et complexité pour des logiques temporelles étendues:
Logiques temporisées [BCL11; JSL08], logiques à compteurs [DDS12; LMP10a; LMP10b], et logiques
de jeux pour raisonner sur les stratégies et les comportements de systèmes multi-agents [BLLM09;
LLM10]. Ccomplexité pour résoudre différentes sortes de jeux, e.g., [CHH09; CHL10; GH10].
Systèmes temporisés et hybrides: Décidabilité pour des classes de systèmes hybrides [AMPS12;
APSY08; ASY07]. Nouvelle approche quantitative basée sur la définition de notions d’entropie et de
volume de langages temporisés. Résulats sur la caracterisation et le calcul de ses mesures, sur l’étude
de la croissance de langages temporisés, etc. [ABDP12; AD09a; AD09b; AD10a; BA11].
239
CHAPTER 2. FICHE RÉSUMÉ: MODÉLISATION ET VERIFICATION
2.3
2.3.1
Bilan quantitatif
Publications
Journaux: 34 ; Conf. Int. avec CL: 101 ; W. Int. avec CL: 5 ; Conf. Int. Inv.: 3 ; Chap. ouvrages: 3.
[BDES11] Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. “On inter-procedural analysis of programs with lists and data.” Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design
and Implementation (PLDI’11). ACM, 2011, pp. 578–589.
[HHRSV12] Peter Habermehl, Lukás Holı́k, Adam Rogalewicz, Jirı́ Simácek, Tomás Vojnar. “Forest automata for verification
of heap manipulation”. Formal Methods in System Design 41.1 (2012), pp. 83–106.
[BE12a] Ahmed Bouajjani, Michael Emmi. “Analysis of recursively parallel programs.” Proceedings of the 39th ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’12). ACM, 2012, pp. 203–214.
[ST12c] Fu Song, Tayssir Touili. “Pushdown Model Checking for Malware Detection.” Proceedings of Tools and Algorithms
for the Construction and Analysis of Systems - 18th International Conference (TACAS’12). Vol. 7214. Lecture Notes in
[AD10a] Eugene Asarin, Aldric Degorre. “Two Size Measures for Timed Languages.” Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10). Vol. 8. LIPIcs. Schloss
2.3.2 Logiciels, brevets, rapports, etc.
Habilitations à Diriger les Recherches soutenues:
− P. Habermehl, Vérification de systèmes avec structures de données complexes à l’aide d’automates. Dec. 2009.
− T. Touili, Modélisation et analyse d’accessibilité des programmes récursifs concurrents. Dec. 2009.
Outils: (1) C ELIA : Prog. avec tas, (2) P U M O C : MC de prog. procéd., (3) V I D EC : Détecteur de virus.
2.3.3 Rayonnement
1. Membres de comités éditoriaux de 5 journaux (e.g., FMSD, MSCS). Direction de comités de prog.
de 4 confs majeures (e.g., CAV, CONCUR), participations à des CP de confs prestigieuses.
2. Invitations à des confs et workshops internationaux. Invitations à des séjours dans labos étrangers.
3. 8 projets nationaux (7ANR+RNTL), 1 projet européen COST coll. action (48 membres), 5 projets bilatéraux européen (Tchéquie., Allemagne), et 2 projets de coll. intern. (Tunisie, Russie).
Implication dans 3 LIA/LEA du CNRS: Argentine, Tchéquie, Inde.
4. F. Laroussinie est membre junior de l’Institut Universitaire de France (IUF). A. Bouajjani est
membre du groupe de travail IFIP WG 2.2. Formal Description of Programming Concepts.
5. Prix du meilleur papier à CIAA’08, FORMATS’09, et TACAS’12 (prix de l’EASST à ETAPS’12).
2.3.4 Interactions de l’équipe avec son environnement
1. Direction de l’UFR informatique de UP7 (F. Laroussinie).
2. Direct. adjoint, responsabilité de l’informatique, de l’Ecole Doctorale “Sci. Math. Paris Centre”
regroupant l’informatique de UP7, ENS Paris, et INRIA Rocquencourt (A. Bouajjani).
3. Membre CA de UP7 (2005-09), co-responsabilité de la Commision de Moyens (M. Sighireanu).
4. Responsabilité (2004-2013) du parcours professionnalisant “Logiciels Critiques” du Master Info.
de UP7: Formation d’ingénieurs compétants en “génie logiciel rigoureux”, pour entreprises dans
le secteur de pointe des systèmes embarqués.
5. Responsabilité (depuis 2010) du parcours Informatique de la nouvelle Ecole d’Ingénieurs de UP7:
Formation d’ingénieurs en logiciel, spécialisés dans les systèmes embarqués. Appui et implication
d’industriels tels que AdaCore, EADS, Trusted logics, et du CEA.
2.3.5 Actions de formation
1. Master recherche MPRI: 2 cours. ENS Paris: 1 cours.
2. Cours avancés: Escuela de Ciencias Informáticas (Buenos Aires), East China National Univ.
Summer School (Shanghai), Ecole Jeunes Chercheurs Info. et Math. (Nancy), Ecole Temps Réel
(Paris), School for young researchers on MOdeling and VErification of Parallel processes (CIRM,
Marseille), School on Verification Technology, Systems and Applications (MPI, Saarbrücken).
3. Formation (Académie de Paris, IREM P7) de Prof. de Math. au lycée sur l’enseignement d’Info.
240
Chapter 3
Laboratory: LIAFA, UMR 7089
Director of the laboratory: Pierre Fraigniaud
Responsible of the team: Ahmed Bouajjani
3.1
Members
2007: 1 CNRS researcher, 3 PR UP7, 1 PR UP6, 8 MdC UP7, 2 post-docs, 8 PhD students
2012: 2 CNRS researchers, 3 PR UP7, 1 PR-Emeritus UP6, 6 MdC, 1 post-doc, 6 PhD students
Members who left the team: 2007: L. Boasson (PR) and J-B. Yunes (MdC) moved to AA, C. Delporte
(MdC) and H. Fauconnier (MdC) moved to ADG. 2008: T. Cachat (MdC) on leave. 2009: A.
Meyer (MdC) got a CNRS-chair position at LIGM-UMLV. 6 PhDs (166m), 5 PostDocs (69m).
Hiring: 2007: F. Laroussinie (PR, UP7). 2009: C. Enea (MdC, UP7) and F. Horn (CNRS CR). 2010:
A. Sangnier (MdC, UP7). 2011: A. Degorre (MdC, UP7).
3.2
Scientific outcomes
Verification of Programs with Data Structures: Complexity of decision problems on automatic structures [DGH10; DGH12]. Decidability of (graph) logics for reasoning about heap manipulating programs
[BDES09; HIV08b]. Automata/logic/abstract interpretation techniques for the verification of these programs [BDES11; BHIKV09; HHRSV12]. Advanced C program verification tool C ELIA.
Verification of Concurrent Programs: Decidability and complexity of various verification problems
[ABQ11; ABT08a; Ati10a; Ati10b; BE12a]. Powerful bug detection procedures based on compositional
reduction to sequential analysis [ABEL12; BE12b; BEP11]. Decidability, complexity, and efficient techniques for verifying programs under weak memory models [ABBM10; ABBM12; ABP11; BMM11].
Malware Detection: Model checking-based approach using a suitable temporal logic for describing malicious behaviors, and efficient model checking algorithms for pushdown systems (modeling programs)
[ST12a; ST12c]. Development of two novel tools: P U M O C, a (general purpose) CTL model-checker
for procedural C/C++/Java programs [ST11; ST12b], and V I D EC, a virus detector.
Temporal Logics and Games: Decidability and complexity of satisfiability/model checking problems for extended temporal logics: Timed logics [BCL11; JSL08], logics with counters [DDS12;
LMP10a; LMP10b], and game logics for reasoning about strategies and behaviors of multi-agent systems
[BLLM09; LLM10]. Complexity of solving various classes of games, e.g., [CHH09; CHL10; GH10].
Timed and hybrid systems: Decidability results for classes of hybrid systems [AMPS12; APSY08;
ASY07]. Novel approach for quantitative reasoning based on the introduction of notions of entropy and
volume of timed languages. Results on the characterization and the computation of these measures, on
the study of the growth of times languages, etc. [ABDP12; AD09a; AD09b; AD10a; BA11].
241
CHAPTER 3. EXECUTIVE SUMMARY: MODELING AND VERIFICATION
3.3
3.3.1
Publications
Journals: 34 ; Int. Conf. with PC: 101 ; Int. W. with PC: 5 ; Inv. Int. Conf.: 3 ; Chapt. in books: 3.
[BDES11] Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. “On inter-procedural analysis of programs with lists and data.” Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design
and Implementation (PLDI’11). ACM, 2011, pp. 578–589.
[HHRSV12] Peter Habermehl, Lukás Holı́k, Adam Rogalewicz, Jirı́ Simácek, Tomás Vojnar. “Forest automata for verification
of heap manipulation”. Formal Methods in System Design 41.1 (2012), pp. 83–106.
[BE12a] Ahmed Bouajjani, Michael Emmi. “Analysis of recursively parallel programs.” Proceedings of the 39th ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’12). ACM, 2012, pp. 203–214.
[ST12c] Fu Song, Tayssir Touili. “Pushdown Model Checking for Malware Detection.” Proceedings of Tools and Algorithms
for the Construction and Analysis of Systems - 18th International Conference (TACAS’12). Vol. 7214. Lecture Notes in
[AD10a] Eugene Asarin, Aldric Degorre. “Two Size Measures for Timed Languages.” Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10). Vol. 8. LIPIcs. Schloss
3.3.2 Software, patents, reports, etc.
Habilitations:
− P. Habermehl, Verification of systems with complex data structures using automata. Dec. 2009.
− T. Touili, Modeling and reachability analysis of concurrent recursive programs. Dec. 2009.
Tools: (1) C ELIA : Programs with heaps, (2) P U M O C : MC proced. prog., (3) V I D EC : Virus detector.
3.3.3 Influence of the team
1. Members of editorial boards of 5 journals (e.g., FMSD and MSCS). PC-chairs of 4 major intern.
confs (e.g., CAV and CONCUR), numerous participations in PC committees of prestigious confs.
2. Invited talks in intern. conf., workshops, and upon-invitation-only events. Invited long-stay visits.
3. Involved in 8 national collab. projects (7ANR+RNTL), 1 COST europ. collab. action (48 members), 5 europ. bilateral coop. projects (Czech Rep., Germany), and 2 intern. bilateral coop.
projects (Tunisa, Russia). Involved in 3 CNRS LIA/LEA: Argentina, Czech Rep., India.
4. F. Laroussinie is junior member of Institut Universitaire de France (IUF). A. Bouajjani is member
of the IFIP Working Group 2.2. Formal Description of Programming Concepts.
5. Best paper awards at CIAA’08, FORMATS’09, and TACAS’12 (EASST award at ETAPS’12).
3.3.4 Interactions between the team and its environment
1. Director of the CS dept. (UFR informatique) of the UP7 (F. Laroussinie).
2. Deputy dir., responsible of Computer Science, of the Doctoral School “Sci. Math. Paris Centre”
covering CS at UP7, ENS Paris, and INRIA Roquencourt (A. Bouajjani).
3. Admin. Council of UP7 (2005-09), co-resp. of the Funding Commission of UP7 (M. Sighireanu).
4. Responsibility (2004-13) of the professional specialization “Critical Software” of the CS master of
UP7: Education of engineers with advanced skills in rigorous software engineering for high-tech
companies in embedded systems and security.
5. Responsibility (since 2010) of the CS program of the new Engineering School of UP7: Education
of CS engineers in software design, specialized in embedded systems. Involvement of industrials
such as AdaCore, EADS, Trusted logics, and of CEA.
3.3.5 Educational activities
1. Research master MPRI: 2 courses. ENS Paris: 1 course.
2. Advanced lectures: Escuela de Ciencias Informáticas (Buenos Aires), East China National Univ.
Summer School (Shanghai), Ecole Jeunes Chercheurs Info. et Math. (Nancy), Ecole Temps Réel
(Paris), School for young researchers on MOdeling and VErification of Parallel processes (CIRM,
Marseille), School on Verification Technology, Systems and Applications (MPI, Saarbrücken).
3. Lectures and training (Paris Academy, IREM of UP7) in CS for high school Math. professors.
242
Chapter 4
4.1
Introduction
Software verification is a major research domain, addressing issues that raise when reasoning about various classes of systems such as safety critical embedded systems as well as concurrent and distributed
software, motivated in particular by the recent development of muticores and cloud computing. Indeed,
as processor manufacturers reach clock-speed limits, computations are parallelized across multiple processor cores to improve performance. Moreover, due to the ubiquity of mobile devices and widespread
decentralized networks, applications are executing collaboratively, distributed across a vast network
of peers. These developments raise a tremendous number of problems concerning, e.g., consistency
and conformance with expected behaviors, performances, security, etc. Numerous challenges must be
attacked to face the complexity of these systems: New specification and verification techniques are
needed for reasoning efficiently about both complex configurations and complex computations. They
should lead to automatic tools allowing (1) to find bugs in programs w.r.t. various correctness criteria and
classes of specifications, (2) to have substantial help in correcting these bugs, i.e., getting useful diagnosis and (proposals for) program repairs, and (3) to establish program correctness. Moreover, quantitative
reasoning is important in this context since performances and cost optimization (in terms of execution
time, memory consumption, etc.) are crucial in many cases. So, verification and synthesis/program
repair techniques should take into account these aspects.
In the next period, our team will continue and expand her activities, addressing foundational and practical
issues related to automated verification and design of software systems. Her main objectives are:
1. Extending the applicability of model checking to wider classes of systems and properties. We
will consider new practically-relevant formal models and specification formalisms, and investigate their expressiveness as well as their decision problems and their complexity. In particular,
we intend to investigate in depth the links between game logics (such as ATL) and quantified
branching-time temporal logics, and their application in the verification of open systems.
2. Broadening and strengthening our activities on program verification. We intend:
• to develop verification algorithms for concurrent and distributed programs, targeting in particular software for multicores and for cloud computing platforms.
• to generalize our work on the verification of heap manipulating programs to the case of
more complex heap structures (such as composite data structures), and to other types of
programs (such as functional and concurrent programs). In particular, we aim at developing
verification techniques and tools of libraries of concurrent and/or distributed data structures.
• to extend our model checking-based approach for automatic malware detection, and to investigate other applications of advanced model checking techniques to the area of security.
3. Developing new methods for quantitative reasoning and applying them to, e.g., resource-aware
analysis, probabilistic verification, performance optimization, etc. In particular, we will deepen
our investigations on our recently initiated approach for entropy and information theory-based
analysis of computational systems, and explore its multiple applications.
243
CHAPTER 4. RESEARCH PROJECT: MODELING AND VERIFICATION
4.2
Reasoning about complex data structures
Programs can be classified with respect to the level of abstraction under which they handle memory. It
is possible to identify three different levels of abstraction of dynamically allocated data-structures:
Axiomatically-defined data structures that are exclusively defined and manipulated through a high-level
API exhibiting simple algebraic properties. This level corresponds to programs using libraries of “containers” (vector, list, set, map, array, stack, etc.), assuming that these containers are correctly implemented. Containers libraries are available in almost all languages, e.g., STL in C++, Java Standard
Collections, Ada Standard Libraries, OCaml, etc.
Imperative data structures with explicit manipulation of dynamically-allocated memory: Data structures
are manipulated via mutable references, pointers and statically typed records, as well as dynamic memory creation and deletion, as in languages such as Java, Ada and some (limited) dialects of C and C++.
This level corresponds, e.g., to libraries of containers implementing various data-structures.
Machine-level data structures which are basically imperative data-structures with additional features
tightly related to the machine representation: Memory addresses can be manipulated with numerical
offsets (pointer arithmetics), types cannot be fully trusted (type casts), and addresses can be accessed
differently when manipulating objects of different types (unions in C or “type-punning”). C and C++
are examples of languages allowing such operations. This level corresponds to low-level programs.
This classification corresponds, roughly, to three paradigms of programming: functional, imperative and
low-level programming. It is possible to identify verification techniques which pertain mostly to one of
these classes, such as for instance, the use of abstract data types at the axiomatic level, versus the use of
graph logics at the imperative level, or the use of modulo arithmetics at the machine level.
Our aim is to develop verification algorithms and techniques that are applicable to each of the three levels
described above. In the last period, our work has mainly focused on the second level (i.e., imperative
programs manipulating dynamic data structures). In the next period, we intend to generalize this work
and to extend it to the other (higher and lower) levels. We will address mainly the following issues:
Approximate/exact decision procedures: Besides investigating the decidability and complexity of
relevant specification (automata/logic-based) formalisms, we intend developing powerful algorithms for
checking satisfiability and entailment based on approximate but sound techniques that are applicable
to wide classes of programs and properties (beyond known decidable classes) and that provide a good
trade-off between generality, accuracy and scalability. We will define new abstract domains corresponding to different kinds of constraints, and we will define operations for their composition. We will investigate in particular techniques combining automata-based abstract representations of complex heap
graphs (e.g., forest automata), with logic-based constraints on various aspects such as sizes, multisets of
elements, number of occurrences of elements, arithmetical relations between elements, etc. We will also
investigate combining our abstraction-based decision procedures with SMT solving techniques.
Analysis of imperative programs with composite data structures: Programs manipulate in general heaps composed of several overlapping structures sharing objects. The simplest case is the one
of hierarchical data structures (such as lists of lists), where it is possible to reason about each level in
isolation. However, this situation does not always hold. We intend to define abstraction methods and
compositional techniques allowing to reason efficiently about such complex structures.
Modular analysis of functional programs with abstract data structures: We intend extending our
work on inter-procedural analysis of imperative programs to the case of functional programs (and even
further to higher-order programs). We will investigate summarization-based analysis techniques for
these programs, and will combine them with appropriate abstract domains for reasoning about the manipulated, recursively defined, data structures.
244
4.3
Concurrent and distributed systems
Parallelism and concurrency are present at all levels on computer systems, from distributed applications
on large-scale networks, to multi-threaded software in operating systems, to low-level code for multicore
hardware architectures.
In the last few years, many concurrent programming languages and frameworks have appeared, providing various high-level synchronization mechanisms and task-isolating abstractions for reactive, parallel,
and distributed programming, such as for instance, transactions, asynchronous programming, revisions,
etc. These abstractions relieve (high-level) application programmers from error-prone handling of intricate task interactions by allowing to reason about interleavings of well-delimited atomic blocks that
are executed in isolation. Still, nondeterminism in the execution order between these atomic blocks can
make program reasoning fairly complex. At the lower level of software implementing shared-memory
concurrency libraries of high-level synchronization primitives, complexity arises from relaxations of the
atomicity assumptions in order to increase parallelism (using fine-grain locking and non-blocking (lockfree) techniques), which allows to improve performances while ensuring to users at the application level
the notion of atomicity they expect. The correctness of non-blocking algorithms is established w.r.t.
correctness criteria such as linearizability and serializability.
Moreover, again for the sake of efficiency, compilers and modern multi-microprocessors may reorder
certain accesses to the shared memory, implementing relaxed memory models where behaviors are not
necessarily sequentially consistent (SC). Non-SC behaviors appear in presence of data races, which must
be allowed in many situations, especially for implementors of synchronization operations, who must be
aware of the hardware relaxations to ensure sufficient ordering guarantees, as well as for implementors
of transactional memories, concurrency libraries, and other performance-critical system services, who
bypass conventional locking protocols and employ lock-free synchronization techniques instead. Such
programs may either be immune to the relaxations by design, or contain explicit memory ordering fences
where these relaxations may have harmful effects.
Applications offering services over the web are running over distributed software infrastructures. Clients
of these applications typically modify and query informations stored in distributed data structures, the
latter being replicated in different locations of the network in order to ensure information availability to
the users. Ideally, all replicas must see the same sequence of updates. However, this would require permanent synchronizations through the network, which is unfeasible. Consequently, a weaker consistency
model, called eventual consistency is adopted, ensuring that all replicas eventually see all updates and
converge to the same configuration. At the higher level, abstraction mechanisms such as (distributed)
transactions can be provided to application programmers. Then, assuming coherence models such as
eventual consistency for update management, the implementation of these mechanisms must ensure correctness criteria such as serializability, or the weaker snapshot isolation or causal consistency that are
often adopted in this context for performance reasons.
Our aim in the next period is, being permanently guided by the current trends in the design of reactive,
parallel, and distributed programming languages and systems, to develop advanced methods for automatic verification of concurrent and distributed software, targeting important classes of systems such
as concurrent software running on multicores, and distributed software for cloud computing platforms.
We will develop verification techniques that are applicable to various kind of concurrent software, at
different levels of the software stack, taking into account various concurrency paradigms and synchronization mechanisms, as well as various practically-relevant memory models and correctness criteria.
Furthermore, we intend to develop methods and tools for automatic synthesis of synchronization actions
(e.g., locking actions, memory fences) in order to correct concurrency bugs. These methods must take
into account the performance penalty associated with a bug fix (as an additional lock or fence may have
an important impact on the performances), and propose optimal repairs. We will address mainly:
245
Models for concurrent programs and their verification problems: We will pursue our investigations on formal models corresponding to significant classes of concurrent/distributed programs. There is
a variety of (continuously emerging) programming patterns/languages used in multicore software programming and in cloud computing. It is important to understand the basic formal models behind these
patterns and languages, to study in depth the complexity of verification problems for these models, and
to develop efficient techniques and tools for their analysis.
Verifying correctness of libraries of concurrent and distributed data structures: We will investigate the decidability and the complexity of checking correctness criteria such as linearizability, serializability, snapshot isolation, eventual consistency, etc., taking into account various unbounded parameters
such as the size of the dynamic data structures, the number of threads, the size of the network, etc. Beyond the decidability issues, our aim is to develop efficient algorithmic techniques for these verification
problems based on on-the-fly behavior exploration techniques, and efficient symbolic representations of
concrete/abstract program configurations.
Verifying programs under weak memory models: We will investigate fundamental issues related
to the decidability and the complexity of verification problems, such as satisfaction of safety/liveness
properties, under realistic and complex weak memory models such as Power and ARM for hardware,
and the C++ memory model. Since we have shown that basic problems such as reachability are highly
complex even for (the strongest weak memory model) TSO, an important issue is to develop scalable
algorithmic verification techniques allowing to check program assertions either by detecting violations
using under-approximate analysis, generalizing for instance the promising approach we introduced in
[ABP11], or by establishing their validity using adequate abstraction techniques.
We will also investigate the issue of checking program robustness against weak memory models such
as those mentioned above. The limits of decidability, and the complexity, of the robustness problem
are unknown beyond TSO (for which we have established that it is PSPACE-complete). Our aim is to
explore and draw precisely the decidability frontier, and to characterize the class of models for which
robustness checking is PSPACE-complete and can be effectively reduced to state-reachability checking
under SC (allowing the use in this context of state-of-the-art verification tools for concurrent programs).
Synchronization synthesis and fence insertion: Based on the verification algorithms mentioned
above, we intend developing efficient techniques for automatic repair of concurrency bugs by inserting
necessary synchronization actions (such as locks or CAS actions) and memory fences. These techniques
should synthesize a set of synchronization actions, inserted at appropriate program locations, in order to
enforce correctness. A minimal requirement from the program repair is irreducibility, i.e., minimal w.r.t.
set inclusion. Other optimality criteria taking into account performances, must be investigated.
4.4
Malware detection
Malware detection is an important, highly challenging problem. Classical virus detection techniques
such as signature-based detection have serious limitations. In particular, virus writers use obfuscation
(such as dead-code insertion and register reassignment) and frequently update their viruses to make them
undetectable by these antivirus systems. To overcome these limitations, we proposed recently a novel
and quite powerful approach for automatic malware detection based on model checking. We intend to
develop this promising approach in the following ways:
• We will enlarge our capabilities of characterizing malicious behaviors. In particular, we will address the cases of self modifying malware (i.e. malicious codes which mutate their own code
whenever they propagate), and of distributed web malware that exploit vulnerabilities in the web
infrastructure. For that, we will extend our approach by defining appropriate models for representing the behaviors of the analyzed programs (that can be sequential, concurrent, or distributed), and
expressive logics for compact description of malicious behaviors of various families of malware.
246
• We will design efficient malware detection algorithms based on model checking techniques for the
considered program models and malware specification logics. In particular, we will investigate
adequate abstraction and symbolic techniques allowing to improve scalability.
4.5
Quantitative Reasoning
Estimating resource consumption: Computing bounds on the amount of resource used by a program
is a problem of the highest importance in software design in a variety of domains, ranging from embedded systems to cloud computing. Critical resources can be, e.g., execution time, memory, power,
bandwidth, etc. A crucial issue is to characterize a worst-case bound on the resource consumption of a
program as a function of its input parameters. It is a difficult problem due to complex control structures
such as nested loops, recursion, etc, as well as to complex data and heap manipulations. It is important to
provide good approximations of consumption-bound functions that can be quite complex (polynomials,
exponentials, etc.). We will investigate the extension of our program analysis techniques to this problem.
In particular, we intend 1 to define (1) abstract domains for reasoning about various kind of measures, and
(2) analysis procedures using these abstract domains able to generate consumption-bounds functions.
Entropy and quantitative analysis: We will continue our investigations on entropy/information
theory-based analysis for models of computational systems. This analysis will lead to a substantial
progress in three directions which constitute three facets of the main objectives of our project:
Theoretical study of entropy in new classes of dynamical systems: We aim to obtain important theoretical contributions concerning entropy of (generalized) dynamical systems associated to transducers,
games, timed and cellular automata etc. Implications on conjugacy and expressiveness problems, as
well as relations to other information measures, such as Kolmogorov complexity, will be addressed.
Study of information processes in computational systems: It is a commonplace that computational systems process and transmit information. In this project we will measure the quantity of information
circulating in or generated by such systems. This would shed new light on computational systems, and
provide new tools to assess computer security and performance of communication protocols, and new
approaches to data compression.
Quantitative analysis and quantitative verification of computational systems: We believe that, compared to more usual probability-based approaches, entropy methods have two important advantages:
they do not require exact knowledge of probabilities of all the events in the system, and they can be
much easier to implement.
The concepts and the techniques developed during this work will be useful for adjacent areas of computer
science, especially theory of automata and formal languages, and probabilistic verification. We intend
to investigate their use in defining adequate measures for the quality of an implementation w.r.t. a
correctness criterion. This is important, e.g., in resource/performance-aware program repair/synthesis.
4.6
Implementation of the project
Manpower: The project is a continuation of the present activities of the team, addressing topics where
the team has strong expertise, and expanding to adjacent topics in a natural way. The team has a wide
network of collaborators. Though, the following issues must be addressed during the next period:
• The team has developed in the last few years a strong activity on the verification of formal models for
concurrent programs, and more recently on source-code concurrent programs. However, in the last couple of years, the main manpower on this research topic was constituted by post-docs and PhD students.
(T. Touili, who contributed a lot to this topic, shifted recently her main interests to the topic of malware
detection and security.) Although, we are keeping active collaboration with these former members of our
1. Work in collaboration with Diego Garbervetsky and Sergio Yovine from U. Buenos Aires in the frame of LIA Infinis.
247
team, maintaining in our team a strong and expanding activity on the topic of concurrent and distributed
program verification requires recruiting young permanent members.
• So far, the development of verification tools is our team has been done mainly by Mihaela Sighireanu,
with help of students, e.g., Cezara Dragoi during her PhD thesis. This task constitutes a huge, time consuming effort, especially that Mihaela has also teaching obligations. It is crucial to strengthen our team
by other members who have a balanced profile combining strong skills in both theoretical and practical
aspects, and who are able to conduct a research activity related to software development.
• Members playing key roles in our team such as Peter Habermehl and Mihaela Sighireanu have good
chances to get promoted in the next few years as Professors in other institutions. However, both Peter
and Mihaela are now essential contributors to the topic of infinite-state verification, decision procedures,
and verification programs with data structures. Moreover, as mentioned above, Mihaela is our main
person in tool development. Therefore, the move of these two members will be an important lost that
our team will need to compensate by recruiting young talented members for their replacement.
• Malware detection and security is a recent, important research direction in our team that we want to
develop. For that, we need to strengthen the group working on this direction, by recruiting post-docs
and students in the short term, and a young permanent member within the next 4/5 years.
• Our team lacks full-time permanent researchers. We will continue our efforts for attracting excellent
candidates, hoping that CNRS will eventually consider helping our team.
• In general, our team will need to recruit post-docs in replacement of those who left the team recently
(and who contributed a lot to her achievements), and to increase the number of her PhD students originating both from the research master MPRI and from foreign institutions. We hope that we will get
financial support (from ANR, Fond. Sci. Math. de Paris, etc.) for that.
Financial resources:
• The work concerning entropy and information-based analysis of computational systems is carried out
in the framework of a new 4-year ANR project EQINOCS coordinated by Eugène Asarin, in collaboration with LIGM (Marne La-Vallée), LACL (Paris 12) and VERIMAG (Grenoble).
• Currently, our team is participating to two other ANR projects Veridyc (program verification) and
ImpRo (timed systems). We intend submitting next year funding applications for continuations of the
Veridyc project: (1) Verification of multicore software, and (2) Decision procedures and analysis techniques for the verification of programs manipulating data structures.
• In addition to ANR project applications, we are participating to the definition of a european project
on the verification multicore software (with partners such as Uppsala university, ETH Zurich, etc.)
• We will also encourage our young researchers to apply to ERC starting grants on topics such as
verification of distributed data structures, and multiware detection.
New collaborations: We will develop several recently established contacts in our environment, e.g.:
• Open-source software deployment: We are defining a collaboration project with Ralf Treinen and
Roberto Di Cosmo (INRIA-PPS) on the verification of Unix Scripts, that are programs interacting with
the OS used, e.g., for maintaining (installing, removing, upgrading) software packages.
• Programs with data structures: We are defining a collaboration project with the AdaCore company
(e.g., Yannick Moy) on the verification of programs with complex data structures.
• Weak memory models: We intend defining a collaboration project with Luc Maranget (INRIA) on
formal modeling and automatic verification of hardware weak memory models.
• Distributed algorithms, distributed data structures: We have initiated discussions with Marc Shapiro
(INRIA-LIP6) on replicated, distributed data structures. Our aim is to understand semantical issues
related to the design of such data structures in order to develop verification methods for their implementations. We also intend collaborating with the ADG team on the verification of distributed algorithms.
(Notice that we have produced recently a common publication [CDGFS11]).
• Higher-order functional programs: We intend interacting with the AA team (e.g., Olivier Serre) on the
verification of higher-order functional programs, especially in the case of data manipulating programs.
248
EXTERNAL
D
Th
of epa
re
k
r
• Fu ey tu
at
Lo nd m re
,
e. ad ing em no
g. d c b n
, D u u e re
ir. e to ts rs pl
ac
of a
em
C dm
S
en
i
de nis
t
t
pa ra
rt. tiv
(U e ta
FR sk
) s
NEGATIVE
•
kn
ea
W
•
N
249
C
co ohe
St he sio
• co ron ren n o
M mp g t s f t
e
i
• n ains lem xp et o he
C
Ba A tr e er f r tea
la V eam nta tise es m
nc an
r
, ea ,
e d to y s
rc
th P pi ki
h
eo L cs lls
to
fi
pi
ry e
St
cs
/a lds
pp
re
ng
lic
at
th
io
ns
•
•
R
AN taff
on s
d ist.
se ss d
s
ba a te
er
y nt u
ch
nl e rib
ar
ai n st
m rma t/di tion ese
r
g
in pe ren ca S
nd of ur erifi R
Fu ack onc v f CN
m
•
c
o
L
s
n gra er
•
o
es
o b
pr um
•
k
or
ty
tw
ni
ne EA
tu
n /L
or
tio IA s:
ra L ic g,
pp
g,
O
bo n 3 top in
tin
lla n i g on
pu
co io in as , m
e at rg re on o
rg cip me e cti d c nt
La rti e tiv te ou e
• Pa ny tita de Cl loym
a
,
•
an are res ep
M
u
d
w
•
Q
al co e
M ulti ar
M oftw
S
S W
O T
POSITIVE
INTERNAL
250
Chapter 5
[ABd08]
Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d’Orso. “Monotonic and Downward
Closed Games.” J. Log. Comput. 18.1 (2008), pp. 153–169.
[ABHKV09]
Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holı́k, Lisa Kaati, Tomás Vojnar. “Composed Bisimulation for Tree Automata.” Int. J. Found. Comput. Sci. 20.4 (2009), pp. 685–
700.
[ABQ11]
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer. “Context-Bounded Analysis For
Concurrent Programs With Dynamic Creation of Threads”. Logical Methods in Computer
Science 7.4 (2011).
[AD10b]
Eugene Asarin, Catalin Dima. “On the computation of covert channel capacity.” RAIRO Theor. Inf. and Applic. 44.1 (2010), pp. 37–58.
[ADG07]
Eugene Asarin, Thao Dang, Antoine Girard. “Hybridization methods for the analysis of
nonlinear systems.” Acta Inf. 43.7 (2007), pp. 451–476.
[ADHR09]
Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine. “Monotonic Abstraction: on Efficient Verification of Parameterized Systems.” Int. J. Found. Comput. Sci. 20.5 (2009), pp. 779–801.
[ADR09b]
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine. “Approximated parameterized
verification of infinite-state processes with global conditions.” Formal Methods in System
Design 34.2 (2009), pp. 126–156.
[AH11]
Mohamed Faouzi Atig, Peter Habermehl. “On Yen’s Path Logic for Petri Nets.” Int. J.
Found. Comput. Sci. 22.4 (2011), pp. 783–799.
[AMPS12]
Eugene Asarin, Venkatesh Mysore, Amir Pnueli, Gerardo Schneider. “Low dimensional
hybrid systems - decidable, undecidable, don’t know.” Inf. Comput. 211 (2012), pp. 138–
159.
[APSY08]
Eugene Asarin, Gordon J. Pace, Gerardo Schneider, Sergio Yovine. “Algorithmic analysis
of polygonal hybrid systems, Part II: Phase portrait and tools.” Theor. Comput. Sci. 390.1
(2008), pp. 1–26.
[ASY07]
Eugene Asarin, Gerardo Schneider, Sergio Yovine. “Algorithmic analysis of polygonal hybrid systems, part I: Reachability.” Theor. Comput. Sci. 379.1-2 (2007), pp. 231–265.
[BBHIMV11] Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás
Vojnar. “Programs with lists are counter automata.” Formal Methods in System Design
38.2 (2011), pp. 158–192.
251
CHAPTER 5. LIST OF PUBLICATIONS: MODELING AND VERIFICATION
[BCL11]
Patricia Bouyer, Franck Cassez, François Laroussinie. “Timed Modal Logics for RealTime Systems - Specification, Verification and Control.” Journal of Logic, Language and
Information 20.2 (2011), pp. 169–203.
[BDEJS09] Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Yan Jurski, Mihaela Sighireanu. “A
Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes”.
Logical Methods in Computer Science 5.2 (2009).
[BHRV12]
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar. “Abstract regular
(tree) model checking.” STTT 14.2 (2012), pp. 167–191.
[BHV08]
Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar. “Verification of parametric concurrent
systems with prioritised FIFO resource management.” Formal Methods in System Design
32.2 (2008), pp. 129–172.
[BMT07]
Ahmed Bouajjani, Anca Muscholl, Tayssir Touili. “Permutation rewriting and algorithmic
verification.” Inf. Comput. 205.2 (2007), pp. 199–224.
[BT12]
Ahmed Bouajjani, Tayssir Touili. “Widening techniques for regular tree model checking.”
STTT 14.2 (2012), pp. 145–165.
[CGM08]
Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich. “Tree inclusion problems.” ITA
42.1 (2008), pp. 5–20.
[CHH09]
Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn. “Finitary winning in omegaregular games.” ACM Trans. Comput. Log. 11.1 (2009).
[DDHL11]
Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore. “SelfStabilizing k-out-of-l Exclusion in Tree Networks.” Int. J. Found. Comput. Sci. 22.3
(2011), pp. 657–677.
[FG09]
Eugénie Foustoucos, Irène Guessarian. “Inf-datalog, Modal Logic and Complexities.” ITA
43.1 (2009), pp. 1–21.
[GDE11]
Dimitar P. Guelev, Catalin Dima, Constantin Enea. “An alternating-time temporal logic
with knowledge, perfect recall and past: axiomatisation and model-checking.” Journal of
Applied Non-Classical Logics 21.1 (2011), pp. 93–131.
[HHRSV12] Peter Habermehl, Lukás Holı́k, Adam Rogalewicz, Jirı́ Simácek, Tomás Vojnar. “Forest
automata for verification of heap manipulation”. Formal Methods in System Design 41.1
(2012), pp. 83–106.
[HIV10]
Peter Habermehl, Radu Iosif, Tomás Vojnar. “Automata-based verification of programs
with tree updates.” Acta Inf. 47.1 (2010), pp. 1–31.
[Hor07a]
Florian Horn. “Dicing on the Streett.” Inf. Process. Lett. 104.1 (2007), pp. 1–9.
[JSL08]
Marcin Jurdzinski, Jeremy Sproston, François Laroussinie. “Model Checking Probabilistic
Timed Automata with One or Two Clocks.” Logical Methods in Computer Science 4.3
(2008).
[KLTR11]
Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps. “A decision procedure
for detecting atomicity violations for communicating processes with locks.” STTT 13.1
(2011), pp. 37–60.
[Lar10]
François Laroussinie. “Temporal Logics for Games.” Bulletin of the EATCS 100 (2010),
pp. 79–98.
[LMO08]
François Laroussinie, Nicolas Markey, Ghassan Oreiby. “On the Expressiveness and Complexity of ATL.” Logical Methods in Computer Science 4.2 (2008).
[Mey08]
Antoine Meyer. “Traces of term-automatic graphs.” ITA 42.3 (2008), pp. 615–630.
252
[TA10]
Tayssir Touili, Mohamed Faouzi Atig. “Verifying parallel programs with dynamic communication structures.” Theor. Comput. Sci. 411.38-39 (2010), pp. 3460–3468.
[Tou12b]
Tayssir Touili. “Computing transitive closures of hedge transformations.” IJCCBS 3.1/2
(2012), pp. 132–150.
[YRSMB07]
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer,
Ahmed Bouajjani. “A logic of reachable patterns in linked data-structures.” J. Log.
Algebr. Program. 73.1-2 (2007), pp. 111–142.
C-INV : Invited talks/papers in international conferences and workshops
[AB09]
Mohamed Faouzi Atig, Ahmed Bouajjani. “On the Reachability Problem for Dynamic
Networks of Concurrent Pushdown Systems.” Proceedings of Reachability Problems - 3rd
International Workshop (RP’09). Vol. 5797. Lecture Notes in Computer Science. Springer,
2009, pp. 1–2.
[Asa12]
Eugene Asarin. “Measuring Information in Timed Languages.” Proceedings of Language and Automata Theory and Applications - 6th International Conference (LATA’12).
[BDES12]
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data.”
Proceedings of Verification, Model Checking, and Abstract Interpretation - 13th International Conference (VMCAI’12). Vol. 7148. Lecture Notes in Computer Science. Springer,
2012, pp. 1–22.
[BHJS07]
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu. “Rewriting Systems
with Data.” Proceedings of Fundamentals of Computation Theory - 16th International
Symposium (FCT’07). Vol. 4639. Lecture Notes in Computer Science. Springer, 2007,
pp. 1–22.
[Bou07a]
Ahmed Bouajjani. “Automata-based techniques for shape analysis”. International Symposium on Automatic Heap Analysis (AHA 2007). 2007.
[Bou07b]
Ahmed Bouajjani. “Automata-based techniques for the Verification of Programs with
Linked Data Structures”. International Workshop on Heap Analysis and Verification (HAV
2007). 2007.
[Bou08]
Ahmed Bouajjani. “Rewriting systems with data: a framework for reasoning about unbounded networks of infinite-state processes”. International Workshop on Rewriting Logic
and its Applications (WRLA 2008). 2008.
[Bou12]
Ahmed Bouajjani. “Checking state reachability for weak memory models”. International
Workshop on Memory Consistency Models (REORDER 2012). 2012.
[Lar07]
François Laroussinie. “Alternating-time Temporal Logic: Expressivity, Complexity, Extensions”. International Workshop on Expressiveness in Concurrency (EXPRESS 2007).
2007.
Publications [CH08a; CH08b; CHMOS08] are joint with the AA team, publication [CDGFS11] is joint
with the ADG team, and publication [ACYFV10] is joint with PPS laboratory.
253
[AAGILS07]
Yasmina Abdeddaı̈m, Eugene Asarin, Matthieu Gallien, Félix Ingrand, Charles Lesire,
Mihaela Sighireanu. “Planning Robust Temporal Plans: A Comparison Between CBTP
and TGA Approaches.” Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS’07). AAAI, 2007, pp. 2–9.
[AAS09]
Yasmina Abdeddaı̈m, Eugene Asarin, Mihaela Sighireanu. “Simple Algorithm for Simple
Timed Games.” Proceedings of the 16th International Symposium on Temporal Representation and Reasoning (TIME’09). IEEE Computer Society, 2009, pp. 99–106.
[ABBDP12] Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin.
“Toward Timed Theory of Codes.” Proceedings of Formal Modeling and Analysis of Timed
Systems - 10th International Conference (FORMATS’12). Lecture Notes in Computer Science. Springer, 2012.
[ABBM10] Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi.
“On the verification problem for weak memory models.” Proceedings of the 37th ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’10).
ACM, 2010, pp. 7–18.
[ABBM12]
Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi.
“What’s Decidable about Weak Memory Models?” Proceedings of Programming Languages and Systems - 21st European Symposium on Programming (ESOP’12). Vol. 7211.
[ABCHR08]
Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza,
Ahmed Rezine. “Monotonic Abstraction for Programs with Dynamic Memory Heaps.”
Proceedings of Computer Aided Verification - 20th International Conference (CAV’08).
[ABDP12]
Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin. “Generating Functions
of Timed Languages.” Mathematical Foundations of Computer Science - 37th International Symposium (MFCS’12). Lecture Notes in Computer Science. Springer, 2012.
[ABEL12]
Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, Akash Lal. “Detecting Fair
Non-termination in Multithreaded Programs”. Proceedings of Computer Aided Verification - 24th International Conference (CAV 2012). Vol. 7358. Lecture Notes in Computer
[ABH08]
Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl. “Emptiness of Multi-pushdown
Automata Is 2ETIME-Complete.” Proceedings of Developments in Language Theory 12th International Conference (DLT’08). Vol. 5257. Lecture Notes in Computer Science.
Springer, 2008, pp. 121–133.
[ABHKV08a] Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holı́k, Lisa Kaati, Tomás Vojnar. “Composed Bisimulation for Tree Automata.” Proceedings of Implementation and Applications
of Automata - 13th International Conference (CIAA’08). Vol. 5148. Lecture Notes in Computer Science. Springer, 2008, pp. 212–222.
[ABHKV08b] Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holı́k, Lisa Kaati, Tomás Vojnar.
“Computing Simulations over Tree Automata.” Proceedings of Tools and Algorithms for
the Construction and Analysis of Systems - 14th International Conference (TACAS’08).
[ABKS12]
Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan. “LinearTime Model-Checking for Multithreaded Programs under Scope-Bounding”. Proceedings
of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA 2012). Vol. 7561. Lecture Notes in Computer Science. Springer, 2012.
254
[ABP11]
Mohamed Faouzi Atig, Ahmed Bouajjani, Gennaro Parlato. “Getting Rid of Store-Buffers
in TSO Analysis.” Proceedings of Computer Aided Verification - 23rd International Conference (CAV’11). Vol. 6806. Lecture Notes in Computer Science. Springer, 2011, pp. 99–
115.
[ABQ09]
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer. “Context-Bounded Analysis for
Concurrent Programs with Dynamic Creation of Threads.” Proceedings of Tools and Algorithms for the Construction and Analysis of Systems - 15th International Conference
(TACAS’09). Vol. 5505. Lecture Notes in Computer Science. Springer, 2009, pp. 107–123.
[ABT08a]
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili. “Analyzing Asynchronous Programs with Preemption.” Proceedings of IARCS Annual Conference on Foundations of
Software Technology and Theoretical Computer Science (FSTTCS’08). Vol. 2. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2008, pp. 37–48.
[ABT08b]
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili. “On the Reachability Analysis
of Acyclic Networks of Pushdown Systems.” Proceedings of Concurrency Theory - 19th
International Conference (CONCUR’08). Vol. 5201. Lecture Notes in Computer Science.
Springer, 2008, pp. 356–371.
[ACSTL07] Eugene Asarin, Thierry Cachat, Alexander Seliverstov, Tayssir Touili, Vassily A. Lyubetsky. “Attenuation Regulation as a Term Rewriting System.” Proceedings of Algebraic Biology, Second International Conference (AB’07). Vol. 4545. Lecture Notes in Computer
[ACYFV10] Eugene Asarin, Raphaël Chane-Yack-Fa, Daniele Varacca. “Fair Adversaries and Randomization in Two-Player Games.” Proceedings of Foundations of Software Science and
Computational Structures - 13th International Conference (FOSSACS’10). Vol. 6014. Lecture Notes in Computer Science. Springer, 2010, pp. 64–78.
[AD09a]
Eugene Asarin, Aldric Degorre. “Volume and Entropy of Regular Timed Languages: Analytic Approach.” Proceedings of Formal Modeling and Analysis of Timed Systems - 7th
International Conference (FORMATS’09). Vol. 5813. Lecture Notes in Computer Science.
Springer, 2009, pp. 13–27.
[AD09b]
Eugene Asarin, Aldric Degorre. “Volume and Entropy of Regular Timed Languages: Discretization Approach.” Proceedings of Concurrency Theory - 20th International Conference (CONCUR’09). Vol. 5710. Lecture Notes in Computer Science. Springer, 2009,
pp. 69–83.
[AD10a]
Eugene Asarin, Aldric Degorre. “Two Size Measures for Timed Languages.” Proceedings
of IARCS Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS’10). Vol. 8. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer
[ADMN12]
Eugene Asarin, Alexandre Donzé, Oded Maler, Dejan Nickovic. “Parametric Identification of Temporal Properties.” Proceedings of Runtime Verification - 2nd International Conference (RV’11). Vol. 7186. Lecture Notes in Computer Science. Springer, 2012.
[ADMT10] Eugene Asarin, Thao Dang, Oded Maler, Romain Testylier. “Using Redundant Constraints for Refinement.” Proceedings of Automated Technology for Verification and Analysis - 8th International Symposium (ATVA’10). Vol. 6252. Lecture Notes in Computer Science. Springer, 2010, pp. 37–51.
255
[ADR09a]
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine. “Approximated ContextSensitive Analysis for Parameterized Verification.” Proceedings of Formal Techniques for
Distributed Systems - Joint 11th IFIP WG 6.1 International Conference (FMOODS’09)
and 29th IFIP WG 6.1 International Conference (FORTE’09). Vol. 5522. Lecture Notes in
[ADR09c]
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine. “Automatic Verification of
Directory-Based Consistency Protocols.” Proceedings of Reachability Problems - 3rd International Workshop (RP’09). Vol. 5797. Lecture Notes in Computer Science. Springer,
2009, pp. 36–50.
[ADRST11]
Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo
Traverso. “On the Verification of Timed Ad Hoc Networks.” Proceedings of Formal Modeling and Analysis of Timed Systems - 9th International Conference (FORMATS’11).
[AH09]
Mohamed Faouzi Atig, Peter Habermehl. “On Yen’s Path Logic for Petri Nets.” Proceedings of Reachability Problems - 3rd International Workshop (RP’09). Vol. 5797. Lecture
[AT09]
Mohamed Faouzi Atig, Tayssir Touili. “Verifying Parallel Programs with Dynamic Communication Structures.” Proceedings of Implementation and Applications of Automata 14th International Conference (CIAA’09). Vol. 5642. Lecture Notes in Computer Science.
Springer, 2009, pp. 145–154.
[Ati10a]
Mohamed Faouzi Atig. “From Multi to Single Stack Automata.” Proceedings of Concurrency Theory - 21th International Conference (CONCUR’10). Vol. 6269. Lecture Notes in
[Ati10b]
Mohamed Faouzi Atig. “Global Model Checking of Ordered Multi-Pushdown Systems.”
Proceedings of IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science (FSTTCS’10). Vol. 8. LIPIcs. Schloss Dagstuhl - LeibnizZentrum fuer Informatik, 2010, pp. 216–227.
[BA11]
Nicolas Basset, Eugene Asarin. “Thin and Thick Timed Regular Languages.” Proceedings
of Formal Modeling and Analysis of Timed Systems - 9th International Conference (FORMATS’11). Vol. 6919. Lecture Notes in Computer Science. Springer, 2011, pp. 113–128.
[BDERS10] Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Ahmed Rezine, Mihaela Sighireanu.
“Invariant Synthesis for Programs Manipulating Lists with Unbounded Data.” Proceedings of Computer Aided Verification - 22nd International Conference (CAV’10). Vol. 6174.
[BDES09]
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. “A Logic-Based
Framework for Reasoning about Composite Data Structures.” Proceedings of Concurrency
Theory - 20th International Conference (CONCUR’09). Vol. 5710. Lecture Notes in Computer Science. Springer, 2009, pp. 178–195.
[BDES11]
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu. “On interprocedural analysis of programs with lists and data.” Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’11).
ACM, 2011, pp. 578–589.
[BDKSS12]
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath.
“On the Decidability Status of Reachability and Coverability in Graph Transformation Systems”. RTA. Vol. 15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012,
pp. 101–116.
256
[BE12a]
Ahmed Bouajjani, Michael Emmi. “Analysis of recursively parallel programs.” Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’12). ACM, 2012, pp. 203–214.
[BE12b]
Ahmed Bouajjani, Michael Emmi. “Bounded Phase Analysis of Message-Passing Programs.” Proceedings of Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference (TACAS’12). Vol. 7214. Lecture Notes in Computer
[BEP11]
Ahmed Bouajjani, Michael Emmi, Gennaro Parlato. “On Sequentializing Concurrent Programs.” Proceedings of Static Analysis - 18th International Symposium (SAS’11).
[BESS08]
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Dejvuth Suwimonteerabuth. “SDSIrep: A Reputation System Based on SDSI.” Proceedings of Tools and Algorithms for
[BFQ07]
Ahmed Bouajjani, Séverine Fratani, Shaz Qadeer. “Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures.” Proceedings of Computer Aided
Verification - 19th International Conference (CAV’07). Vol. 4590. Lecture Notes in Computer Science. Springer, 2007, pp. 207–220.
[BGH09]
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl. “Realizability of Concurrent
Recursive Programs.” Proceedings of Foundations of Software Science and Computational
Structures - 12th International Conference (FOSSACS’09). Vol. 5504. Lecture Notes in
[BHHTV08] Ahmed Bouajjani, Peter Habermehl, Lukás Holı́k, Tayssir Touili, Tomás Vojnar.
“Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree
Automata.” Proceedings of Implementation and Applications of Automata - 13th International Conference (CIAA’08). Vol. 5148. Lecture Notes in Computer Science. Springer,
2008, pp. 57–67.
[BHIKV09]
Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar. “Automatic
Verification of Integer Array Programs.” Proceedings of Computer Aided Verification 21st International Conference (CAV’09). Vol. 5643. Lecture Notes in Computer Science.
Springer, 2009, pp. 157–172.
[BHKL09]
Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker. “Angluin-Style Learning of NFA.” Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI’09). 2009, pp. 1004–1009.
[BJS07]
Ahmed Bouajjani, Yan Jurski, Mihaela Sighireanu. “A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes.” Proceedings of Tools and Algorithms for the Construction and Analysis of Systems - 13th International Conference
(TACAS’07). Vol. 4424. Lecture Notes in Computer Science. Springer, 2007, pp. 690–705.
[BLLM09]
Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey. “ATL
with Strategy Contexts and Bounded Memory.” Proceedings of Logical Foundations of
Computer Science, International Symposium (LFCS’09). Vol. 5407. Lecture Notes in Computer Science. Springer, 2009, pp. 92–106.
[BLMO07]
Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby. “Timed Concurrent Game Structures.” Proceedings of Concurrency Theory - 18th International Conference (CONCUR’07). Vol. 4703. Lecture Notes in Computer Science. Springer, 2007,
pp. 445–459.
257
[BMM11]
Ahmed Bouajjani, Roland Meyer, Eike Möhlmann. “Deciding Robustness against Total
Store Ordering.” Proceedings of Automata, Languages and Programming - 38th International Colloquium (ICALP’11). Vol. 6756. Lecture Notes in Computer Science. Springer,
2011, pp. 428–440.
[Cac07]
Thierry Cachat. “Tree Automata Make Ordinal Theory Easy.” Algorithmic-Logical Theory of Infinite Structures. Vol. 07441. Dagstuhl Seminar Proceedings. Internationales
Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany,
2007.
[CCGP11]
Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato. “A Tabu Search
Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.” Proceedings of Network Optimization - 5th International Conference (INOC’11). Vol. 6701.
[CDGFS11]
Julien Clément, Carole Delporte-Gallet, Hugues Fauconnier, Mihaela Sighireanu.
“Guidelines for the Verification of Population Protocols.” Proceedings of the International Conference on Distributed Computing Systems (ICDCS’11). IEEE Computer Society, 2011, pp. 215–224.
[CG10]
Patrick Cégielski, Irène Guessarian. “Normalization of Some Extended Abstract State Machines.” Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Vol. 6300. Lecture Notes in Computer Science. Springer, 2010,
pp. 165–180.
[CH08a]
Julien Cristau, Florian Horn. “Graph Games on Ordinals.” Proceedings of IARCS Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS’08). Vol. 2. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2008,
pp. 143–154.
[CH08b]
Julien Cristau, Florian Horn. “On Reachability Games of Ordinal Length.” Proceedings of
Theory and Practice of Computer Science - 34th Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM’08). Vol. 4910. Lecture Notes in Computer
[CHH11]
Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn. “The Complexity of RequestResponse Games.” Proceedings of Language and Automata Theory and Applications 5th International Conference (LATA’11). Vol. 6638. Lecture Notes in Computer Science.
Springer, 2011, pp. 227–237.
[CHL10]
Krishnendu Chatterjee, Florian Horn, Christof Löding. “Obliging Games.” Proceedings of
Concurrency Theory - 21th International Conference (CONCUR’10). Vol. 6269. Lecture
[CHMOS08]
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre. “Winning Regions of Higher-Order Pushdown Games.” Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS’08). IEEE Computer Society,
2008, pp. 193–204.
[Dav08]
Claire David. “Complexity of Data Tree Patterns over XML Documents”. Proceedings
of Mathematical Foundations of Computer Science 2008, 33rd International Symposium
(MFCS’08). Vol. 5162. Lecture Notes in Computer Science. Springer, 2008, pp. 278–289.
[DDHL09]
Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore. “SelfStabilizing k-out-of-l exclusion on tree networks.” Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS’09). IEEE, 2009, pp. 1–
8.
258
[DDS12]
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier. “Taming Past LTL and Flat Counter
Systems”. Proceedings of the 6th International Joint Conference on Automated Reasoning
(IJCAR’12). Vol. 7634. Lecture Notes in Artificial Intelligence. Springer, 2012.
[DGH10]
Antoine Durand-Gasselin, Peter Habermehl. “On the Use of Non-deterministic Automata
for Presburger Arithmetic.” Proceedings of Concurrency Theory - 21th International Conference (CONCUR’10). Vol. 6269. Lecture Notes in Computer Science. Springer, 2010,
pp. 373–387.
[DGH12]
Antoine Durand-Gasselin, Peter Habermehl. “Ehrenfeucht-Fraı̈ssé goes elementarily automatic for structures of bounded degree.” Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS’12). Vol. 14. LIPIcs. Schloss
[DSZ11]
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro. “On the Power of Cliques in the
Parameterized Verification of Ad Hoc Networks.” Proceedings of Foundations of Software
Science and Computational Structures - 14th International Conference (FOSSACS’11).
[DSZ12]
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro. “Verification of Ad Hoc Networks with Node and Communication Failures”. FMOODS/FORTE. Vol. 7273. Lecture
[EQR11]
Michael Emmi, Shaz Qadeer, Zvonimir Rakamaric. “Delay-bounded scheduling.” Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming
Languages (POPL’11). ACM, 2011, pp. 411–422.
[FGO12]
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj. “Deciding the Value 1 Problem for Probabilistic Leaktight Automata”. Proceedings of the Twenty-Seventh Annual
ACM/IEEE Symposium on Logic in Computer Science (LICS’12). ACM SIGACT, IEEE
Computer Society, 2012.
[GH08a]
Hugo Gimbert, Florian Horn. “Simple Stochastic Games with Few Random Vertices Are
Easy to Solve.” Proceedings of Foundations of Software Science and Computational Structures - 11th International Conference (FOSSACS’08). Vol. 4962. Lecture Notes in Computer Science. Springer, 2008, pp. 5–19.
[GH08b]
Hugo Gimbert, Florian Horn. “Solving Simple Stochastic Games.” Proceedings of Logic
and Theory of Algorithms - 4th Conference on Computability in Europe (CiE’08).
[GH10]
Hugo Gimbert, Florian Horn. “Solving Simple Stochastic Tail Games.” Proceedings of the
Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’10). SIAM,
2010, pp. 847–862.
[GM07]
Paul Gastin, Pierre Moro. “Minimal Counterexample Generation for SPIN.” Proceedings
of Model Checking Software - 14th International SPIN Workshop (SPIN’07). Vol. 4595.
[HHRSV11] Peter Habermehl, Lukás Holı́k, Adam Rogalewicz, Jirı́ Simácek, Tomás Vojnar. “Forest
Automata for Verification of Heap Manipulation.” Proceedings of Computer Aided Verification - 23rd International Conference (CAV’11). Vol. 6806. Lecture Notes in Computer
[HIRV07]
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar. “Proving Termination of
Tree Manipulating Programs.” Proceedings of Automated Technology for Verification and
Analysis - 5th International Symposium (ATVA’07). Vol. 4762. Lecture Notes in Computer
259
[HIV08a]
Peter Habermehl, Radu Iosif, Tomás Vojnar. “A Logic of Singly Indexed Arrays.” Proceedings of Logic for Programming, Artificial Intelligence, and Reasoning - 15th International
Conference (LPAR’08). Vol. 5330. Lecture Notes in Computer Science. Springer, 2008,
pp. 558–573.
[HIV08b]
Peter Habermehl, Radu Iosif, Tomás Vojnar. “What Else Is Decidable about Integer Arrays?.” Proceedings of Foundations of Software Science and Computational Structures 11th International Conference (FOSSACS’08). Vol. 4962. Lecture Notes in Computer Science. Springer, 2008, pp. 474–489.
[HMO10]
Jochen Hoenicke, Roland Meyer, Ernst-Rüdiger Olderog. “Kleene, Rabin, and Scott Are
Available.” Proceedings of Concurrency Theory - 21th International Conference (CONCUR’10). Vol. 6269. Lecture Notes in Computer Science. Springer, 2010, pp. 462–477.
[HMW10]
Peter Habermehl, Roland Meyer, Harro Wimmel. “The Downward-Closure of Petri Net
Languages.” Proceedings of Automata, Languages and Programming - 37th International
pp. 466–477.
[Hor07b]
Florian Horn. “Faster Algorithms for Finitary Games.” Proceedings of Tools and Algorithms for the Construction and Analysis of Systems - 13th International Conference
(TACAS’07). Vol. 4424. Lecture Notes in Computer Science. Springer, 2007, pp. 472–
484.
[Hor08]
Florian Horn. “Explicit Muller Games are PTIME.” Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS’08). Vol. 2. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2008,
pp. 235–243.
[HTW08]
Florian Horn, Wolfgang Thomas, Nico Wallmeier. “Optimal Strategy Synthesis in
Request-Response Games.” Proceedings of Automated Technology for Verification and
Analysis - 6th International Symposium (ATVA’08). Vol. 5311. Lecture Notes in Computer
[KLTR09]
Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps. “A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks.” Proceedings of Model Checking Software - 16th International SPIN Workshop (SPIN’09).
[KM09]
Victor Khomenko, Roland Meyer. “Checking pi-Calculus Structural Congruence is Graph
Isomorphism Complete.” Proceedings of the Ninth International Conference on Application of Concurrency to System Design (ACSD’09). IEEE Computer Society, 2009, pp. 70–
79.
[LKRT07]
Akash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili. “Abstract Error Projection.”
Proceedings of Static Analysis - 14th International Symposium (SAS’07). Vol. 4634. Lecture Notes in Computer Science. Springer, 2007, pp. 200–217.
[LLM10]
Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey. “ATL with Strategy Contexts: Expressiveness and Model Checking.” Proceedings of IARCS Annual Conference
on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’10).
Vol. 8. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010, pp. 120–132.
[LLM12]
Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey. “Quantified CTL: expressiveness and model checking.” Proceedings of Concurrency Theory - 23nd International
Conference (CONCUR’12). Lecture Notes in Computer Science. Springer, 2012.
260
[LMM08]
Nutan Limaye, Meena Mahajan, Antoine Meyer. “On the Complexity of Membership and
Counting in Height-Deterministic Pushdown Automata.” Proceedings of Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia (CSR’08). Vol. 5010. Lecture Notes in Computer Science. Springer, 2008, pp. 240–
251.
[LMP10a]
François Laroussinie, Antoine Meyer, Eudes Petonnet. “Counting CTL.” Proceedings of
Foundations of Software Science and Computational Structures - 13th International Conference (FOSSACS’10). Vol. 6014. Lecture Notes in Computer Science. Springer, 2010,
pp. 206–220.
[LMP10b]
François Laroussinie, Antoine Meyer, Eudes Petonnet. “Counting LTL.” Proceedings of
the 17th International Symposium on Temporal Representation and Reasoning (TIME’10).
IEEE Computer Society, 2010, pp. 51–58.
[LS10]
Sébastien Labbé, Arnaud Sangnier. “Formal Verification of Industrial Software with Dynamic Memory Management.” Proceedings of the 16th IEEE Pacific Rim International
Symposium on Dependable Computing (PRDC’10). IEEE Computer Society, 2010, pp. 77–
84.
[LTKR08]
Akash Lal, Tayssir Touili, Nicholas Kidd, Thomas W. Reps. “Interprocedural Analysis of
Concurrent Programs Under a Context Bound.” Proceedings of Tools and Algorithms for
[Mey07]
Antoine Meyer. “Traces of Term-Automatic Graphs.” Proceedings of Mathematical Foundations of Computer Science 2007, 32nd International Symposium (MFCS’07). Vol. 4708.
[MG09]
Roland Meyer, Roberto Gorrieri. “On the Relationship between π-Calculus and Finite
Place/Transition Petri Nets.” Proceedings of Concurrency Theory - 20th International
Conference (CONCUR’09). Vol. 5710. Lecture Notes in Computer Science. Springer,
2009, pp. 463–480.
[MP11]
P. Madhusudan, Gennaro Parlato. “The tree width of auxiliary storage.” Proceedings of
the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
(POPL’11). ACM, 2011, pp. 283–294.
[MPQ11]
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu. “Decidable logics combining heap structures and data.” Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’11). ACM, 2011, pp. 611–622.
[MS10]
Roland Meyer, Tim Strazny. “Petruchio: From Dynamic Networks to Nets.” Proceedings
of Computer Aided Verification - 22nd International Conference (CAV’10). Vol. 6174. Lecture Notes in Computer Science. Springer, 2010, pp. 175–179.
[PST07]
Gaël Patin, Mihaela Sighireanu, Tayssir Touili. “Spade: Verification of Multithreaded Dynamic and Recursive Programs.” Proceedings of Computer Aided Verification - 19th International Conference (CAV’07). Vol. 4590. Lecture Notes in Computer Science. Springer,
2007, pp. 254–257.
[SS07]
Mathias Samuelides, Luc Segoufin. “Complexity of Pebble Tree-Walking Automata.”
Proceedings of Fundamentals of Computation Theory - 16th International Symposium
(FCT’07). Vol. 4639. Lecture Notes in Computer Science. Springer, 2007, pp. 458–469.
[ST11]
Fu Song, Tayssir Touili. “Efficient CTL Model-Checking for Pushdown Systems.” Proceedings of Concurrency Theory - 22nd International Conference (CONCUR’11).
261
[ST12a]
Fu Song, Tayssir Touili. “Efficient Malware Detection using Model Checking.” 18th international symposium on Formal Methods (FM 2012). 2012.
[ST12b]
Fu Song, Tayssir Touili. “PuMoC: A CTL Model-Checker For Sequential Programs.” 27th
IEEE/ACM International Conference On Automated Software Engineering (ASE 2012).
2012.
[ST12c]
Fu Song, Tayssir Touili. “Pushdown Model Checking for Malware Detection.” Proceedings of Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference (TACAS’12). Vol. 7214. Lecture Notes in Computer Science. Springer,
2012, pp. 110–125.
[Tou09]
Tayssir Touili. “Constrained Reachability of Process Rewrite Systems.” Proceedings of
Theoretical Aspects of Computing - 6th International Colloquium (ICTAC’09). Vol. 5684.
C-ACTWI : International workshop proceedings
[ADR08]
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine. “Monotonic Abstraction in Parameterized Verification.” Workshop on Reachability Problems in Computational Models,
Electr. Notes Theor. Comput. Sci. 223 (2008), pp. 3–14.
[BDJS09]
Ahmed Bouajjani, Cezara Dragoi, Yan Jurski, Mihaela Sighireanu. “Rewriting Systems
over Nested Data Words.” Proceedings of the Annual Doctoral Workshop on Mathematical
and Engineering Methods in Computer Science (MEMICS’09). Vol. 13. OASICS. Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009.
[BST07]
Ahmed Bouajjani, Jan Strejcek, Tayssir Touili. “On Symbolic Verification of Weakly Extended PAD.” EXPRESS Workshop, Electr. Notes Theor. Comput. Sci. 175.3 (2007),
pp. 47–64.
[RNRT09]
Narjes Ben Rajeb, Brahim Nasraoui, Riadh Robbana, Tayssir Touili. “Verifying Multithreaded Recursive Programs with Integer Variables.” Infinity 2008, Electr. Notes Theor.
Comput. Sci. 239 (2009), pp. 143–154.
[ST09]
Mihaela Sighireanu, Tayssir Touili. “Bounded Communication Reachability Analysis of
Process Rewrite Systems with Ordered Parallelism.” Infinity 2006, Electr. Notes Theor.
Comput. Sci. 239 (2009), pp. 43–56.
C-COM : Talks at conferences without proceedings or upon-invitation-only meetings
Dagstuhl Seminar 08171 Beyond the Finite: New Challenges in Verification and Semistructured Data,
April 2008. Ahmed Bouajjani (Tutorial on Parametrized Verification).
Dagstuhl Seminar 09301 Typing, Analysis and Verification of Heap-Manipulating Programs, July
2009. Ahmed Bouajjani (A logic for reasoning about programs with composite data structures)
and Peter Habermehl (Verifying programs with arrays).
Dagstuhl Seminar 10252 Game Semantics and Program Verification, June 2010. Peter Habermehl
(Regular Model Checking).
Dagstuhl Seminar 11011 Multi-Core Memory Models and Concurrency Theory, January 2011.
Ahmed Bouajjani and Mohamed Faouzi Atig (Context-bounded analysis of programs with dynamic thread creation).
Mysore Park Workshop The Chemistry of Concurrent and Distributed Programming, Infosys campus,
Mysore, India, February 2011. Ahmed Bouajjani (Verifying programs under the TSO memory
model).
262
CP meets CAV Constraint Programming meets Computer Aided Program Verification, Turunç, Turkey,
June 2012. Ahmed Bouajjani (Tutorial on Symbolic Model Checking), Constantin Enea (Abstract constraint domains for heap manipulating programs analysis), and Peter Habermehl (Parikh
images of languages).
[BC10]
Ahmed Bouajjani, Wei-Ngan Chin, eds. Proceedings of Automated Technology for Verification and Analysis - 8th International Symposium, (ATVA’10). Springer, 2010.
[BHZ12]
Ahmed Bouajjani, David Harel, Lenore D. Zuck. “Editor’s foreword.” J. Comput. Syst. Sci.
78.3 (2012), p. 822.
[BM09]
Ahmed Bouajjani, Oded Maler, eds. Proceedings of Computer Aided Verification - 21st
International Conference (CAV’09). Springer, 2009.
[GL10]
Paul Gastin, François Laroussinie, eds. Proceedings of Concurrency Theory - 21th International Conference (CONCUR’10). Springer, 2010.
[HV09]
Peter Habermehl, Tomás Vojnar. “Preface.” Joint Proceedings INFINITY 2006, 2007,
2008, Electr. Notes Theor. Comput. Sci. 239 (2009), pp. 1–3.
[TCJ10]
Tayssir Touili, Byron Cook, Paul Jackson, eds. Proceedings of Computer Aided Verification - 22nd International Conference (CAV’10). Springer, 2010.
[Tou12a]
Tayssir Touili, ed. CAV 2010 Special Issue. Vol. 40. 2. Formal Methods in System Design.
Springer, 2012.
COS : Chapters in scientific works
[ABE12]
Rajeev Alur, Ahmed Bouajjani, Javier Esparza. “Model Checking Procedural Programs”.
Handbook of Model Checking (2012). Ed. by Edmund Clarke, Thomas Henzinger, and
Helmut Veith. to appear.
[CGV11]
Patrick Cégielski, Irène Guessarian, Jean-Marc Vincent. “Algorithmique”. Introduction à
la Science Informatique. 2011, pp. 139–186.
[GKQT12]
Aarti Gupta, Vineet Kahlon, Shaz Qadeer, Tayssir Touili. “Model Checking Concurrent
Programs”. Handbook of Model Checking (2012). Ed. by Edmund Clarke, Thomas Henzinger, and Helmut Veith. to appear.
263
264
Chapter 6
6.1
Responsible : Ahmed Bouajjani
6.1.1
6.1.1.1
List of current members
Permanent staff (2012)
Table 6.1: List of permanent members
Eugène Asarin
Ahmed Bouajjani
Aldric Degorre
Constantin Enea
Irène Guessarian
Peter Habermehl
Florian Horn
Yan Jurski
François Laroussinie
Arnaud Sangnier
Mihaela Sighireanu
Tayssir Touili
6.1.1.2
Pr U P7
Pr U P7
MdC U P7
MdC U P7
Pr Emeritus U P6
MdC HDR U P7
CR CNRS
MdC U P7
Pr U P7
MdC U P7
MdC U P7
CR HDR CNRS
PhD students and Post-doctoral researchers (2012)
PhD students:
• Nicolas Basset. AMN grant. Univ. Paris-Est Marne-la-Vallée. Director: Eugène Asarin, codirected with Dominique Perrin (LIGM).
• Amit Dhar. Univ. Paris Diderot grant. Director: Arnaud Sangnier, co-directed with Stéphane
Demri (LSV).
• Antoine Durant-Gasselin. AMN grant. Univ Paris Diderot. Directors: Ahmed Bouajjani and Peter
Habermehl.
• Jad Hamza. AMN grant. Univ. Paris Diderot. Directors: Ahmed Bouajjani and Constantin Enea.
• Eudes Petonnet. AMN grant. Univ. Paris Diderot. Director: François Laroussinie.
265
CHAPTER 6. APPENDIX: MODELING AND VERIFICATION
• Fu Song. ANR grant (BinCOA ANR project). Univ. Paris Diderot. Director: Tayssir Touili.
Post-doctoral researcher: Michael Emmi (10/2010-09/2013)
6.1.2
6.1.2.1
Former members
• Thierry Cachat, MdC U P7 since Sept 2004. On leave since Sept 2008.
• Antoine Meyer, MdC U P7. Sept 2006–Aug 2009. Moved to LIGM, Univ Paris-Est Marne-laVallée.
6.1.2.2
PhD and Post-doc researchers (2007-2011)
PhD students:
• Mohamed Faouzi Atig, Oct 2006 – June 2010. Dir: A. Bouajjani and T. Touili. Post-doc at
University of Uppsala (Sweden), group of Parosh Abdulla.
• Claire David, Oct 2005 – Mai 2009. Dir: Anca Muscholl. MdC Univ Paris-Est Marne-la-Vallée.
• Cezara Dragoi, Nov 2007 – Nov 2011. Dir: A. Bouajjani and M. Sighireanu. Post-doc at IST
Austria, group of Thomas Henzinger.
• Florian Horn, Sept 2004 – Nov 2008. Dir: Anca Muscholl. CNRS researcher, LIAFA.
• Pierre Moro, Oct 2003 – Feb 2008. Dir: A. Bouajjani and P. Habermehl. Research engineer,
EADS Astrium.
• Mathias Samuelides, Sept 2003 – Dec 2007. Dir: Anca Muscholl.
Post-docs:
• Séverine Fratani, Sept 2006 – August 2007 (MdC Univ. de Provence, LIF)
• Constantin Enea, Jan 2008 – August 2009 (MdC Univ Paris Diderot, LIAFA)
• Ahmed Rezine, May 2008 – August 2009 (Assistant Professor, Univ Linköping, Sweden)
• Roland Meyer, March 2009 – June 2010 (Junior-Professor, Univ Kaiserslautern, Gernany)
• Gennaro Parlato, April 2010 – May 2011 (Lecturer, Univ Southampton, UK)
6.1.2.3
Long stay visitors (2007-2011)
• Thomas Reps, Pr University of Wisconsin at Madison, Sept 2007 – Aug 2008
• Susan Horwitz, Pr University of Wisconsin at Madison, Sept 2007 – Aug 2008
• Nicholas Kidd, PhD student, U Wisconsin-Madison, Sept 2008 – Aug 2008
• Akash Lal, PhD student, U Wisconsin-Madison, Jan 2008 – Aug 2008
• Junghee Lim, PhD student, U Wisconsin-Madison, Sept 2008 – Aug 2008
6.1.2.4
Master students and Interns (2007-2011)
M2 MPRI master students
• Nicolas Basset, 2009. Dir: Eugene Asarin.
• Raphaël Chane-Yack-Fa, 2008. Dir. Eugene Asarin.
• Amit Kumar Dhar, 2011. Dir: Arnaud Sangnier and Stéphane Demri (LSV).
• Antoine Durand-Gasselin, 2009. Dir: Peter Habermehl.
266
• Nathanaël Fijalkow, 2010. Dir: Florian Horn.
• Jad Hamza, 2011. Dir: Ahmed Bouajjani and Constantin Enea.
• Vlad Saveluc, 2012. Dir: Constantin Enea and Mihaela Sighireanu.
Interns
• Maria Abramiuc, 4 months, March-June, 2011
• Piotr Kordy, PhD student at the University of Twente (Netherlands), 4 months, Jan-April 2007
• Suneetha Nadella, 3 months, May-July 2010
• Eike Möhlmann, Master thesis student at University of Oldenburg (Germany), 6 months, Oct
2009-Jan 2010 and May-June 2010.
• Selma Saı̈di, 4 months, April-July 2007
• Asma Sghaier, 6 months, Master intern., Ecole Polytechnique de Tunis, February-July 2009
• Riccardo Traverso, PhD student at the Univesity of Genoa, 2 months, May-June 2012
• Vlad Seveluc, 4 months, March-June, 2011
6.1.3
•
•
•
•
•
•
•
•
•
•
•
Visitors
Parosh Abdulla (U Uppsala), several visits of 1 week.
Giorgio Delzanno (U Genoa), 2 months, 2011.
Javier Esparza (TU Munich), 1 week, 2010.
Martin Leucker (TU Munich), 1 month, 2007.
Vassily Lyubetsky (Moscou), 1 month 2009.
Shaz Qadeer (Microsoft Research, Redmond), 1 week, 2008.
Alexander Rabinovich (U Tel Aviv), 1 month, 2007.
Andrey Rybalchenko (TU Munich), 1 month, 2010.
Jeremy Sproston (U Torino), 1 month, 2012.
Serdar Tasiran (Koç Univ, Istanbul), 1 month, 2012.
Tomas Vojnar (TU Brno), several visits of 1 to 4 weeks.
6.1.4
6.1.4.1
Team organization
Sources of funding are:
• ANR: Several national collaboration projects (8 in total, coordination of 4 of them).
• 1 COST collaborative action.
• 7 bilateral cooperation projects.
• IUF: Financial support to F. Laroussinie.
• Fond. Sci. Math.: 1 two-year Post-doc position (Michael Emmi), and 1 Research master grant
(Vlad Saveluc).
• Doct. Dept. ENS Cachan: several PhD grants, currently 3 (A. Durand-Gasselin, Jad Hamza,
Eudes Petonnet) + 1 (Nicolas Basset at UMLV)
• Doctoral School UP7: 1 PhD grant (Amit Kumar Dhar)
The management of the resources is made by the responsible of each project, in agreement with the
head of the team. In normal time, (almost) every member of the team is involved in a funded project.
A solidarity principle is applied within the team which consists in using, as much as possible, available
resources to cover the needs of those who are not involved in a funded project.
267
6.1.4.2
Team activities
• The team is organized around three closely related research topics: (T1) Model checking, temporal
logics and synthesis, (T2) Timed and hybrid systems, and (T3) Program verification. The activities
in these axes are headed and organized respectively by F. Laroussinie, E. Asarin, and A. Bouajjani.
Most of the work in the team is carried out collegially within small collaborative groups.
• The MV team has a weekly seminar
http://www.liafa.univ-paris-diderot.fr/web9/manifsem/listmanifannee en.php?typecongres=4.
Talk an-
nouncements are broadly diffused in the area. The goal of this seminar is twofold:
The first goal is to attract talks by external researchers on recent work or tutorials by experts on
various topics of interest. For that, we have invited speakers on various topics such as
• Program analysis/verification/design: Jean-Christpohe Filliâtre, Klaus Havelund, Viktor
Kuncak, Rupak Majumdar, George Necula, Andreas Podelski, Shaz Qadeer, Xavier Rival,
Andrey Rybalchenko, Joseph Sifakis, Tom Reps, Viktor Vafeiadis, etc.,
• Automata/logic based verification, timed systems, infinite-state systems: Bernard Boigelot,
Stéphane Demri, Jean Goubault-Larrecq, Madavan Mukund, Markus Müller-Olm, Joel
Ouaknine, Alexander Rabinovitch, Jean-François Raskin, Jeremy Sproston, Mahech
Viswanathan, Thomas Wahl, James Worrell, etc.,
• Concurrent and distributed systems/algorithms: Hagit Attiya, Rachid Guerraoui, Marc
Shapiro, etc.
The second goal is to allow locals to expose their work and get feedback from other researchers
than their close collaborators, which contributes to the communication inside the team and its
cohesion. The first slot of each month is reserved to a local speaker.
• Students are encouraged to attend doctoral schools (e.g., MOVEP), and members of the team
are encouraged to attend at least once every year a major conference in our area such as CAV,
CONCUR, ETAPS, or POPL, even if they do not have a paper to present at that event. (For
instance, all students have been sent to ETAPS’12.)
• Students are also encouraged to visit other research groups. (For instance, Antoine DurandGasselin is visiting Rajeev Alur at U Penn for 4 months this year.) Students are closely supervised
and encouraged to defend their theses within 3 to 4 years. Six PhD theses have been defended.
• Assistant professors (MdC) and researchers (CR) are encouraged to develop a research project
and to present a Habilitation. Two Habilitations have been defended (P. Habermehl and T. Touili)
and one is in preparation (M. Sighireanu).
6.1.4.3
Services to the community and administrative responsibilities
• Deputy-director of the Doctoral School Mathematical Sciences of Paris (Ecole doctoral “Sciences Mathématiques de Paris Centre”) ED386, and responsible of the Computer Science section.
Ahmed Bouajjani, since January 2010.
• Deputy-director of the department of Computer Science (UFR d’Informatique) of the University
Paris Diderot. François Laroussinie, 2008–2012.
• Director of the department of Computer Science (UFR d’Informatique) of the University Paris
Diderot. François Laroussinie, since March 2012.
• Member of the Administration Council (Conseil d’Administration) of the University Paris
Diderot, from Sept 2005 to March 2009, and co-responsible of the Funding Commission (Commission des Moyens) devoted to the negotiation and the supervision of the budgets of the 18
components of the university, in 2007-2009. Mihaela Sighireanu.
268
• Responsible of the Computer Science program of the Engineering School of the University Paris
Diderot (EIDD), Eugène Asarin, since 2010.
• Responsible of the L2 (2nd year) of the Bachelor of Computer Science (Licence d’Informatique)
of the University of Paris Diderot. François Laroussinie, 2008–2012.
• Responsible of the M2 (5th year, master level), of the specialization “Critical Software” of the
Master of Computer Science of the University of Paris Diderot. Ahmed Bouajjani. 2004-2012.
6.2
6.2.1
Coordination of international projects
List of coordinated bilateral cooperation projects:
CMCU – Tunisie Title: Advanced Techniques for Software Verification. Coordinators: Tayssir Touili
and Riadh Robbana, Ecole Polytechnique de Tunis & Université de Tunis, 2006-2009.
REVERA – Moscou Title: Regulation of gene expression, evolution of regulation signals in bacteria:
Modeling and analysis using automatic verification methods. “Convention d’échanges” CNRS –
Russian Academy of Sciences. Coordinators: Eugene Asarin and Vassily Lyubetsky, Institute for
Information Transmission Problems, Moscou, 2008-2009.
PHC Barrande – Brno Title: Advanced Techniques for the Verification of Infinite-State Systems. Coordinators: Peter Habermehl and Tomas Vojnar, TU Brno (Czech Rep.), 2008-09.
PHC Procope – Münster Symbolic Analysis of Complex Features of Software. Coordinator: Tayssir
Touili and Markus Müller-Olm, University of Münster (Germany), 2006-09.
PHC Procope – Lübeck Title: LeMon – Learning Monitors for refactoring legacy systems. Coordinators: Peter Habermehl and Martin Leucker, University of Lübeck (Germany), 2012-13.
PHC Jules Verne Title: Algorithms and Formal Methods for Distributed Computing. Coordinators:
François Laroussinie and Luca Aceto, University of Reykjavik (Iceland), 2010-11.
6.2.2
Coordination of national projects
AVERILES (2006-2009). Type: RNTL (Réseau National en Technologies Logicielles). Title : Analysis of Embedded Systems with Dynamic Memory Structures. Partners : LIAFA, LSV, VERIMAG,
EDF. Coordinator: Peter Habermehl.
AVERISS (2007-2011). Type: ANR SETIN. Title : Automated Verification of Software Systems. Partners : LIAFA, LaBRI, LSV. Coordinator: Ahmed Bouajjani.
DOTS (2007-2011). Type: ANR SETIN. Title : Distributed Open Timed Systems. Partners : LIAFA,
IRCCyN, IRISA, LaBRI, LAMSADE, LSV. Coordinator: François Laroussinie.
EQINOCS (2012-2015). Type: ANR BLANC. Title: Entropy and quantity of information in models
of computational systems. (Entropie et quantité d’information dans les modèles des systèmes
computationnels). Partners: LIAFA, LACL, LIGM, VERIMAG. Coordinator: Eugène Asarin.
6.2.3
Collaboration projects:
COST action IC0901. Title: Rich-Model Toolkit - An Infrastructure for Reliable Computer Systems,
2009-2012. Responsible at LIAFA: Tayssir Touili. Coordinator: Viktor Kuncak (EPFL, Switzerland).
PHC Barrande – Brno Automata and Logics for Symbolic Software Verification. Participant: Peter
Habermehl. Coordinators: Adam Rogalewicz (TU Brno, Czech Rep.) et Radu Iosif (VERIMAG,
Grenoble).
269
CNRS LIA/LEA (Laboratoire International/Européen Associé):
INFINIS Franco-Argentinian intern. assoc. lab. Coordinators: Delia Kesner (Univ. Paris Diderot &
CNRS, PPS) and Sergio Yovine (Univ. Buenos Aires & Conicet). Members from MV: Eugene
Asarin and Ahmed Bouajjani.
STRUCO Franco-Czech europ. assoc. lab. Coordinators: Jean-Sébastien Sereni (Univ. Paris Diderot
& CNRS, LIAFA) & J. Nesetril (Charles University, Prague). Members from MV: Ahmed Bouajjani and Peter Habermehl.
INFORMEL Franco-Indian intern. assoc. lab. Coordinators: Paul Gastin (ENS Cachan & CNRS,
LSV) & M. Mukund (Chennai Math. Inst.). Associated members from MV: Ahmed Bouajjani
and Tayssir Touili.
6.2.4
Participation in national projects
AMAES (2006-2008). ANR ARA-SSIA. Title: Advanced Methods for Autonomous Embedded Systems. Responsible at LIAFA: Mihaela Sighireanu. Coordinator: Saddek Bensalem (VERIMAG).
BinCoA (2009-2012). ANR ARPEGE. Title: Binary Code Analysis. Responsible at LIAFA: Tayssir
Touili. Coordinator: Sébastien Bardin (CEA).
Veridyc (2010-2013). ANR SEGI. Title: Verification of Dynamic C Programs. Responsible at LIAFA:
Peter Habermehl. Coordinator: Radu Iosif (VERIMAG).
ImpRo (2011-2014)). ANR BLANC. Title: Implementability and robustness of timed systems. Responsible at LIAFA: François Laroussinie. Coordinator: Didier Lime (IRCCyN).
6.3
6.3.1
6.3.1.1
Editorial activities
Fundamenta Informaticae. Irène Guessarian
Formal Methods in System Design (FMSD). Ahmed Bouajjani
ISRN Software Engeneering. Tayssir Touili
Mathematical Structures in Computer Science (MSCS). Eugène Asarin
Techniques et Sciences Informatiques (TSI). François Laroussinie
6.3.1.2
Editor of special issues
Formal Methods in System Design (Springer). Special issue of the 21st Intern. Conf. on Computer
Aided Verification, 2009 (CAV’09). Volume 39, Number 3, December 2011. Ahmed Bouajjani,
co-edited with Oded Maler (VERIMAG).
Formal Methods in System Design (Springer). Special issue of the 22nd Intern. Conf. on Computer
Aided Verification, 2010 (CAV’10). Volume 40, Number 2, February 2012. Tayssir Touili.
Journal of Computer and System Sciences (Elsevier). Special issue in commemoration of Amir
Pnueli. Volume 78, Issue 3, May 2012. Ahmed Bouajjani, co-edited with David Harel (Weizmann Inst.) and Lenore Zuck (Univ. of Illinois).
6.3.2
6.3.2.1
Scientific management of conferences
FORMATS. International Conference on Formal Modelling and Analysis of Timed Systems. Eugène
Asarin, since 2007.
270
MOVEP. Ecole Jeunes Chercheurs Modélisation et Vérification de Processus Parallèles (School for
young researchers on Modeling and Verification of Parallel Processes). François Laroussinie,
2002-2011.
VECOS. International Workshop on Verification and Evaluation of Computer and Communication Systems. Tayssir Touili, since 2012.
6.3.2.2
Program committee chair (Intenational conferences)
CAV 2009 21st International Conference on Computer Aided Verification, Grenoble, July 2009.
Ahmed Bouajjani, co-chaired with Oded Maler (VERIMAG).
ATVA 2010 8th International Symposium on Automated Technology for Verification and Analysis, Singapore, September 2010. Ahmed Bouajjani, co-chaired with Wei-Ngan Chin (National Univ. of
Singapore).
CAV 2010 22nd International Conference on Computer Aided Verification, Edinburgh, UK, July 2010.
Tayssir Touili, co-chaired with Byron Cook (Microsoft Research Cambridge) and Paul Jackson
(Univ. Edinburgh).
CONCUR 2010 21th International Conference on Concurrency Theory, Paris, September 2010.
François Laroussinie, co-chaired with Paul Gastin (LSV).
6.3.2.3
Program committee chair (Intenational workshops)
INFINITY 2008 10th Intern. workshop on Verification of Infinite-State Systems, York, UK, August
2008. Peter Habermehl, co-chaired with Tomas Vojnar (TU Brno).
VECOS 2011 5th Intern. workshop on Verification and Evaluation of Computer and Communication
Systems, Tunis, September 2011. Tayssir Touili.
6.3.2.4
Workshops chair
FM 2012 18th International Symposium on Formal Methods, Paris, September 2012. Tayssir Touili,
co-chaired with Nihal Pekergin (LACL) and Laure Petrucci (LIPN).
VECOS 2011 5th Intern. workshop on Verification and Evaluation of Computer and Communication
Systems, Tunis, September 2011. Tayssir Touili, co-chaired with Nihal Pekergin (LACL).
6.3.2.5
International Conferences:
ATVA 2010 Intern. Symp. on Automated Technology for Verification and Analysis. Ahmed Bouajjani
(co-chair)
ATVA 2011 Ahmed Bouajjani.
CAV 2007 Intern. Conf. on Computer Aided Verification. Ahmed Bouajjani.
CAV 2008 Ahmed Bouajjani.
CAV 2009 Ahmed Bouajjani (co-chair) and Tayssir Touili.
CAV 2010 Ahmed Bouajjani and Tayssir Touili (co-chair).
CAV 2011 Tayssir Touili
CIAA 2009 Intern.l Conf. on Implementation and Application of Automata. Ahmed Bouajjani.
CONCUR 2009 Intern.l Conf. on Concurrency Theory. François Laroussinie.
CONCUR 2010 François Laroussinie (co-chair).
271
CONCUR 2011 Ahmed Bouajjani.
CSR 2007 Intern. Computer Science Symposium in Russia. Eugène Asarin.
FM 2012 Intern. Symp. on Formal Methods. Ahmed Bouajjani.
FORMATS 2007 Intern. Conf. on Formal Modelling and Analysis of Timed Systems. Eugène Asarin.
FORMATS 2008 Eugène Asarin.
FORMATS 2010 Eugène Asarin.
FOSSACS 2007 Intern. Conf. on Foundations of Software Science and Computation Structures.
Ahmed Bouajjani
FOSSACS 2011 François Laroussinie.
FOSSACS 2012 Eugène Asarin.
FSTTCS 2009 IARCS Annual Conference on Foundations of Software Technology and Theoretical
Computer Science. Peter Habermehl.
FSTTCS 2010 Ahmed Bouajjani.
GandALF 2010 Intern. Symp. on Games, Automata, Logics, and Formal Verification. Ahmed Bouajjani.
GandALF 2011 Tayssir Touili.
HSCC 2010 ACM Intern. Conf. on Hybrid Systems: Computation and Control. Eugène Asarin.
HSCC 2011 Eugène Asarin.
ICALP 2012 Intern. Colloquium on Automata, Languages and Programming. François Laroussinie.
LATA 2012 Intern. Conf. on Language and Automata Theory and Applications. Tayssir Touili.
LICS 2012 Intern. ACM/IEEE Symposium on Logic in Computer Science. Ahmed Bouajjani.
POPL 2010 ACM Intern. Symp. on Principles of Programming Languages. Tayssir Touili.
POPL (ERC) 2011 External Review Committee. Ahmed Bouajjani
POPL (ERC) 2013 External Review Committee. Michael Emmi
RTA 2012 Intern. Conf. on Rewriting Techniques and Applications. Ahmed Bouajjani
STACS 2007 Symposium on Theoretical Aspects of Computer Science. Eugène Asarin.
TACAS 2009 Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems.
Ahmed Bouajjani.
TACAS 2010 Tayssir Touili.
TACAS 2011 Ahmed Bouajjani and Peter Habermehl.
TASE 2011 Intern. Symp. on Theoretical Aspects of Software Engineering. Ahmed Bouajjani.
TCS 2012 IFIP Theoretical Computer Scicence. Ahmed Bouajjani.
TIME 2011 Intern. Symp. on Temporal Representation and Reasoning. Peter Habermehl.
VMCAI 2007-08 Intern. Conf. on Verification, Model Checking, and Abstract Interpretation. Tayssir
Touili.
VMCAI 2009 Ahmed Bouajjani.
VMCAI 2011 Ahmed Bouajjani.
VMCAI 2013 Michael Emmi.
VSTTE 2010 Verified Software: Theories, Tools and Experiments. Ahmed Bouajjani.
272
International Workshops:
AVoCS 2012 Intern. Workshop on Automated Verification of Critical Systems. Tayssir Touili.
EXPRESS 2009 International Workshop on Expressiveness in Concurrency. François Laroussinie.
FICS 2012 International Workshop on Fixed Points in Computer Science. Irène Guessarian.
GT-VC 2007 Graph Transformation for Concurrency and Verification. Peter Habermehl.
HAV 2007 Intern. Workshop on Heap Analysis and Verification. Ahmed Bouajjani.
INFINITY 2008 Intern. Workshop on Verification of Infinite-State Systems. Peter Habermehl (cochair).
INFINITY 2009 Taysir Touili.
INFINITY 2010 Peter Habermehl and Arnaud Sangnier
INFINITY 2011 Peter Habermehl
MEMICS 2008-12 Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Peter Habermehl.
MEMICS 2008 Taysir Touili.
RP 2008 Intern. Workshop in Reachability Problems. Eugène Asarin and Ahmed Bouajjani.
RP 2009 Eugène Asarin and Ahmed Bouajjani.
RP 2010 Eugène Asarin.
RP 2011 Arnaud Sangnier.
SPIN 2012 Intern. SPIN Workshop on Model Checking of Software. Tayssir Touili.
VECOS 2008-12 4th Intern. workshop on Verification and Evaluation of Computer and Communication Systems. Tayssir Touili.
6.3.3
6.3.3.1
Scientific meetings
IFIP WG 2.2 Annual meeting of the IFIP working group 2.2 Ahmed Bouajjani. Paris, September 2011.
6.3.3.2
Member of organization committees
CONCUR 2010 21st Intern. Conf. on Concurrency Theory. Paris, Aug 31 – Sept 3, 2010. Florian
Horn and Mihaela Sighireanu.
6.3.4
6.3.4.1
International
• Member of the CAV Award committee. This is an annual award which recognizes a specific fundamental contribution or a series of outstanding contributions to the Computer-Aided Verification
field. Ahmed Bouajjani, since 2012.
• Member of the Future and Emerging Technologies (FET) Open evaluation jury, FP7-ICT program
of the European Commission. 2007-2010. Ahmed Bouajjani.
• External academic coordinator for the evaluation of the Computer Sciences and Informatics department of the ULB, Brussels, Belgium, 2011. Ahmed Bouajjani.
• Member of the review panel of the german DFG Transregional Collaborative Research Centre
(SFB/Transregio) 14 AVACS - Automatic Verification and Analysis of Complex Systems, 2011.
Ahmed Bouajjani.
273
• External member of a recruiting committee (for a Director) at Max Planck Society - MPI for
Software Systems, Kaiserslautern, Germany, 2008. Ahmed Bouajjani.
• Reviewer for recruiting/promotion committees: Univ. Saarlands, Saarbrücken, Germany, 2011
and 2012 ; The IMDEA Software Institute, Madrid, Spain, 2012. Ahmed Bouajjani.
6.3.4.2
National
• Member of the AERES evaluation committee of the IRIT laboratory, Toulouse, 2009. Ahmed
Bouajjani.
6.3.4.3
• Eugene Asarin: Univ. de Provence Marseille (2009), Univ. Bordeaux (2011), Univ. Paris-Est
Créteil (2012), Univ. Paris Diderot (2007, 2008, 2009, 2010)
• Ahmed Bouajjani: France: Univ. de Provence Marseille (MdC, 2008), ENSEIRB-Bordeaux (PR,
2009), Univ. Paris Diderot (MdC, 2009, 2010), Univ. de Provence (MdC, 2010), ENSIMAGGrenoble (MdC, 2010), Univ. Bordeaux (MdC, 2012), Univ. Grenoble (PR, 2012).
• Constantin Enea: Univ. Paris 1 (MdC, 2012)
• Peter Habermehl: Univ. Paris Diderot (MdC, 2009, 2010, 2011)
• François Laroussinie: Univ. de Provence Marseille (2009 and 2010), Univ. Paris Diderot (2008,
2010, 2011, and 2012)
• Mihaela Sighireanu: Univ. Paris Diderot (MdC, 2009, 2010 x 2)
• Tayssir Touili: INRIA Rennes (CR, 2010)
6.4
International visibility
6.4.1
6.4.1.1
Invited talks
International conferences
FCT 2007. International Symposium on Fundamentals of Computation Theory. Budapest (Hungary),
Aug 2007. Rewriting Systems with Data: A Framework for Reasoning about Systems with Unbounded Structures over Infinite Data Domains. Ahmed Bouajjani.
LATA 2012. International Conference on Language and Automata Theory and Applications. Coruña
(Spain), March 2012. Measuring Information in Timed Languages. Eugène Asarin.
VMCAI 2012. International Conference on Verification, Model Checking, and Abstract Interpretation. Philadelphia (USA), Jan 2012. Abstract Domains for Automated Reasoning about ListManipulating Programs with Infinite Data. Ahmed Bouajjani.
6.4.1.2
International workshops
AHA 2007 International symposium on Automatic Heap Analysis. Berlin (Germany), July 2007.
Automata-based techniques for shape analysis. Ahmed Bouajjani.
EXPRESS 2007 Intern. Workshop on Expressiveness in Concurrency. Lisboa (Portugal), Sept 2007.
Alternating-time Temporal Logic: Expressivity, Complexity, Extensions. François Laroussinie.
HAV 2007 Heap Analysis and Verification. Braga (Portugal), March 2007. Automata-Based Techniques for the Verification of Programs with Linked Data Structures. Ahmed Bouajjani.
MEMICS 2009 Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer
Science. Znojmo (Czech Rep.), Nov 2009. Angluin-style learning of NFA. Peter Habermehl.
274
WRLA 2008 International Workshop on Rewriting Logic and its Applications. Budapest (Hungary),
March 2008. Rewriting systems with data: a framework for reasoning about unbounded networks
of infinite-state processes. Ahmed Bouajjani.
RP 2009 International Workshop on Reachability Problems, LIX Colloquium. Palaiseau (France), 2009.
On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems. Ahmed
Bouajjani.
REORDER 2012 International Workshop on Memory Consistency Models. Berkeley (USA), July
2012. Checking state reachability for weak memory models. Ahmed Bouajjani.
6.4.2
Participation in upon-invitation-only scientific meetings
Dagstuhl Seminar 08171 Topic: Beyond the Finite: New Challenges in Verification and Semistructured Data, April 2008. Tutorial on Parametrized Verification, Ahmed Bouajjani.
Dagstuhl Seminar 09301 Topic: Typing, Analysis and Verification of Heap-Manipulating Programs,
July 2009. Ahmed Bouajjani and Peter Habermehl.
Dagstuhl Seminar 10252 Topic: Game Semantics and Program Verification, June 2010. Peter Habermehl.
Dagstuhl Seminar 11011 Topic: Multi-Core Memory Models and Concurrency Theory, January 2011.
Ahmed Bouajjani.
Mysore Park Workshop The Chemistry of Concurrent and Distributed Programming, Infosys campus,
Mysore, India, February 2011. Ahmed Bouajjani.
CP meets CAV Constraint Programming meets Computer Aided Program Verification, Turunç, Turkey,
June 2012. Ahmed Bouajjani (Tutorial on Symbolic Model Checking), Constantin Enea, and Peter
Habermehl.
6.4.3
Invited stays
• University of Stuttgart, Germany. Host: Javier Esparza. 7 weeks. Feb–March 2007. Ahmed
Bouajjani.
• University of Uppsala, Sweden. Host: Parosh Abdulla. 5 weeks. May-June 2007. Ahmed Bouajjani.
• Carnegie Mellon University, USA. Host: Edmund Clarke. 2 weeks, June 2007. Tayssir Touili.
• University of Tel Aviv, Israel. Host: Mooly Sagiv. 2 weeks, July 2007. Ahmed Bouajjani.
• University of Muenster, Germany. Host: Markus Mueller-Olm. 1 week in 2007 and 1 week in
2008. Tayssir Touili.
• TU Munich, Germany. Host: Martin Leucker. 1 week, May 2008. Peter Habermehl.
• Microsoft Research, Redmond, USA. Host: Shaz Qadeer. 4 weeks, August 2008. Ahmed Bouajjani.
• Oxford University, UK. Host: Daniel Kroening. 1 week, June 2009. Tayssir Touili.
• Microsoft Research, Redmond, USA. Host: Madanlal Musuvathi. 5 weeks, Aug–Sept 2010.
Ahmed Bouajjani.
• TU Brno, Czech Rep., Host: Tomas Vojnar. 1 week in 2007, 2 weeks in 2008, 1 week in 2009 and
in 2010. Peter Habermehl.
• University of Reykjavik, Island. Host: Luca Aceto, spring 2009. François Laroussinie.
• Microsoft Research India, Bangalore. Host: Akash Lal. 3 weeks, Aug 2011. Ahmed Bouajjani.
275
• National Taiwan University, Taipei. Host: Farn Wang. 2 weeks, Oct 2011. Ahmed Bouajjani.
• Institute for Mathematical Science, National University of Singapore, Automata Theory and Applications program. Host: P.S. Thiagarajan. 1 week, Sept 2011. Eugène Asarin.
• Microsoft Research India, Bangalore. Host: Akash Lal. 4 weeks, December 2011. Michael
Emmi.
• Chennai Mathematical Institute, India. Host: Narajan Kumar and Madhavan Mukund. 1 week,
February 2012. Ahmed Bouajjani.
• University of Uppsala, Sweden. Host: Parosh Abdulla. 2 weeks, April 2012. Arnaud Sangnier.
6.5
Educational, advising, and evaluation activities
6.5.1
6.5.1.1
List of defended PhD theses and Habilitations
Habilitations
1. Peter Habermehl, Verification of systems with complex data structures using automata. December 2009.
2. Tayssir Touili, Modeling and reachability analysis of concurrent recursive programs. December
2009.
6.5.1.2
Doctoral theses
Theses (listed in chronological order of defence) carried out and defended in the team, or directed
by a member of the team
1. Mathias Samuelides, Pebble tree automata. Director: Anca Muscholl 1 and Luc Ségoufin (LSV),
December 2007.
2. Pierre Moro, Combining automata-based symbolic analysis and counter-example guided abstraction. Directors: Ahmed Bouajjani and Peter Habermehl. Univ. Paris Diderot, February
2008.
3. Florian Horn, Random Games. Directors: Anca Muscholl and Wolfgang Thomas (Aachen). Uni.
Paris Diderot and Univ. of Aachen, October 2008.
4. Ghassan Oreiby, Logique Temporelle pour le contrôle temporisé, Director: François Laroussinie,
co-directed with Nicolas Markey (LSV), ENS Cachan, December 2008.
5. Claire David, Analysis of XML with unbounded data, Directors: Anca Muscholl and Luc Ségoufin
(LSV), May 2009.
6. Mohamed Faouzi Atig, Verification of Concurrent Programs: Decidability and Complexity. Directors: Ahmed Bouajjani and Tayssir Touili. Univ. Paris Diderot, June 2010.
7. Arnaud da Costa, Propriétés de jeux multi-agents. Director: François Laroussinie, co-directed
with Nicolas Markey (LSV), ENS Cachan, September 2011.
8. Cezara Dragoi, Automated Verification of Heap-Manipulating Programs with Infinite Data. Directors: Ahmed Bouajjani and Mihaela Sighireanu. Univ. Paris Diderot, December 2011.
1. Anca Muscholl was member of the MV team until August 2006. Her three students, C. David, F. Horn, and M.
Samuelides stayed members of our team until the end of their theses.
276
6.5.2
6.5.2.1
Reports on PhD and Habilitation theses
Reports on Habilitations
1. Stéphane Demri, Logics for Specifying and Verifying (Logiques pour la Spécification et
Vérification). ENS Cachan, June 2007. Reviewer: Ahmed Bouajjani.
2. Catalin Dima, Automata and Logics for the Verification of Timed and Multi-agents Systems.
Univ. Paris-Est Créteil, Dec 2010. Reviewer: François Laroussinie.
3. Franck Cassez, Control of Timed Systems.
Ahmed Bouajjani.
Univ.
of Nantes, Sept 2007.
Reviewer:
4. Thomas Genet, Reachability Analysis of Rewriting for Software Verification. Univ. Rennes 1,
Nov 2009. Reviewer: Ahmed Bouajjani.
5. Nicolas Markey, Verification of Embedded Systems: Algorithms and Complexity (Vérification
des systèmes embarqués: Algorithmes et complexité). ENS Cachan, April 2011. Reviewer:
Eugène Asarin.
6.5.2.2
Reports on PhD theses
1. Pierre-Alain Reynier. Vérification de systèmes temporisés et distribués: modèles, algorithmes
et implémentabilité. ENS Cachan, June 2007. Reviewer: Ahmed Bouajjani.
2. Fernando Schapachnik. Timed Automata Model Checking in Monoprocessor and Multiprocessor Architectures. Univ. of Buenos Aires (Argentina), October 2007. Reviewer:
Ahmed Bouajjani.
3. Adam Rogalewicz. Verification of Programs with Complex Data Structures. TU Brno (Czech
Rep.), Nov 2007. Reviewer: Tayssir Touili.
4. Régis Gascon. Spécification et Vérification de Propriétés Quantitatives sur des Automates à Contraintes. ENS Cachan, Nov 2007. Reviewer: Ahmed Bouajjani.
5. Mayank Saksena. Verifying Absence of Infinite Loops in Parameterized Protocols. Univ. of
Uppsala (Sweden), April 2008. Opponent: Ahmed Bouajjani.
6. Laurent Bienvenu. Caractérisations de l’aléatoire par les jeux: imprédictibilité et stochasticité.
Univ. de Provence, April 2008. Reviewer: Eugène Asarin.
7. Cristóbal Rojas Gonzáles. Aléatoire et théorie ergodique : un point de vue algorithmique. Ecole
Polytechnique and Univ. of Pisa, June 2008. Rewiever: Eugène Asarin.
8. Dejvuth Suwimonteerabuth (Remy). Reachability in pushdown systems: Algorithms and applications. TU Munich (Germany), May 2009. Reviewer: Ahmed Bouajjani.
9. Louis-Marie Traonouez. Vérification et dépliages de réseaux de Petri temporels paramétrés.
Univ. of Nantes, Nov 2009. Reviewer: François Laroussinie.
10. Omer Landry Nguena Timo. Synthèse pour une logique temps-réel faible. Univ. de Bordeaux 1,
Dec 2009. Rewiever: François Laroussinie.
11. Roman Manevich. Partially Disjunctive Shape Analysis. Univ. of Tel Aviv (Israel), 2009. Reviewer: Ahmed Bouajjani.
12. Gérard Charly Basler. Model checking Boolean Programs. ETH Zurich, March 2010. Reviewer: Tayssir Touili.
13. Thanh-Hung Nguyen. Constructive Verification of Component-based Systems. Institut National
Polytechnique de Grenoble, VERIMAG, June 2010. Reviewer: Ahmed Bouajjani.
277
14. Alexander Heussner. Towards the verfication of safety properties for infinite communicating
systems: decidability and abstraction refinement. Univ. of Bordeaux, June 2011. Reviewer:
Tayssir Touili.
15. Pierre Chambart. On Post’s Embedding Problem and the Complexity of Lossy Channels. ENS
Cachan, Sept 2011. Reviewer: Ahmed Bouajjani.
16. Julien Legriel. Optimisation multi-critères et ses applications aux systèmes embarqués multiprocesseurs. Univ. of Grenoble, Oct 2011. Reviewer: Eugène Asarin.
17. Rajarshi Ray. Reachability Analysis of Hybrid Systems using Support Functions. Univ. of
Grenoble, May 2012. Reviewer: Eugène Asarin.
18. Tesnim Abdellatif. Rigorous Implementation of Real-time Systems. Univ. of Grenoble, June
2012. Rewiever: Eugène Asarin.
19. Filip Konecny. Relational Verification of Programs with Integer Data. TU Brno (Czech Rep.)
and Univ. of Grenoble, October 2012. Reviewer: Ahmed Bouajjani.
6.5.3
6.5.3.1
Educational activities
Courses in Research Masters
MPRI 2.8. Foundations of real time systems verification. Participants: François Laroussinie and
Eugène Asarin.
MPRI 2.9. Verification of parametrized and dynamic systems. Participants: Ahmed Bouajjani, Peter
Habermehl, Arnaud Sangnier, Mihaela Sighireanu, and Tayssir Touili.
6.5.3.2
Advanced courses, Doctoral and Research Schools
ECI 2012 Escueal de Ciencias Informáticas (School on Computer Science), University of Buenos
Aires, Argentina, July 2012. Verification of Concurrent Programs. Ahmed Bouajjani.
ECNU Summer School’10 Software Engineering Institute, East China National University Summer
School, Shanghai, China, July 2010. Cyber-Physical Systems. Eugène Asarin.
EJC InfoMath 2007 Ecole Jeunes Chercheurs Informatique Mathématique (School for young researchers on Mathematical Computer Science), LORIA Nancy, March 2007. Eugène Asarin.
ETR 2009 Ecole d’été Temps-Réel (Summer School on Real-Time), Paris, 2009. Games and Temporal
Logics for the Verification of Timed Systems. François Laroussinie.
FSFLA 2012 International Fall School on Formal Languages and Applications, Tarragona, Spain, October 2012. Automated Verification of Concurrent Boolean Programs. Ahmed Bouajjani.
MOVEP 2012. Ecole Jeunes Chercheurs Modélisation et Vérification de Processus Parallèles (School
for young researchers on Modeling and Verification of Parallel Processes), Marseille, December
2012. Verification of Concurrent Programs, Ahmed Bouajjani.
VTSA 2012 Summer School on Verification Technology, Systems and Applications. MPI Saarbrücken,
September 2012. Verification of Concurrent Programs under Weak Memory Models, Ahmed
Bouajjani.
6.5.3.3
Popularization
Fête de la Science Presentations and interactive workshops/demonstrations.
278
Septième partie
279
La création du LIAFA remonte à 1996, sur l’initiative de chercheurs et enseignants-chercheurs du LITP
(Laboratoire d’Informatique Théorique et de Programmation). Jean-Eric Pin est nommé directeur du
LIAFA en juin 1996, sous la forme d’une Equipe en Restructuration (ERS 586). Deux ans plus tard, le
LIAFA est reconnu comme une Unité Mixte de Recherche (UMR 7089) par le CNRS et l’université Paris
Diderot, sous la direction de Daniel Krob. A cette date, le laboratoire est constitué, outre les personnels
ITA et IATOS, doctorants, post-doctorants et visiteurs non-permanents, de 15 enseignants-chercheurs
et 4 chercheurs CNRS. Il est structuré en trois équipes : Algorithmique et combinatoire, Automates, et
Modélisation et vérification, plus un axe transversal : Systèmes à évènements discrets.
F IGURE 6.1 – Les locaux de Jussieu (gauche) et de Chevaleret (droite)
En 1999, le LIAFA déménage de ses locaux du campus de Jussieu dans les locaux du bâtiment de la
rue du Chevaleret, dans le cadre du désamiantage de Jussieu. L’occupation des locaux de Chevaleret,
initialement prévue pour une courte période transitoire, va durer... plus de 13 ans. De fait, le laboratoire
occupe toujours actuellement ces locaux dans l’attente de bureaux dans le bâtiment Sophie Germain du
campus de Paris Diderot (déménagement prévu fin 2012 - début 2013).
F IGURE 6.2 – Les futurs locaux du campus de l’université Paris Diderot
Daniel Krob assure la direction du LIAFA de 1998 à 2002. En 2003, Jean-Eric Pin est nommé derechef directeur du LIAFA, pour le quadriennal 2003-2007. Michel Habib prend ensuite la direction du
laboratoire à partir de 2008 jusqu’à sa nomination à la direction du nouvel institut INS2I du CNRS
(Institut des sciences de l’information et de leurs interactions) courant 2009. La direction du laboratoire
est assurée par Pierre Fraigniaud depuis janvier 2010. Au 1er septembre 2012, le laboratoire inclut près
de 110 membres, dont 34 enseignants-chercheurs, 24 chercheurs CNRS et 2 chercheurs INRIA. Il est
structuré en cinq équipes : Algorithmes et complexité, Algorithmique distribuée et graphes, Automates
et applications, Combinatoire, et Modélisation et vérification.
281

Rapport d`activité 2007-2012 - liafa

Transcription

Documents pareils

Software Reliability and Security (Transport et Logistique en milieu

Bursary Winners 2005 / Gagnants de bourses 2005

Tournoi de la Licorne Minimes par équipe à Saverne 21/02/2015

Technicien(ne) en informatique (interne-externe) 80

CAMPEONATO DE EUROPA DE JOVENES

Packages (Re)Dice_ pour les computer experiments

Quantum - Technicien en contrôle qualité

Internetvokabular – Frz Gk 13, 11/2008

Impression d`une fiche de bien

Thomas Jung