On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics | 0 | 0.34 | 2021 |
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. | 0 | 0.34 | 2021 |
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots | 0 | 0.34 | 2021 |
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics | 0 | 0.34 | 2020 |
Election in unidirectional rings with homonyms | 0 | 0.34 | 2020 |
Infinite Grid Exploration by Disoriented Robots. | 0 | 0.34 | 2020 |
Squeezing Streams and Composition of Self-stabilizing Algorithms. | 0 | 0.34 | 2019 |
Gradual stabilization. | 0 | 0.34 | 2019 |
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. | 0 | 0.34 | 2019 |
Silent self-stabilizing scheme for spanning-tree-like constructions. | 0 | 0.34 | 2019 |
Infinite Grid Exploration by Disoriented Robots. | 0 | 0.34 | 2019 |
Self-Stabilizing Distributed Cooperative Reset | 1 | 0.36 | 2019 |
Acyclic Strategy For Silent Self-Stabilization In Spanning Forests | 0 | 0.34 | 2018 |
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. | 0 | 0.34 | 2017 |
Concurrency in Snap-Stabilizing Local Resource Allocation. | 0 | 0.34 | 2017 |
Leader Election in Asymmetric Labeled Unidirectional Rings | 1 | 0.35 | 2017 |
A Framework for Certified Self-Stabilization. | 1 | 0.35 | 2016 |
The expressive power of snap-stabilization. | 1 | 0.36 | 2016 |
Silent Self-stabilizing BFS Tree Algorithms Revised. | 1 | 0.37 | 2016 |
Competitive self-stabilizing k-clustering. | 0 | 0.34 | 2016 |
Gradual Stabilization Under \tau -Dynamics. | 0 | 0.34 | 2016 |
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. | 1 | 0.35 | 2016 |
Leader Election in Rings with Bounded Multiplicity (Short Paper). | 0 | 0.34 | 2016 |
Optimal Torus Exploration by Oblivious Robots | 3 | 0.38 | 2015 |
Self-Stabilizing ℓ-Exclusion Revisited | 0 | 0.34 | 2015 |
Self-stabilizing Leader Election in Polynomial Steps. | 9 | 0.55 | 2014 |
Comparison of mean hitting times for a degree-biased random walk. | 1 | 0.35 | 2014 |
On Probabilistic Snap-Stabilization | 1 | 0.36 | 2014 |
SR3: Secure Resilient Reputation-based Routing | 4 | 0.45 | 2013 |
Self-stabilizing labeling and ranking in ordered trees. | 0 | 0.34 | 2013 |
Optimal probabilistic ring exploration by semi-synchronous oblivious robots | 30 | 1.32 | 2013 |
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks | 1 | 0.36 | 2013 |
Self-stabilizing (f,g)-Alliances with Safe Convergence | 3 | 0.38 | 2013 |
Self-Stabilizing Small k-Dominating Sets. | 9 | 0.66 | 2013 |
Self-stabilizing Silent Disjunction in an Anonymous Network. | 2 | 0.38 | 2013 |
Algorithme autostabilisant construisant un petit ensemble k-dominant. | 0 | 0.34 | 2012 |
Optimal grid exploration by asynchronous oblivious robots | 23 | 1.08 | 2012 |
Brief announcement: self-stabilizing silent disjunction in an anonymous network | 1 | 0.35 | 2012 |
On efficiency of unison | 2 | 0.37 | 2012 |
Analysis of random walks using tabu lists | 1 | 0.36 | 2012 |
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche. | 2 | 0.38 | 2011 |
Brief announcement: sorting on skip chains | 0 | 0.34 | 2011 |
Asymptotically Optimal Deterministic Rendezvous | 0 | 0.34 | 2011 |
Self-stabilizing labeling and ranking in ordered trees | 0 | 0.34 | 2011 |
Autour de l'autostabilisation. 1. Techniques généralisant l'approche. | 1 | 0.36 | 2011 |
Optimal exploration of small rings | 5 | 0.46 | 2010 |
Probabilistic self-stabilizing vertex coloring in unidirectional anonymous networks | 2 | 0.40 | 2010 |
Approximation of delta-Timeliness | 0 | 0.34 | 2010 |
Algorithms for extracting timeliness graphs | 4 | 0.43 | 2010 |
Space-Optimal Deterministic Rendezvous | 1 | 0.36 | 2009 |