Knowledge, level of symmetry, and time of leader election

DOI10.1007/s00446-014-0237-0zbMath1337.68038arXiv1508.01300OpenAlexW1949215090MaRDI QIDQ498667

Emanuele G. Fusco, Andrzej Pelc

Publication date: 29 September 2015

Published in: Distributed Computing, Algorithms – ESA 2012 (Search for Journal in Brave)

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

zbMATH Keywords

leader electionanonymous networklevel of symmetry

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (8)

Four shades of deterministic leader election in anonymous networks ⋮ Leader election in well-connected graphs ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Impact of knowledge on election time in anonymous networks ⋮ Topology recognition and leader election in colored networks ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ On the Complexity of Universal Leader Election ⋮ Distinguishing views in symmetric networks: a tight lower bound

Cites Work

• Unnamed Item
• Leader election in ad hoc radio networks: a keen ear helps
• How much memory is needed for leader election
• Anonymous wireless rings
• Computing Boolean functions on anonymous networks
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Sorting and election in anonymous asynchronous rings.
• Distinguishing views in symmetric networks: a tight lower bound
• Comparison of initial conditions for distributed algorithms on anonymous networks
• Computing anonymously with arbitrary knowledge
• Better computing on the anonymous ring
• Labelled (Hyper)Graphs, Negotiations and the Naming Problem
• 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
• Computing functions on asynchronous anonymous networks
• Efficient algorithms for leader election in radio networks
• Foundations of Software Science and Computation Structures
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: Knowledge, level of symmetry, and time of leader election