Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space

DOI10.1007/978-3-540-77444-0_16MaRDI QIDQ5445748zbMATH OpenOpenAlexFDO

Authors

Publication date 6 March 2008

Published in Distributed Computing and Networking (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Daemon Conversions in Distributed Self-stabilizing Algorithms
• Randomization adaptive self-stabilization
• Self-stabilization: Randomness to reduce space
• A self-stabilizing algorithm for maximal matching in anonymous networks
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

Cited in

(2)

• Making randomized algorithms self-stabilizing
• Daemon Conversions in Distributed Self-stabilizing Algorithms

This page was built for publication: Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space

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