Leader election for anonymous asynchronous agents in arbitrary networks
From MaRDI portal
Publication:2251147
DOI10.1007/s00446-013-0196-xzbMath1291.68044arXiv1205.6249OpenAlexW2078479354WikidataQ59322974 ScholiaQ59322974MaRDI QIDQ2251147
Dariusz Dereniowski, Andrzej Pelc
Publication date: 11 July 2014
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.6249
Related Items (6)
Amorphous computing: examples, mathematics and theory ⋮ Four shades of deterministic leader election in anonymous networks ⋮ 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? ⋮ Distinguishing views in symmetric networks: a tight lower bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Leader election in ad hoc radio networks: a keen ear helps
- How much memory is needed for leader election
- Anonymous wireless rings
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Computing Boolean functions on anonymous networks
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- The theory of search games and rendezvous.
- Sorting and election in anonymous asynchronous rings.
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Asynchronous deterministic rendezvous in graphs
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Comparison of initial conditions for distributed algorithms on anonymous networks
- Computing anonymously with arbitrary knowledge
- Tree exploration with logarithmic memory
- How to meet asynchronously (almost) everywhere
- Better computing on the anonymous ring
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Tell Me Where I Am So I Can Meet You Sooner
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- 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
- Computing functions on asynchronous anonymous networks
- Efficient algorithms for leader election in radio networks
- How to meet asynchronously at polynomial cost
- Foundations of Software Science and Computation Structures
- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
- SOFSEM 2005: Theory and Practice of Computer Science
- Anonymous Meeting in Networks
- LATIN 2004: Theoretical Informatics
This page was built for publication: Leader election for anonymous asynchronous agents in arbitrary networks
