Daemon Conversions in Distributed Self-stabilizing Algorithms

DOI10.1007/978-3-642-36065-7_15MaRDI QIDQ4914443zbMATH OpenOpenAlexFDO

Authors Wayne Goddard, Pradip K. Srimani

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_15

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space
• scientific article; zbMATH DE number 1696677
• scientific article; zbMATH DE number 1919504
• Introduction to Distributed Self-Stabilizing Algorithms
• scientific article; zbMATH DE number 512850
• Binary self-stabilization in distributed systems
• Self-stabilizing Distributed Protocol Switching
• Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model

Cited in

(7)

• Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
• scientific article; zbMATH DE number 1696677 (Why is no real title available?)
• scientific article; zbMATH DE number 2013825 (Why is no real title available?)
• scientific article; zbMATH DE number 2036567 (Why is no real title available?)
• scientific article; zbMATH DE number 1919504 (Why is no real title available?)
• A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
• Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space

This page was built for publication: Daemon Conversions in Distributed Self-stabilizing Algorithms

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