Assigning labels in an unknown anonymous network with a leader
From MaRDI portal
Publication:5138359
DOI10.1007/PL00008935zbMath1448.68046OpenAlexW2064766370MaRDI QIDQ5138359
Stéphane Pérennes, Andrzej Pelc, Pierre Fraigniaud, David Peleg
Publication date: 3 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00008935
Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (3)
Node labels in local decision ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
Cites Work
- Anonymous wireless rings
- A new distributed depth-first-search algorithm
- Computing Boolean functions on anonymous networks
- Comparison of initial conditions for distributed algorithms on anonymous networks
- Computing anonymously with arbitrary knowledge
- Better computing on the anonymous ring
- A trade-off between information and communication in broadcast protocols
- Computing on an anonymous ring
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Assigning labels in an unknown anonymous network with a leader