On the complexity of computation in the presence of link failures: The case of a ring
From MaRDI portal
(Redirected from Publication:808251)
Recommendations
- Electing a leader in a ring with link failures
- On the complexity of global computation in the presence of link failures: the general case
- On the complexity of global computation in the presence of link failures: the case of uni-directional faults
- Two lower bounds in asynchronous distributed computation
- Gap Theorems for Distributed Computation
Cites work
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- Computing on an anonymous ring
- Decentralized extrema-finding in circular configurations of processors
- Electing a leader in a ring with link failures
- scientific article; zbMATH DE number 3819094 (Why is no real title available?)
- On describing the behavior and implementation of distributed systems
- On the complexity of computation in the presence of link failures: The case of a ring
- The multi-tree approach to reliability in distributed networks
Cited in
(4)- A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers
- On the complexity of global computation in the presence of link failures: the general case
- On the complexity of global computation in the presence of link failures: the case of uni-directional faults
- On the complexity of computation in the presence of link failures: The case of a ring
This page was built for publication: On the complexity of computation in the presence of link failures: The case of a ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808251)
