A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks. | 0 | 0.34 | 2020 |
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. | 0 | 0.34 | 2017 |
A Stabilizing Algorithm For Finding Two Node-Disjoint Paths In Arbitrary Networks | 0 | 0.34 | 2017 |
Snap-Stabilizing PIF on Arbitrary Connected Networks in Message Passing Model. | 0 | 0.34 | 2016 |
The expressive power of snap-stabilization. | 1 | 0.36 | 2016 |
Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model. | 3 | 0.38 | 2014 |
How to meet asynchronously at polynomial cost | 15 | 0.55 | 2013 |
Deterministic geoleader election in disoriented anonymous systems | 5 | 0.47 | 2013 |
Deterministic Leader Election Among Disoriented Anonymous Sensors | 0 | 0.34 | 2012 |
Snap-Stabilizing message forwarding algorithm on tree topologies | 1 | 0.35 | 2012 |
Autour de l'autostabilisation. 2. Techniques spécialisant l'approche. | 2 | 0.38 | 2011 |
The first fully polynomial stabilizing algorithm for BFS tree construction | 12 | 0.55 | 2011 |
How to improve snap-stabilizing point-to-point communication space complexity? | 3 | 0.42 | 2011 |
Autour de l'autostabilisation. 1. Techniques généralisant l'approche. | 1 | 0.36 | 2011 |
Brief announcement: leader election vs pattern formation | 4 | 0.39 | 2010 |
Snap-stabilizing linear message forwarding | 3 | 0.41 | 2010 |
Leader election problem versus pattern formation problem | 23 | 0.97 | 2010 |
Light enabling snap-stabilization of fundamental protocols | 2 | 0.38 | 2009 |
A snap-stabilizing point-to-point communication protocol in message-switched networks | 6 | 0.48 | 2009 |
Une CNS pour l'acheminement de messages instantanément stabilisant | 0 | 0.34 | 2009 |
Synchronous vs. Asynchronous Unison | 14 | 0.62 | 2008 |
Optimal snap-stabilizing depth-first token circulation in tree networks | 7 | 0.43 | 2007 |
Self-Stabilizing Local Routing in Ad Hoc Networks | 1 | 0.36 | 2007 |
Snap-stabilization and PIF in tree networks | 36 | 1.28 | 2007 |
Snap-Stabilizing Depth-First Search on Arbitrary Networks | 6 | 0.47 | 2006 |
Toward a time-optimal odd phase clock unison in trees | 0 | 0.34 | 2006 |
Snap-stabilizing PIF and useless computations | 13 | 0.63 | 2006 |
From Self- to Snap- Stabilization | 6 | 0.46 | 2006 |
A snap-stabilizing DFS with a lower space requirement | 8 | 0.48 | 2005 |
Snap-Stabilizing detection of cutsets | 2 | 0.37 | 2005 |
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks | 16 | 0.78 | 2005 |
Snap-Stabilizing optimal binary search tree | 8 | 0.58 | 2005 |
Optimal snap-stabilizing PIF algorithms in un-oriented trees | 10 | 0.55 | 2005 |
Self-Stablizing Pivot Interval Routing in General Networks | 2 | 0.42 | 2005 |
Self-Stabilizing Optimal Local Routing in Ad Hoc Networks | 0 | 0.34 | 2005 |
When graph theory helps self-stabilization | 30 | 1.15 | 2004 |
A new self-stabilizing k-out-of-l exclusion algorithm on rings | 5 | 0.46 | 2003 |
An improved snap-stabilizing PIF algorithm | 14 | 0.67 | 2003 |
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm | 2 | 0.42 | 2002 |
Special Issue on Self-Stabilizing Distributed Systems - Guest Editors' Introduction | 0 | 0.34 | 2002 |
Protocole universel auto-stabilisant de synchronisation d'horloges de phases | 0 | 0.34 | 2002 |
Snap-stabilizing PIF algorithm in arbitrary networks | 20 | 1.15 | 2002 |
Group Mutual Exclusion in Token Rings | 6 | 0.49 | 2001 |
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller | 9 | 0.62 | 2001 |
Token Based Group Mutual Exclusion for Asynchronous Rings | 16 | 0.85 | 2001 |
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks | 15 | 0.84 | 2001 |
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks | 13 | 0.73 | 2001 |
Optimal Snap-Stabilizing PIF in Un-Oriented Trees | 8 | 0.85 | 2001 |
Optimality and Self-Stabilization in Rooted Tree Networks. | 8 | 0.51 | 2000 |
Limits and Power of the Simplest Uniform and Self-Stabilizing Phase Clock Algorithm | 0 | 0.34 | 2000 |