Anonymous wireless rings
From MaRDI portal
Publication:673090
DOI10.1016/0304-3975(94)00178-LzbMath0874.68013OpenAlexW2029618506MaRDI QIDQ673090
Evangelos Kranakis, Krzysztof Diks, Andrzej Pelc, Adam Malinowski
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00178-l
Related Items (8)
Node labels in local decision ⋮ Distributed tree comparison with nodes of limited memory ⋮ Assigning labels in an unknown anonymous network with a leader ⋮ How much memory is needed for leader election ⋮ 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 ⋮ Weak models of distributed computing, with connections to modal logic
Cites Work
- Bit-optimal election in synchronous rings
- Randomized function evaluation on a ring
- Language complexity on the synchronous anonymous ring
- Complexity of network synchronization
- Electing a leader in a synchronous ring
- Computing on an anonymous ring
- The Bit Complexity of Randomized Leader Election on a Ring
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
This page was built for publication: Anonymous wireless rings
