Message terminating algorithms for anonymous rings of unknown size
From MaRDI portal
Publication:673475
DOI10.1016/0020-0190(94)00237-SzbMath0875.68447OpenAlexW2037911865MaRDI QIDQ673475
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00237-s
Related Items
A variation of the Newton-Pepys problem and its connections to size-estimation problems ⋮ Hundreds of impossibility results for distributed computing ⋮ Message terminating algorithms for anonymous rings of unknown size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Message terminating algorithms for anonymous rings of unknown size
- Symmetry breaking in distributed networks
- Calling names on nameless networks
- Uniform self-stabilizing ring orientation
- Better computing on the anonymous ring
- Lower Bounds for Distributed Maximum-Finding Algorithms
- A lower bound for probabilistic distributed algorithms
- Computing on an anonymous ring
- Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings