Four shades of deterministic leader election in anonymous networks

DOI10.1007/s00446-023-00451-3arXiv2009.06149OpenAlexW3085992258MaRDI QIDQ6071119

Barun Gorain, Andrzej Pelc, Avery Miller

Publication date: 21 November 2023

Published in: Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

adviceleader electionanonymous networksdeterministic distributed algorithms

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topology recognition with advice
• Leader election in ad hoc radio networks: a keen ear helps
• Drawing maps with advice
• Knowledge, level of symmetry, and time of leader election
• Online computation with advice
• Trade-offs between the size of advice and broadcasting time in trees
• Local MST computation with short advice
• How much memory is needed for leader election
• Tree exploration with advice
• Fast radio broadcasting with advice
• Communication algorithms with advice
• Graph searching with advice
• Sorting and election in anonymous asynchronous rings.
• Impact of knowledge on election time in anonymous networks
• Leader election for anonymous asynchronous agents in arbitrary networks
• Proof labeling schemes
• Distributed computing with advice: information sensitivity of graph coloring
• Computing anonymously with arbitrary knowledge
• Better computing on the anonymous ring
• Approximate distance oracles
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Electing a leader in a synchronous ring
• Computing on an anonymous ring
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• Distributed Computing: A Locality-Sensitive Approach
• Labeling Schemes for Flow and Connectivity
• Distance labeling in graphs
• Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
• Efficient algorithms for leader election in radio networks

This page was built for publication: Four shades of deterministic leader election in anonymous networks