Tight bounds on the round complexity of distributed 1-solvable tasks
From MaRDI portal
Publication:673104
DOI10.1016/0304-3975(94)00157-EzbMath0874.68144OpenAlexW1980697798MaRDI QIDQ673104
Ofer Biran, Shmuel Zaks, Shlomo Moran
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)00157-e
Related Items (2)
Hundreds of impossibility results for distributed computing ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
Cites Work
- Initial failures in distributed computations
- Asynchronous approximate agreement
- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Renaming in an asynchronous environment
- A combinatorial characterization of the distributed 1-solvable tasks
- Reaching approximate agreement in the presence of faults
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- The asynchronous computability theorem for t-resilient tasks
This page was built for publication: Tight bounds on the round complexity of distributed 1-solvable tasks
