A self-stabilizing enumeration algorithm.

DOI10.1016/S0020-0190(01)00291-5zbMATH Open1051.68038OpenAlexW2131728971MaRDI QIDQ1853019FDOQ1853019

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

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

zbMATH Keywords

Distributed computingSelf-stabilizing systemsAnonymous networksLocal computations

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Self-stabilizing systems in spite of distributed control
• Title not available (Why is that?)
• Distributed enumeration
• On the recognition of families of graphs with local computations

Cited In (4)

• Locally computable enumerations
• Title not available (Why is that?)
• 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)