A self-stabilizing enumeration algorithm.

DOI10.1016/S0020-0190(01)00291-5MaRDI QIDQ1853019zbMATH OpenOpenAlexFDO

Authors Emmanuel Godard

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00291-5

zbMATH Keywords

Distributed computingSelf-stabilizing systemsAnonymous networksLocal computations

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Locally computable enumerations
• Probabilistic self-stabilization
• Snap-stabilizing tasks in anonymous networks
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Distributed enumeration

Cites work

• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• Distributed enumeration
• On the recognition of families of graphs with local computations
• Self-stabilizing systems in spite of distributed control

Cited in

(4)

• Locally computable enumerations
• scientific article; zbMATH DE number 2079522 (Why is no real title available?)
• Snap-stabilizing tasks in anonymous networks
• On the power of synchronization between two adjacent processes

This page was built for publication: A self-stabilizing enumeration algorithm.

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