The topological structure of asynchronous computability
- 1 November 1999
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 46 (6) , 858-923
- https://doi.org/10.1145/331524.331529
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A wait-free classification of loop agreement tasksPublished by Springer Nature ,1998
- 3-processor tasks are undecidablePublished by Association for Computing Machinery (ACM) ,1995
- Immediate atomic snapshots and fast renamingPublished by Association for Computing Machinery (ACM) ,1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Renaming in an asynchronous environmentJournal of the ACM, 1990
- On processor coordination using asynchronous hardwarePublished by Association for Computing Machinery (ACM) ,1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- HomologyPublished by Springer Nature ,1966