Research themes

The main objective of the Distributed Computing team's research is the design and analysis of distributed algorithms, namely algorithms designed for a set of computing entities collaborating in the resolution of a task in the absence of global coordination. The distributed systems considered can obviously come from computer technology (multi-core, cloud, P2P networks, blockchain, etc.), but can also be related to biology (insect colony, cell networks, etc.), or even humanities (social networks, small worlds, etc.). The team's work therefore focuses on most of the fundamental models of distributed computing, from shared-memory models to message-passing models (in static or dynamic networks), in which the processes are potentially subject to different forms of failures or attacks, and in which the computing and communication capabilities may be restricted. The team is also conducting research on the design of distributed data structures for large-scale networks, typically related to navigation, routing, distance calculation, etc.

The applications of the research carried out within the team relate mainly to network science, complex systems, biological systems, transportation networks, and blockchain based systems. Several members of the team are also members of the Inria GANG project-team, the objective of which is the development of algorithmic methods for the design and control of large-scale networks.

Distributed network computing, as well as the design of distributed data structures, is very closely related to results in graph theory, and often aims at the distributed solution of classical graph problems. The team therefore maintains very close links with the team Theory and algorithmics of graphs at IRIF. Similarly, techniques for designing distributed algorithms are often based on the adaptation of sequential algorithms to distributed models. The team therefore also maintains very close links with the Algorithms and Complexity team at IRIF.


The seminars by members or guests of the team take place as part of the weekly seminars of the teams Theory and algorithmics of graphs and Algorithms and Complexity, according to the topics of the proposed talks.

Permanent members

Blin Lelia @ 01 57 27 94 51 3015 Professor ASD distribue
Delporte Carole @ 01 57 27 92 25 4006 Professor - directrice UFR informatique ASD distribue
Fauconnier Hugues @ 01 57 27 92 25 4006 Professor Emeritus ASD distribue
Fraigniaud Pierre @ 01 57 27 92 60 4019 Senior Research Scientist - CNRS ASD algocomp , distribue
Korman Amos @ 01 57 27 94 06 4028 Senior Research Scientist - CNRS - Currently on sabbatical at FILOFOCS ASD algocomp , distribue
Rabie Mikael @ 01 57 27 93 38 4021 Associate Professor ASD graphes , distribue

Non-permanent members

Das Avinandan @ 4055 PhD Student ASD algocomp , distribue
Luce Mael @ 3014 PhD Student ASD algocomp , distribue
Nguyen Minh-Hang @ 4031 PhD Student ASD graphes , distribue
Rajsbaum Sergio @ 01 57 27 94 44 4048 Associated Member ASD distribue
Safir Mouna @ 4060 PhD Student ASD distribue
Vacus Robin @ 4055 PhD Student ASD algocomp , distribue
Viennot Laurent @ 01 57 27 92 50 3042a Associated Member - Directeur de recherche INRIA ASD graphes , distribue