default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Devismes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[e5]Quentin Bramas
, Bapi Chatterjee, Stéphane Devismes, Malcolm Egan, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, V. Vijaya Saradhi:
Distributed Computing and Intelligent Technology - 21st International Conference, ICDCIT 2025, Bhubaneswar, India, January 8-11, 2025, Proceedings. Lecture Notes in Computer Science 15507, Springer 2025, ISBN 978-3-031-81403-7 [contents]- 2024
- [j43]Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes:
Self-stabilizing synchronous unison in directed networks. Theor. Comput. Sci. 1001: 114577 (2024) - [c71]Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes:
On Self-stabilizing Leader Election in Directed Networks. PODC 2024: 527-537 - [c70]Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas:
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. PODC 2024: 538-548 - [c69]Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Optimal Asynchronous Perpetual Grid Exploration. SSS 2024: 89-105 - [e4]Stéphane Devismes, Partha Sarathi Mandal, V. Vijaya Saradhi, Bhanu Prasad, Anisur Rahaman Molla, Gokarna Sharma:
Distributed Computing and Intelligent Technology - 20th International Conference, ICDCIT 2024, Bhubaneswar, India, January 17-20, 2024, Proceedings. Lecture Notes in Computer Science 14501, Springer 2024, ISBN 978-3-031-50582-9 [contents] - [i18]Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel:
Graph Exploration: The Impact of a Distance Constraint. CoRR abs/2410.13386 (2024) - 2023
- [j42]Karine Altisen, Stéphane Devismes, Erwan Jahier:
sasa: a SimulAtor of Self-stabilizing Algorithms. Comput. J. 66(4): 796-814 (2023) - [j41]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Certification of an exact worst-case self-stabilization time. Theor. Comput. Sci. 941: 262-277 (2023) - [j40]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. Theor. Comput. Sci. 955: 113804 (2023) - [j39]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Self-stabilizing systems in spite of high dynamics. Theor. Comput. Sci. 964: 113966 (2023) - [j38]Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theor. Comput. Sci. 977: 114162 (2023) - [c68]Karine Altisen, Alain Cournier, Geoffrey Defalque, Stéphane Devismes:
Self-stabilizing Synchronous Unison in Directed Networks. ICDCN 2023: 115-124 - [c67]Erwan Jahier, Karine Altisen, Stéphane Devismes:
Exploring Worst Cases of Self-stabilizing Algorithms Using Simulations. SSS 2023: 1-17 - [c66]Erwan Jahier, Karine Altisen, Stéphane Devismes, Gabriel B. Sant'Anna:
Model Checking of Distributed Algorithms Using Synchronous Programs. SSS 2023: 18-35 - [c65]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Certified Round Complexity of Self-Stabilizing Algorithms. DISC 2023: 2:1-2:22 - [i17]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit:
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR abs/2307.06635 (2023) - [i16]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit:
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. CoRR abs/2307.16593 (2023) - 2022
- [j37]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica 84(1): 85-123 (2022) - [j36]Stéphane Devismes, Neeraj Mittal:
Special issue of SSS 2020. Inf. Comput. 289(Part): 104955 (2022) - [c64]Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? FUN 2022: 7:1-7:21 - [e3]Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernández Anta:
Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15-17, 2022, Proceedings. Lecture Notes in Computer Science 13751, Springer 2022, ISBN 978-3-031-21016-7 [contents] - 2021
- [j35]Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil:
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64(1): 132-154 (2021) - [c63]Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. FUN 2021: 6:1-6:19 - [c62]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Certification of an Exact Worst-Case Self-Stabilization Time. ICDCN 2021: 46-55 - [c61]Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality. ICDCN 2021: 76-85 - [c60]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Self-stabilizing Systems in Spite of High Dynamics. ICDCN 2021: 156-165 - [c59]Arthur Rauch, Quentin Bramas, Stéphane Devismes, Pascal Lafourcade, Anissa Lamani:
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality. NETYS 2021: 95-110 - [c58]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC 2021: 21-31 - 2020
- [b3]Stéphane Devismes:
Versatility and Efficiency in Self-Stabilizing Distributed Systems. Grenoble Alpes University, France, 2020 - [j34]Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Election in unidirectional rings with homonyms. J. Parallel Distributed Comput. 146: 79-95 (2020) - [c57]Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. NETYS 2020: 129-145 - [c56]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. PODC 2020: 227-229 - [c55]Karine Altisen, Stéphane Devismes, Erwan Jahier:
sasa: A SimulAtor of Self-stabilizing Algorithms. TAP@STAF 2020: 143-154 - [e2]Stéphane Devismes, Neeraj Mittal:
Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18-21, 2020, Proceedings. Lecture Notes in Computer Science 12514, Springer 2020, ISBN 978-3-030-64347-8 [contents]
2010 – 2019
- 2019
- [b2]Karine Altisen, Stéphane Devismes, Swan Dubois, Franck Petit:
Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00885-6 - [j33]Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil:
Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019) - [j32]Karine Altisen, Stéphane Devismes, Anaïs Durand, Franck Petit:
Gradual stabilization. J. Parallel Distributed Comput. 123: 26-45 (2019) - [j31]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Theor. Comput. Sci. 753: 35-63 (2019) - [c54]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Squeezing Streams and Composition of Self-stabilizing Algorithms. FORTE 2019: 21-38 - [c53]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Silent self-stabilizing scheme for spanning-tree-like constructions. ICDCN 2019: 158-167 - [c52]Stéphane Devismes, Colette Johnen:
Self-Stabilizing Distributed Cooperative Reset. ICDCS 2019: 379-389 - [c51]Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. SIROCCO 2019: 340-344 - [c50]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. SSS 2019: 99-104 - [i15]Stéphane Devismes, Colette Johnen:
Self-Stabilizing Distributed Cooperative Reset. CoRR abs/1901.03587 (2019) - [i14]Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. CoRR abs/1905.09271 (2019) - [i13]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR abs/1907.07944 (2019) - 2018
- [c49]Karine Altisen, Stéphane Devismes, Anaïs Durand:
Acyclic Strategy for Silent Self-stabilization in Spanning Forests. SSS 2018: 186-202 - [i12]Karine Altisen, Stéphane Devismes, Anaïs Durand:
Acyclic Strategy for Silent Self-Stabilization in Spanning Forests. CoRR abs/1805.02401 (2018) - 2017
- [j30]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j29]Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit:
Self-stabilizing leader election in polynomial steps. Inf. Comput. 254: 330-366 (2017) - [j28]Karine Altisen, Stéphane Devismes, Anaïs Durand:
Concurrency in snap-stabilizing local resource allocation. J. Parallel Distributed Comput. 102: 42-56 (2017) - [j27]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
A Framework for Certified Self-Stabilization. Log. Methods Comput. Sci. 13(4) (2017) - [j26]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Vincent Villain:
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. Parallel Process. Lett. 27(2): 1750002:1-1750002:18 (2017) - [j25]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-stabilizing silent disjunction in an anonymous network. Theor. Comput. Sci. 665: 51-72 (2017) - [j24]Karine Altisen, Stéphane Devismes:
On probabilistic snap-stabilization. Theor. Comput. Sci. 688: 49-76 (2017) - [j23]Karine Altisen, Stéphane Devismes, Raphaël Jamet, Pascal Lafourcade:
SR3: secure resilient reputation-based routing. Wirel. Networks 23(7): 2111-2133 (2017) - [c48]Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS 2017: 182-191 - [c47]Ali J. Fahs, Rodolphe Bertolini, Olivier Alphand, Franck Rousseau, Karine Altisen, Stéphane Devismes:
Collision prevention in distributed 6TiSCH networks. WiMob 2017: 1-6 - [i11]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. CoRR abs/1703.03315 (2017) - 2016
- [j22]Borzoo Bonakdarpour, Stéphane Devismes, Franck Petit:
Snap-stabilizing committee coordination. J. Parallel Distributed Comput. 87: 26-42 (2016) - [j21]Stéphane Devismes, Colette Johnen:
Silent self-stabilizing BFS tree algorithms revisited. J. Parallel Distributed Comput. 97: 11-23 (2016) - [j20]Alain Cournier, Ajoy Kumar Datta, Stéphane Devismes, Franck Petit, Vincent Villain:
The expressive power of snap-stabilization. Theor. Comput. Sci. 626: 40-66 (2016) - [j19]Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre:
Competitive self-stabilizing k-clustering. Theor. Comput. Sci. 626: 110-133 (2016) - [c46]Karine Altisen, Stéphane Devismes, Anaïs Durand, Franck Petit:
Gradual Stabilization Under \tau -Dynamics. Euro-Par 2016: 588-602 - [c45]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
A Framework for Certified Self-Stabilization. FORTE 2016: 36-51 - [c44]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. OPODIS 2016: 10:1-10:16 - [c43]Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Leader Election in Rings with Bounded Multiplicity (Short Paper). SSS 2016: 1-6 - [i10]Karine Altisen, Pierre Corbineau, Stéphane Devismes:
A Framework for Certified Self-Stabilization. CoRR abs/1610.08685 (2016) - 2015
- [j18]Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
Weak vs. Self vs. Probabilistic Stabilization. Int. J. Found. Comput. Sci. 26(3): 293-320 (2015) - [j17]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing (f, g)-alliances with safe convergence. J. Parallel Distributed Comput. 81-82: 11-23 (2015) - [c42]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-Stabilizing ℓ-Exclusion Revisited. ICDCN 2015: 3:1-3:10 - [c41]Karine Altisen, Stéphane Devismes, Anaïs Durand:
Concurrency in Snap-Stabilizing Local Resource Allocation. NETYS 2015: 77-93 - [c40]Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil:
Optimal Torus Exploration by Oblivious Robots. NETYS 2015: 183-199 - [i9]Stéphane Devismes, Colette Johnen:
Silent Self-stabilizing BFS Tree Algorithms Revised. CoRR abs/1509.03815 (2015) - 2014
- [j16]Antoine Gerbaud, Karine Altisen, Stéphane Devismes, Pascal Lafourcade:
Comparison of mean hitting times for a degree-biased random walk. Discret. Appl. Math. 170: 104-109 (2014) - [c39]Karine Altisen, Stéphane Devismes:
On Probabilistic Snap-Stabilization. ICDCN 2014: 272-286 - [c38]Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit:
Self-stabilizing Leader Election in Polynomial Steps. SSS 2014: 106-119 - 2013
- [j15]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre:
Self-Stabilizing Small k-Dominating Sets. Int. J. Netw. Comput. 3(1): 116-136 (2013) - [j14]Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil:
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. J. Comb. Optim. 25(3): 430-459 (2013) - [j13]Ajoy Kumar Datta, Stéphane Devismes:
Preface. Theor. Comput. Sci. 496: 1 (2013) - [j12]Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor. Comput. Sci. 498: 10-27 (2013) - [j11]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing labeling and ranking in ordered trees. Theor. Comput. Sci. 512: 49-66 (2013) - [c37]Karine Altisen, Stéphane Devismes, Raphaël Jamet, Pascal Lafourcade:
SR3: Secure Resilient Reputation-based Routing. DCOSS 2013: 258-265 - [c36]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-stabilizing Silent Disjunction in an Anonymous Network. ICDCN 2013: 148-160 - [c35]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil:
Fast Leader (Full) Recovery Despite Dynamic Faults. ICDCN 2013: 428-433 - [c34]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Sébastien Tixeuil:
Fast Leader (Full) Recovery Despite Dynamic Faults. IPDPS Workshops 2013: 716-725 - [c33]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing (f, g)-Alliances with Safe Convergence. SSS 2013: 61-73 - 2012
- [j10]Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre:
Algorithme autostabilisant construisant un petit ensemble k-dominant. Tech. Sci. Informatiques 31(8-10): 1273-1299 (2012) - [c32]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre:
Competitive Self-Stabilizing k-Clustering. ICDCS 2012: 476-485 - [c31]Karine Altisen, Stéphane Devismes, Antoine Gerbaud, Pascal Lafourcade:
Analysis of Random Walks Using Tabu Lists. SIROCCO 2012: 254-266 - [c30]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. SSS 2012: 46-48 - [c29]Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil:
Optimal Grid Exploration by Asynchronous Oblivious Robots. SSS 2012: 64-76 - [c28]Stéphane Devismes, Franck Petit:
On efficiency of unison. TADDS 2012: 20-25 - [e1]Luciano Bononi, Ajoy Kumar Datta, Stéphane Devismes, Archan Misra:
Distributed Computing and Networking - 13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012. Proceedings. Lecture Notes in Computer Science 7129, Springer 2012, ISBN 978-3-642-25958-6 [contents] - 2011
- [j9]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. 22(3): 657-677 (2011) - [j8]Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre:
Asymptotically Optimal Deterministic Rendezvous. Int. J. Found. Comput. Sci. 22(5): 1143-1159 (2011) - [j7]Stéphane Devismes, Franck Petit, Vincent Villain:
Autour de l'autostabilisation. 1. Techniques généralisant l'approche. Tech. Sci. Informatiques 30(7): 873-894 (2011) - [j6]Stéphane Devismes, Franck Petit, Vincent Villain:
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche. Tech. Sci. Informatiques 30(7): 895-922 (2011) - [c27]Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore:
Self-Stabilizing Small k-Dominating Sets. ICNC 2011: 30-39 - [c26]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes:
Sorting on Skip Chains. ICNC 2011: 193-199 - [c25]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru:
Multi-resource Allocation with Unknown Participants. ICNC 2011: 200-206 - [c24]Borzoo Bonakdarpour, Stéphane Devismes, Franck Petit:
Snap-Stabilizing Committee Coordination. IPDPS 2011: 231-242 - [c23]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing Labeling and Ranking in Ordered Trees. SSS 2011: 148-162 - [c22]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Sorting on Skip Chains. SSS 2011: 443-444 - [i8]Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil:
Optimal grid exploration by asynchronous oblivious robots. CoRR abs/1105.2461 (2011) - 2010
- [j5]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier:
Stabilizing leader election in partial synchronous systems with crash failures. J. Parallel Distributed Comput. 70(1): 45-58 (2010) - [j4]Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil:
Snap-stabilization in message-passing systems. J. Parallel Distributed Comput. 70(12): 1220-1230 (2010) - [c21]Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil:
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks. COCOON 2010: 80-89 - [c20]Samuel Bernard, Stéphane Devismes, Katy Paroux, Maria Potop-Butucaru, Sébastien Tixeuil:
Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks. ICDCN 2010: 167-177 - [c19]Stéphane Devismes:
Optimal exploration of small rings. WRAS 2010: 9 - [c18]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Mikel Larrea:
Algorithms for Extracting Timeliness Graphs. SIROCCO 2010: 127-141 - [c17]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier:
Approximation of delta-Timeliness. SSS 2010: 435-451 - [i7]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Mikel Larrea:
Algorithms For Extracting Timeliness Graphs. CoRR abs/1003.1058 (2010)
2000 – 2009
- 2009
- [j3]Alain Cournier, Stéphane Devismes, Vincent Villain:
Light enabling snap-stabilization of fundamental protocols. ACM Trans. Auton. Adapt. Syst. 4(1): 6:1-6:27 (2009) - [c16]Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil:
Snap-Stabilization in Message-Passing Systems. ICDCN 2009: 281-286 - [c15]Stéphane Devismes, Toshimitsu Masuzawa, Sébastien Tixeuil:
Communication Efficiency in Self-Stabilizing Silent Protocols. ICDCS 2009: 474-481 - [c14]Samuel Bernard, Stéphane Devismes, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks. IPDPS 2009: 1-8 - [c13]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-Stabilizing k-out-of-l exclusion on tree networks. IPDPS 2009: 1-8 - [c12]Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre:
Space-Optimal Deterministic Rendezvous. PDCAT 2009: 342-347 - [c11]Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots. SIROCCO 2009: 195-208 - [c10]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
A Self-Stabilizing O(n)-Round k-Clustering Algorithm. SRDS 2009: 147-155 - [i6]Stéphane Devismes, Franck Petit, Sébastien Tixeuil:
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots. CoRR abs/0902.1834 (2009) - 2008
- [c9]Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
Weak vs. Self vs. Probabilistic Stabilization. ICDCS 2008: 681-688 - [c8]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam Toueg:
With Finite Memory Consensus Is Easier Than Reliable Broadcast. OPODIS 2008: 41-57 - [c7]Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil:
Snap-stabilization in message-passing systems. PODC 2008: 443 - [i5]Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil:
Snap-Stabilization in Message-Passing Systems. CoRR abs/0802.1123 (2008) - [i4]Samuel Bernard, Stéphane Devismes, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
Bounds for self-stabilization in unidirectional networks. CoRR abs/0805.0851 (2008) - [i3]Stéphane Devismes, Toshimitsu Masuzawa, Sébastien Tixeuil:
Communication Efficiency in Self-stabilizing Silent Protocols. CoRR abs/0811.3760 (2008) - [i2]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-stabilizing K-out-of-L exclusion on tree network. CoRR abs/0812.1093 (2008) - 2007
- [c6]Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier:
Robust Stabilizing Leader Election. SSS 2007: 219-233 - [i1]Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
Weak vs. Self vs. Probabilistic Stabilization. CoRR abs/0711.3672 (2007) - 2006
- [b1]Stéphane Devismes:
Quelques Contributions à la Stabilisation Instantanée. (Some Contributions to Snap-Stabilization). University of Picardie Jules Verne, Amiens, France, 2006 - [j2]Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain:
Snap-Stabilizing Depth-First Search on Arbitrary Networks. Comput. J. 49(3): 268-280 (2006) - [c5]Alain Cournier, Stéphane Devismes, Vincent Villain:
Snap-Stabilizing PIF and Useless Computations. ICPADS (1) 2006: 39-48 - [c4]Alain Cournier, Stéphane Devismes, Vincent Villain:
From Self- to Snap- Stabilization. SSS 2006: 199-213 - 2005
- [j1]Stéphane Devismes:
A Silent Self-stabilizing Algorithm for Finding Cut-nodes and Bridges. Parallel Process. Lett. 15(1-2): 183-198 (2005) - [c3]Alain Cournier, Stéphane Devismes, Vincent Villain:
Snap-Stabilizing Detection of Cutsets. HiPC 2005: 488-497 - [c2]Alain Cournier, Stéphane Devismes, Vincent Villain:
A Snap-Stabilizing DFS with a Lower Space Requirement. Self-Stabilizing Systems 2005: 33-47 - 2004
- [c1]Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain:
Snap-Stabilizing Depth-First Search on Arbitrary Networks. OPODIS 2004: 267-282
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
