The PODC/DISC community in France

07 Oct 2021

It is often difficult for people of the PODC/DISC community to understand the university systems and the affiliations in France. This post is a list of PODC/DISC people working in France, sorted by affiliations, with a few keywords. It has been compiled by Fabien Dufoulon (who came up with the idea) and myself, with help from Anaïs Durand and Mikaël Rabie.

This list is meant to be inclusive. If you feel that someone is missing, just let us know. Our rule of thumb to decide who to put on the list was: people with permanent positions and with at least two papers in the last five years in a conference with a PODC/DISC scope (eg PODC, DISC, OPODIS, SSS, SIROCCO etc.).

Map of the centers of PODC/DISC research in France.

Paris’s area (Ile-de-France)

(We divide the list into Paris’ area and outside Paris area for convenience.)

Sorbonne University - LIP6

(Former Université Pierre et Marie Curie, Paris 6, Paris Jussieu)

• Lélia Blin (also affiliated to Université Evry Val d’Essonne). Distributed algorithms, self-stabilization, spanning trees, memory minimization, sensor networks.
• Swan Dubois. Fault tolerance, self-stabilization, dynamic systems, byzantine faults.
• Franck Petit. Algorithmic aspects of synchronization, stabilization and fault-tolerance, cohort of robots, dynamic networks.
• Maria Potop-Butucaru. Fault-tolerant and self* distributed systems, sensor and robots networks, P2P or distributed ledgers.
• Sébastien Tixeuil. Fault and attack tolerance in self-organized distributed systems and networks.

University of Paris - IRIF

(Former University Paris Diderot/Paris 7 - LIAFA)

• Carole Delporte-Gallet. Distributed algorithms, fault-tolerance, consensus, security and privacy, networks
• Hugues Fauconnier. Distributed algorithms, fault-tolerance, consensus, security and privacy, networks
• Pierre Fraigniaud. Design and analysis of distributed algorithms and data structures for networks.
• Amos Korman. Distributed algorithms in networks, computations under uncertainties, algorithmic aspects of biology.
• Mikaël Rabie. Complexity, Computability, Distributed Computation.
• Laurent Viennot Transportation networks, routing, labelings.

Paris-Saclay University - LRI/LISN + LSV

• Thibaut Balabonski. Formal proofs for mobile robot swarms protocols, lambda calculus, concurrency.
• Evangelos Bampas. Distributed and mobile agent systems.
• Joffroy Beauquier. Population protocols, self-stabilization.
• Janna Burman. Population protocols, self-stabilization.
• Johanne Cohen. Algorithms and telecommunications, self-stabilization.
• Matthias Függer. Fundamentals of computationally extremely restricted distributed devices.
• Thomas Nowak. Distributed algorithms, synthetic biology, discrete-event systems, wireless ad-hoc networks of mobile agents.
• Ami Paz (starting in Fall 2021). Distributed graph algorithms, topological methods, streaming algorithms.

Paris-Saclay University - CEA LIST

• Sara Tucci-Piergiovanni. Byzantine fault tolerance, blockchain.
• Antonella Del Pozzo. Byzantine fault tolerance, blockchain, distributed storages.

École polytechnique - LIX

• Bernadette Charron-Bost. Distributed algorithms, fault-tolerance, consensus, natural algorithms.
• Eric Goubault. Topological methods and verification of concurrent, distributed and fault-tolerant computing.
• Samuel Mimram. Denotational semantics, concurrency, rewriting theory, category theory, linear logic, programming languages, algebraic topology, and hybrid systems.

University of Versailles - Li-PaRAD

(The full name is University of Versailles Saint-Quentin-en-Yvelines)

• George Manoussakis. Self-stabilization, graph theory.
• Laurence Pilard. Fault-tolerance.
• Devan Sohier. Randomized methods, population protocols, self-stabilization.

CNAM - CEDRIC

• Pierre Courtieu. Formal proofs, robots.

Télécom Paris - INFRES

• Petr Kuznetsov. Synchronization, failure detection, algebraic topology and distributed computing, distributed aspects in networking
• Matthieu Rambaud. Cryptography, algebraic geometry, byzantine fault tolerance
• Pierre Sutra. Data consistency and concurrency in distributed systems.

University of Technology of Compiègne

• Bertrand Ducourthial. Dynamic networks.

Outside Paris’area

University of Bordeaux - LABRI

• Marthe Bonamy. Graph theory, local algorithms, labelings.
• Arnaud Casteigts. Highly dynamic networks, algorithms.
• Cyril Gavoille. Distributed graph algorithms, routing, labelings.
• Nicolas Hanusse. Fault-tolerance, networks.
• David Ilcinkas. Mobile agents, distributed computing.
• Colette Johnen. Self-stabilization.
• Ralf Klasing. Networks.
• Yves Métivier. Distributed network algorithms, beeping model.
• Corentin Travers. Coordination and fault-tolerance.

Aix-Marseille University - LIS

• Jérémie Chalopin Distributed algorithms, mobile agent systems, metric graph theory
• Shantanu Das. Design and analysis of distributed algorithms, Fault tolerance in distributed systems, distributed robotics, dynamic networks, sensor networks
• Emmanuel Godard. Distributed Algorithms, structural properties and distributed, computability, termination detection, reliability and fault-Tolerance.
• Damien Imbs Distributed algorithms, malicious behaviors in distributed systems, combinatorial topology
• Arnaud Labourel Graph representation, mobile agents, robots
• Alessia Milani. (Starting in Fall 2021, previously in Bordeaux.) Distributed and concurrent computing, fault-tolerant shared objects, consistency and dynamic networks.

University of Rennes - IRISA

• Emmanuelle Anceaume. Data stream algorithms, reputation mechanisms, dependability issues in peer-to-peer systems, blockchain technologies.
• George Giakkoupis. Design and analysis of algorithms, with emphasis on distributed algorithms and randomization.
• Michel Raynal. Distributed algorithms and systems, concurrency, distributed computing, fault-tolerance, synchronization.
• François Taiani. Large-scale distributed computer systems, programmability of distribution, cloud computing, social networks.
• Bruno Sericola. Markov chains, Queuing theory, population protocols.
• Yves Mocquard. Randomized methods, population protocols.

University of Nantes - LS2N

• Achour Mostéfaoui. Synchronization, fault-tolerance, scalability, group communication, data consistency and checkpointing.
• Matthieu Perrin. Message-passing distributed systems, weakly consistent shared objects, message broadcast primitives.

Grenoble Alpes University - Verimag and GSCOP

• Karine Altissen. Fault tolerant distributed algorithms: design and (pen-and-paper) proof, formal proof, simulation.
• Louis Esperet. Graph theory, optimization.
• Lionel Rieg Formal proofs, robots, self-stabilization.

University of Picardy Jules Vernes - MIS

(The lab is in Amiens.)

• Alain Cournier. Self-stabilization.
• Yoann Dieudonné. Robots, anonymous systems.
• Vincent Villain. Self-stabilization.
• Stéphane Devismes. (starting in Fall 2021, previously in Grenoble). Self-stabilization, robots.

University of Strasbourg - ICUBE

• Quentin Bramas. Autonomous mobile robots, distributed ledgers, wireless sensor networks, dynamic graphs.
• Anissa Lamani. Distributed systems, fault tolerance.

Université Clermont-Auvergne - LIMOS

• Anaïs Durand. Fault-tolerance and self-stabilization.
• Pascal Lafourcade. Security, cryptography, formal proofs.

University of Lyon - LIRIS

• Nicolas Bousquet. Graph theory, coloring, reconfiguration.
• Xavier Urbain. Formal proof for networks of autonomous mobile robots, automated proof, verification, rewriting, termination.

Côte d’Azur University - I3S

• Emanuele Natale. Computational neuroscience, artificial intelligence, distributed probabilistic dynamics.
• Nicolas Nisse. Distributed algorithms, labelings, games, graphs.
• Chuan Xu. Population protocols, self-stabilization, distributed machine learning, federated learning, stochastic optimization.

University of Toulouse - LAAS + IRIT

• Matthieu Roy. Distributed algorithms, consistency and safety, geo-localized systems, human-carried distributed systems, real-time systems and distributed embedded systems.
• Gilles Tredan. Data analysis, graphs, distributed algorithms, machine learning.
• Philippe Quéinnec. Distributed embedded systems and distributed real time systems, refinement of concurrent and distributed. algorithms, verification of asynchronous communicating systems
• Aurélie Hurault. Formalizing distributed systems, asynchronous communication.