Snap-stabilizing tasks in anonymous networks

DOI10.1007/s00224-018-9868-zzbMath1425.68031OpenAlexW2807205054MaRDI QIDQ5920223

Emmanuel Godard

Publication date: 21 June 2019

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-018-9868-z

zbMATH Keywords

self-stabilizationsnap-stabilizationdistributed computabilityanonymous networks

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The expressive power of snap-stabilization
• Distributed enumeration
• Solvability of the asynchronous ranking problem
• A self-stabilizing enumeration algorithm.
• Election in partially anonymous networks with arbitrary knowledge in message passing systems
• Snap-stabilization and PIF in tree networks
• On probabilistic snap-stabilization
• Local Terminations and Distributed Computability in Anonymous Networks
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• Unreliable failure detectors for reliable distributed systems
• Introduction to Distributed Algorithms
• Universal dynamic synchronous self-stabilization
• Fibrations of graphs

This page was built for publication: Snap-stabilizing tasks in anonymous networks