Snap-Stabilizing Detection of Cutsets. - Alain Cournier; Stéphane Devismes; Vincent Villain (HiPC, 2005)

A Snap-Stabilizing DFS with a Lower Space Requirement. - Alain Cournier; Stéphane Devismes; Vincent Villain (Self-Stabilizing Systems, 2005)

A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges. - Stéphane Devismes (Parallel Process. Lett., 2005)

Snap-Stabilizing PIF and Useless Computations. - Alain Cournier; Stéphane Devismes; Vincent Villain (ICPADS (1), 2006)

From Self- to Snap- Stabilization. - Alain Cournier; Stéphane Devismes; Vincent Villain (SSS, 2006)

Snap-Stabilizing Depth-First Search on Arbitrary Networks. - Alain Cournier; Stéphane Devismes; Franck Petit; Vincent Villain (Comput. J., 2006)

Quelques Contributions à la Stabilisation Instantanée. (Some Contributions to Snap-Stabilization). - Stéphane Devismes (2006)

Robust Stabilizing Leader Election. - Carole Delporte-Gallet; Stéphane Devismes; Hugues Fauconnier (SSS, 2007)

Weak vs. Self vs. Probabilistic Stabilization. - Stéphane Devismes; Sébastien Tixeuil; Masafumi Yamashita (ICDCS, 2008)

With Finite Memory Consensus Is Easier Than Reliable Broadcast. - Carole Delporte-Gallet; Stéphane Devismes; Hugues Fauconnier; Franck Petit; Sam Toueg (OPODIS, 2008)

Bounds for self-stabilization in unidirectional networks - Samuel Bernard; Stéphane Devismes; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (CoRR, 2008)

Self-stabilizing K-out-of-L exclusion on tree network - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (CoRR, 2008)

Communication Efficiency in Self-Stabilizing Silent Protocols. - Stéphane Devismes; Toshimitsu Masuzawa; Sébastien Tixeuil (ICDCS, 2009)

Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks. - Samuel Bernard; Stéphane Devismes; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (IPDPS, 2009)

Self-Stabilizing k-out-of-l exclusion on tree networks. - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (IPDPS, 2009)

Space-Optimal Deterministic Rendezvous. - Fabienne Carrier; Stéphane Devismes; Franck Petit; Yvan Rivierre (PDCAT, 2009)

A Self-Stabilizing O(n)-Round k-Clustering Algorithm. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (SRDS, 2009)

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots - Stéphane Devismes; Franck Petit; Sébastien Tixeuil (CoRR, 2009)

Light enabling snap-stabilization of fundamental protocols. - Alain Cournier; Stéphane Devismes; Vincent Villain (ACM Trans. Auton. Adapt. Syst., 2009)

Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks. - Samuel Bernard; Stéphane Devismes; Katy Paroux; Maria Potop-Butucaru; Sébastien Tixeuil (ICDCN, 2010)

Optimal exploration of small rings. - Stéphane Devismes (WRAS, 2010)

Algorithms for Extracting Timeliness Graphs. - Carole Delporte-Gallet; Stéphane Devismes; Hugues Fauconnier; Mikel Larrea (SIROCCO, 2010)

Approximation of delta-Timeliness. - Carole Delporte-Gallet; Stéphane Devismes; Hugues Fauconnier (SSS, 2010)

Snap-stabilization in message-passing systems. - Sylvie Delaët; Stéphane Devismes; Mikhail Nesterenko; Sébastien Tixeuil (J. Parallel Distributed Comput., 2010)

Stabilizing leader election in partial synchronous systems with crash failures. - Carole Delporte-Gallet; Stéphane Devismes; Hugues Fauconnier (J. Parallel Distributed Comput., 2010)

Sorting on Skip Chains. - Ajoy Kumar Datta; Lawrence L. Larmore; Stéphane Devismes (ICNC, 2011)

Multi-resource Allocation with Unknown Participants. - Ajoy Kumar Datta; Lawrence L. Larmore; Stéphane Devismes; François Kawala; Maria Potop-Butucaru (ICNC, 2011)

Brief Announcement: Sorting on Skip Chains. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (SSS, 2011)

Asymptotically Optimal Deterministic Rendezvous. - Fabienne Carrier; Stéphane Devismes; Franck Petit; Yvan Rivierre (Int. J. Found. Comput. Sci., 2011)

Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (Int. J. Found. Comput. Sci., 2011)

Autour de l'autostabilisation. 1. Techniques généralisant l'approche. - Stéphane Devismes; Franck Petit; Vincent Villain (Tech. Sci. Informatiques, 2011)

Autour de l'autostabilisation. 2. Techniques spécialisant l'approche. - Stéphane Devismes; Franck Petit; Vincent Villain (Tech. Sci. Informatiques, 2011)

Analysis of Random Walks Using Tabu Lists. - Karine Altisen; Stéphane Devismes; Antoine Gerbaud; Pascal Lafourcade 001 (SIROCCO, 2012)

Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (SSS, 2012)

Optimal Grid Exploration by Asynchronous Oblivious Robots. - Stéphane Devismes; Anissa Lamani; Franck Petit; Pascal Raymond; Sébastien Tixeuil (SSS, 2012)

On efficiency of unison. - Stéphane Devismes; Franck Petit (TADDS, 2012)

Algorithme autostabilisant construisant un petit ensemble k-dominant. - Ajoy Kumar Datta; Stéphane Devismes; Karel Heurtefeux; Lawrence L. Larmore; Yvan Rivierre (Tech. Sci. Informatiques, 2012)

Fast Leader (Full) Recovery Despite Dynamic Faults. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore; Sébastien Tixeuil (ICDCN, 2013)

Self-Stabilizing Small k-Dominating Sets. - Ajoy Kumar Datta; Lawrence L. Larmore; Stéphane Devismes; Karel Heurtefeux; Yvan Rivierre (Int. J. Netw. Comput., 2013)

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. - Sayaka Kamei; Hirotsugu Kakugawa; Stéphane Devismes; Sébastien Tixeuil (J. Comb. Optim., 2013)

Preface. - Ajoy Kumar Datta; Stéphane Devismes (Theor. Comput. Sci., 2013)

Self-stabilizing labeling and ranking in ordered trees. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore; Yvan Rivierre (Theor. Comput. Sci., 2013)

Optimal probabilistic ring exploration by semi-synchronous oblivious robots. - Stéphane Devismes; Franck Petit; Sébastien Tixeuil (Theor. Comput. Sci., 2013)

Comparison of mean hitting times for a degree-biased random walk. - Antoine Gerbaud; Karine Altisen; Stéphane Devismes; Pascal Lafourcade 001 (Discret. Appl. Math., 2014)

Self-Stabilizing ℓ-Exclusion Revisited. - Fabienne Carrier; Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (ICDCN, 2015)

Silent Self-stabilizing BFS Tree Algorithms Revised. - Stéphane Devismes; Colette Johnen (CoRR, 2015)

Weak vs. Self vs. Probabilistic Stabilization. - Stéphane Devismes; Sébastien Tixeuil; Masafumi Yamashita (Int. J. Found. Comput. Sci., 2015)

Self-stabilizing (f, g)-alliances with safe convergence. - Fabienne Carrier; Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore; Yvan Rivierre (J. Parallel Distributed Comput., 2015)

Gradual Stabilization Under tau -Dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Franck Petit (Euro-Par, 2016)

Leader Election in Rings with Bounded Multiplicity (Short Paper). - Karine Altisen; Ajoy Kumar Datta; Stéphane Devismes; Anaïs Durand; Lawrence L. Larmore (SSS, 2016)

Snap-stabilizing committee coordination. - Borzoo Bonakdarpour; Stéphane Devismes; Franck Petit (J. Parallel Distributed Comput., 2016)

Silent self-stabilizing BFS tree algorithms revisited. - Stéphane Devismes; Colette Johnen (J. Parallel Distributed Comput., 2016)

The expressive power of snap-stabilization. - Alain Cournier; Ajoy Kumar Datta; Stéphane Devismes; Franck Petit; Vincent Villain (Theor. Comput. Sci., 2016)

Competitive self-stabilizing k-clustering. - Ajoy Kumar Datta; Stéphane Devismes; Karel Heurtefeux; Lawrence L. Larmore; Yvan Rivierre (Theor. Comput. Sci., 2016)

Leader Election in Asymmetric Labeled Unidirectional Rings. - Karine Altisen; Ajoy K. Datta; Stéphane Devismes; Anaïs Durand; Lawrence L. Larmore (IPDPS, 2017)

Collision prevention in distributed 6TiSCH networks. - Ali J. Fahs; Rodolphe Bertolini; Olivier Alphand; Franck Rousseau; Karine Altisen; Stéphane Devismes (WiMob, 2017)

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. - Stéphane Devismes; David Ilcinkas; Colette Johnen (Discret. Math. Theor. Comput. Sci., 2017)

Self-stabilizing leader election in polynomial steps. - Karine Altisen; Alain Cournier; Stéphane Devismes; Anaïs Durand; Franck Petit (Inf. Comput., 2017)

Concurrency in snap-stabilizing local resource allocation. - Karine Altisen; Stéphane Devismes; Anaïs Durand (J. Parallel Distributed Comput., 2017)

A Framework for Certified Self-Stabilization. - Karine Altisen; Pierre Corbineau; Stéphane Devismes (Log. Methods Comput. Sci., 2017)

Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. - Ajoy K. Datta; Stéphane Devismes; Lawrence L. Larmore; Vincent Villain (Parallel Process. Lett., 2017)

On probabilistic snap-stabilization. - Karine Altisen; Stéphane Devismes (Theor. Comput. Sci., 2017)

Self-stabilizing silent disjunction in an anonymous network. - Ajoy K. Datta; Stéphane Devismes; Lawrence L. Larmore (Theor. Comput. Sci., 2017)

SR3: secure resilient reputation-based routing. - Karine Altisen; Stéphane Devismes; Raphaël Jamet; Pascal Lafourcade 001 (Wirel. Networks, 2017)

Acyclic Strategy for Silent Self-stabilization in Spanning Forests. - Karine Altisen; Stéphane Devismes; Anaïs Durand (SSS, 2018)

Squeezing Streams and Composition of Self-stabilizing Algorithms. - Karine Altisen; Pierre Corbineau; Stéphane Devismes (FORTE, 2019)

Silent self-stabilizing scheme for spanning-tree-like constructions. - Stéphane Devismes; David Ilcinkas; Colette Johnen (ICDCN, 2019)

Self-Stabilizing Distributed Cooperative Reset. - Stéphane Devismes; Colette Johnen (ICDCS, 2019)

Infinite Grid Exploration by Disoriented Robots. - Quentin Bramas; Stéphane Devismes; Pascal Lafourcade 001 (SIROCCO, 2019)

Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (SSS, 2019)

Optimal torus exploration by oblivious robots. - Stéphane Devismes; Anissa Lamani; Franck Petit; Sébastien Tixeuil (Computing, 2019)

Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (CoRR, 2019)

Gradual stabilization. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Franck Petit (J. Parallel Distributed Comput., 2019)

A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. - Ajoy K. Datta; Stéphane Devismes; Lawrence L. Larmore (Theor. Comput. Sci., 2019)

Introduction to Distributed Self-Stabilizing Algorithms - Karine Altisen; Stéphane Devismes; Swan Dubois; Franck Petit (Morgan & Claypool Publishers, 2019)

Versatility and Efficiency in Self-Stabilizing Distributed Systems. - Stéphane Devismes (2020)

Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Colette Johnen; Franck Petit (PODC, 2020)

Election in unidirectional rings with homonyms. - Karine Altisen; Ajoy K. Datta; Stéphane Devismes; Anaïs Durand; Lawrence L. Larmore (J. Parallel Distributed Comput., 2020)

Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. - Quentin Bramas; Pascal Lafourcade 001; Stéphane Devismes (FUN, 2021)

Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality. - Arthur Rauch; Quentin Bramas; Stéphane Devismes; Pascal Lafourcade 001; Anissa Lamani (NETYS, 2021)

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Colette Johnen; Franck Petit (PODC, 2021)

Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. - Stéphane Devismes; Anissa Lamani; Franck Petit; Pascal Raymond; Sébastien Tixeuil (Comput. J., 2021)

Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? - Quentin Bramas; Stéphane Devismes; Anaïs Durand; Pascal Lafourcade 001; Anissa Lamani (FUN, 2022)

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. - Stéphane Devismes; David Ilcinkas; Colette Johnen (Algorithmica, 2022)

Special issue of SSS 2020. - Stéphane Devismes; Neeraj Mittal (Inf. Comput., 2022)

Exploring Worst Cases of Self-stabilizing Algorithms Using Simulations. - Erwan Jahier; Karine Altisen; Stéphane Devismes (SSS, 2023)

Certified Round Complexity of Self-Stabilizing Algorithms. - Karine Altisen; Pierre Corbineau; Stéphane Devismes (DISC, 2023)

Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (CoRR, 2023)

Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (CoRR, 2023)

Certification of an exact worst-case self-stabilization time. - Karine Altisen; Pierre Corbineau; Stéphane Devismes (Theor. Comput. Sci., 2023)

Self-stabilizing systems in spite of high dynamics. - Karine Altisen; Stéphane Devismes; Anaïs Durand; Colette Johnen; Franck Petit (Theor. Comput. Sci., 2023)

sasa: a SimulAtor of Self-stabilizing Algorithms. - Karine Altisen; Stéphane Devismes; Erwan Jahier (Comput. J., 2023)

Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (Theor. Comput. Sci., 2023)

Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. - Quentin Bramas; Pascal Lafourcade 001; Stéphane Devismes (Theor. Comput. Sci., 2023)

On Self-stabilizing Leader Election in Directed Networks. - Karine Altisen; Alain Cournier; Geoffrey Defalque; Stéphane Devismes (PODC, 2024)

Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. - Colette Johnen; Stéphane Devismes; Frédéric Mazoit; David Ilcinkas (PODC, 2024)

Optimal Asynchronous Perpetual Grid Exploration. - Quentin Bramas; Stéphane Devismes; Anaïs Durand; Pascal Lafourcade 001; Anissa Lamani (SSS, 2024)

Self-stabilizing synchronous unison in directed networks. - Karine Altisen; Alain Cournier; Geoffrey Defalque; Stéphane Devismes (Theor. Comput. Sci., 2024)

Analyzing Self-Stabilization of Synchronous Unison via Propositional Satisfiability. - Asma Khoualdia; Sami Cherif; Stéphane Devismes; Léo Robert (CP, 2025)

Graph Exploration: The Impact of a Distance Constraint. - Stéphane Devismes; Yoann Dieudonné; Arnaud Labourel (ICALP, 2025)

Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. - Stéphane Devismes; David Ilcinkas; Colette Johnen; Frédéric Mazoit (STACS, 2025)

Infinite grid exploration with synchronous myopic robots without chirality. - Quentin Bramas; Pascal Lafourcade 001; Stéphane Devismes (Discret. Appl. Math., 2025)

Model checking of distributed algorithms using synchronous programs. - Erwan Jahier; Karine Altisen; Stéphane Devismes; Gabriel B. Sant'Anna (Theor. Comput. Sci., 2025)