Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

DOI10.1145/3039870zbMath1445.68032arXiv1505.04308OpenAlexW2619218210MaRDI QIDQ4962669

Christian Glacet, Andrzej Pelc, Avery Miller

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04308

zbMATH Keywords

treesadviceleader electiontimedeterministic distributed algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

Finding the size and the diameter of a radio network using short labels ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Lower and upper bounds for deterministic convergecast with labeling schemes ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Impact of knowledge on election time in anonymous networks ⋮ Short labeling schemes for topology recognition in wireless tree networks

This page was built for publication: Time vs. Information Tradeoffs for Leader Election in Anonymous Trees