The following pages link to Stéphane Devismes (Q264566):
Displayed 40 items.
- The expressive power of snap-stabilization (Q264569) (← links)
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots (Q391193) (← links)
- Self-stabilizing labeling and ranking in ordered trees (Q391998) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- Self-stabilizing leader election in polynomial steps (Q528197) (← links)
- (Q666010) (redirect page) (← links)
- Stabilizing leader election in partial synchronous systems with crash failures (Q666011) (← links)
- Snap-stabilization in message-passing systems (Q666259) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- Gradual stabilization under \(\tau \)-dynamics (Q1693232) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- Optimal torus exploration by oblivious robots (Q2218466) (← links)
- Infinite grid exploration by disoriented robots (Q2303300) (← links)
- On probabilistic snap-stabilization (Q2357149) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- Comparison of mean hitting times for a degree-biased random walk (Q2449093) (← links)
- Certification of an exact worst-case self-stabilization time (Q2680867) (← links)
- Analysis of a memory-efficient self-stabilizing BFS spanning tree construction (Q2697434) (← links)
- A Framework for Certified Self-Stabilization (Q2827460) (← links)
- Analysis of Random Walks Using Tabu Lists (Q2913216) (← links)
- Weak <i>vs.</i> Self <i>vs.</i> Probabilistic Stabilization (Q2947955) (← links)
- SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS (Q2997926) (← links)
- ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS (Q3173941) (← links)
- Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps (Q3174933) (← links)
- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots (Q3408171) (← links)
- Algorithms for Extracting Timeliness Graphs (Q3569121) (← links)
- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks (Q3578305) (← links)
- (Q4560215) (← links)
- Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge (Q4598937) (← links)
- A Snap-Stabilizing DFS with a Lower Space Requirement (Q5307031) (← links)
- Introduction to Distributed Self-Stabilizing Algorithms (Q5377007) (← links)
- Self-stabilizing Silent Disjunction in an Anonymous Network (Q5507400) (← links)
- Principles of Distributed Systems (Q5713673) (← links)
- Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics (Q5855239) (← links)
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality (Q6052703) (← links)
- Self-stabilizing systems in spite of high dynamics (Q6104354) (← links)
- On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics (Q6120919) (← links)
- Acyclic strategy for silent self-stabilization in spanning forests (Q6165838) (← links)
- Squeezing streams and composition of self-stabilizing algorithms (Q6190178) (← links)