Asymptotically optimal algorithms for approximate agreement
Author:
- 1 March 1990
- journal article
- research article
- Published by Springer Nature in Distributed Computing
- Vol. 4 (1) , 9-29
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- A communication-efficient canonical form for fault-tolerant distributed protocols1986
- Knowledge and Common Knowledge in a Byzantine Environment I: Crash failures1986
- Synchronizing clocks in the presence of faultsJournal of the ACM, 1985
- An upper and lower bound for clock synchronizationInformation and Control, 1984
- Fault-tolerant clock synchronization1984
- The consensus problem in unreliable distributed systems (a brief survey)1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982