A wait-free classification of loop agreement tasks
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 175-185
- https://doi.org/10.1007/bfb0056482
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the decidability of distributed decision tasksPublished by Association for Computing Machinery (ACM) ,1996
- On the robustness of h m rPublished by Springer Nature ,1996
- Set consensus using arbitrary objects (preliminary version)Published by Association for Computing Machinery (ACM) ,1994
- A simple constructive computability theorem for wait-free computationPublished by Association for Computing Machinery (ACM) ,1994
- Anomalies in the wait-free hierarchyPublished by Springer Nature ,1994
- The asynchronous computability theorem for t-resilient tasksPublished by Association for Computing Machinery (ACM) ,1993
- Generalized FLP impossibility result for t-resilient asynchronous computationsPublished by Association for Computing Machinery (ACM) ,1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Renaming in an asynchronous environmentJournal of the ACM, 1990
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985