Fast randomized consensus using shared memory
- 3 September 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (3) , 441-461
- https://doi.org/10.1016/0196-6774(90)90021-6
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- On interprocess communicationDistributed Computing, 1986
- Introduction to the theory of nested transactionsLecture Notes in Computer Science, 1986
- A Simple and Efficient Randomized Byzantine Agreement AlgorithmIEEE Transactions on Software Engineering, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Concurrent Reading While WritingACM Transactions on Programming Languages and Systems, 1983
- Concurrent reading and writingCommunications of the ACM, 1977