How much memory is needed for leader election
From MaRDI portal
Publication:661049
DOI10.1007/s00446-011-0131-yzbMath1231.68074OpenAlexW1992598604MaRDI QIDQ661049
Andrzej Pelc, Emanuele G. Fusco
Publication date: 6 February 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0131-y
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items (7)
Distributed tree comparison with nodes of limited memory ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Topology recognition and leader election in colored networks ⋮ Topology recognition with advice ⋮ Anonymous meeting in networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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.
- Universal traversal sequences with backtracking.
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Comparison of initial conditions for distributed algorithms on anonymous networks
- Computing anonymously with arbitrary knowledge
- Better computing on the anonymous ring
- Deterministic Rendezvous in Trees with Little Memory
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Undirected connectivity in log-space
- 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
- Space Lower Bounds for Maze Threadability on Restricted Machines
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- How to meet when you forget
- Foundations of Software Science and Computation Structures
- STACS 2004
- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
- Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks
- Randomized Rendez-Vous with Limited Memory
- SOFSEM 2005: Theory and Practice of Computer Science
This page was built for publication: How much memory is needed for leader election
