Stéphane Devismes

Stéphane Devismes is a Professor at the University of Picardy Jules Verne, affiliated with the ALCO team (Algorithmics and Complexity) in the Laboratoire MIS (UR 4290). His research focuses on Distributed Algorithms, Fault-Tolerance, and Autonomous Mobile Robots with self-stabilizing properties.

• University: University of Picardy Jules Verne
• Department: Laboratoire MIS (UR 4290)
• Team: ALCO (Algorithmics and Complexity)

Research Interests: Devismes specializes in Self-Stabilizing Algorithms for distributed systems, particularly in Graph Exploration and Robot Coordination. His work addresses challenges like chirality constraints, asynchronous environments, and polynomial convergence.

Publication Trends: Recent articles emphasize infinite grid exploration with minimal robots, model checking for distributed algorithms, and efficient self-stabilization in directed networks. Themes include autonomous systems, resource allocation, and network dynamics, often leveraging propositional satisfiability and SAT solvers.

Scientific Awards:

• 2022 Wilkes Award for "Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots"
• Best Paper at NETYS'2020
• Best Student Paper at ICDCN'2023

Grants & Projects: Involved in the ANR SkyData project for intelligent autonomous data systems and developed the SASA simulator for self-stabilizing algorithms. His HDR (2020) on "Generality and Efficiency in Self-Stabilizing Distributed Systems" highlights his leadership in certified algorithmic frameworks.

Teaching & Mentorship: Authored seminal books like "Introduction to Distributed Self-Stabilizing Algorithms" (2019) and "Bases de données - Informatique BUT 1re année et L1" (2024). Co-organized conferences including AlgoTel'2025 and served on program committees for PODC, DISC, and SSS.