Local Terminations and Distributed Computability in Anonymous Networks

DOI10.1007/978-3-540-87779-0_4MaRDI QIDQ3540220zbMATH OpenOpenAlexFDO

Authors J. Chalopin, Emmanuel Godard, Yves Métivier

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87779-0_4

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 2006642
• Computability in anonymous networks: revocable vs. irrecovable outputs
• What Can be Computed Locally?
• A characterization of \(t\)-resilient colorless task anonymous solvability
• About the Termination Detection in the Asynchronous Message Passing Model

Cited in

(7)

• On mobile agent verifiable problems
• Locality and checkability in wait-free computing
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• Infinite networks, halting and local algorithms
• Computability in anonymous networks: revocable vs. irrecovable outputs
• Snap-stabilizing tasks in anonymous networks
• Universal finite-state and self-stabilizing computation in anonymous dynamic networks

This page was built for publication: Local Terminations and Distributed Computability in Anonymous Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540220)