Time-and space-efficient randomized consensus
Author:
Open Access
- 1 August 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 325-331
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Sticky bits and universality of consensus1989
- Bounded polynomial randomized consensus1989
- Solvability in asynchronous environments1989
- On achieving consensus using a shared memory1988
- Impossibility and universality results for wait-free synchronization1988
- On processor coordination using asynchronous hardware1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985