The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
The consensus problem in unreliable distributed systems (a brief survey)
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
A lower bound for the time to assure interactive consistency
Fischer, M. J., & Lynch, N. A. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90033-3 · Cited by 519
Self-citationUsing Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Lamport, L. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2993.2994 · Cited by 335
DeMillo, R. A., Lynch, N. A., & Merritt, M. J. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802214 · Cited by 234
The Weak Byzantine Generals Problem
Lamport, L. (1983) · Journal of the ACM · doi:10.1145/2402.322398 · Cited by 221
LOCUS a network transparent, high reliability distributed system
Popek, G., Walker, B., Chow, J., Edwards, D., Kline, C., Rudisin, G., & Thiel, G. (1981) · ACM SIGOPS Operating Systems Review · doi:10.1145/1067627.806605 · Cited by 215
Polynomial algorithms for multiple processor agreement
Dolev, D., & Strong, H. R. (1982) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800070.802215 · Cited by 153
An efficient algorithm for byzantine agreement without authentication
Dolev, D., Fischer, M. J., Fowler, R., Lynch, N., & Strong, H. R. (1982) · Information and Control · doi:10.1016/s0019-9958(82)90776-8 · Cited by 149
Self-citationImpossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N., & Paterson, M. S. (1983) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/588058.588060 · Cited by 149
Self-citationByzantine Generals and Transaction Commit Protocols
Lamport, L., & Fischer, M. J. (1982) · Cited by 111
Self-citationUnanimity in an unknown and unreliable environment
Dolev, D. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.53 · Cited by 61
A Simple and Efficient Byzantine Generals Algorithm.
Lynch, N., Fischer, M. J., & Fowler, R. J. (1982) · Defense Technical Information Center (DTIC) · doi:10.21236/ada113241 · Cited by 57
Self-citation'Eventual' is earlier than 'immediate'
Dolev, D., Reischuk, R., & Strong, H. R. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.51 · Cited by 57
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. J. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.41 · Cited by 52
Bounds on information exchange for Byzantine Agreement
Dolev, D., & Reischuk, R. (1982) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800220.806690 · Cited by 47
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
The control of discrete event systems
Ramadge, P. J. G., & Wonham, W. M. (1989) · Proceedings of the IEEE · doi:10.1109/5.21072 · Cited by 2,937
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Metadata
- Authors
- Fischer, M. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1983
- Pages
- 127-140
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1552521662
- Cited by
- 367
- References
- 25
- FWCI
- 7.77
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.