On the complexity of computation in the presence of link failures: The case of a ring
From MaRDI portal
Publication:808251
DOI10.1007/BF02252955zbMath0731.68045MaRDI QIDQ808251
Publication date: 1991
Published in: Distributed Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (2)
On the complexity of global computation in the presence of link failures: the general case ⋮ On the complexity of computation in the presence of link failures: The case of a ring
Cites Work
- Unnamed Item
- On the complexity of computation in the presence of link failures: The case of a ring
- Electing a leader in a ring with link failures
- The multi-tree approach to reliability in distributed networks
- On describing the behavior and implementation of distributed systems
- 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
- 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: On the complexity of computation in the presence of link failures: The case of a ring
