How much memory is needed for leader election

DOI10.1007/978-3-642-15763-9_25MaRDI QIDQ3588307zbMATH OpenOpenAlexFDO

Authors Emanuele G. Fusco, Andrzej Pelc

Publication date 10 September 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-15763-9_25

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• How much memory is needed for leader election
• The space complexity of leader election in anonymous networks
• Self-stabilizing weak leader election in anonymous trees using constant memory per edge
• Time vs. information tradeoffs for leader election in anonymous trees

Cited in

(7)

• Distributed tree comparison with nodes of limited memory
• The space complexity of leader election in anonymous networks
• Time vs. information tradeoffs for leader election in anonymous trees
• Self-stabilizing weak leader election in anonymous trees using constant memory per edge
• Some bounded degree communication networks and optimal leader election
• Four shades of deterministic leader election in anonymous networks
• How much memory is needed for leader election

This page was built for publication: How much memory is needed for leader election

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