The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Easy impossibility proofs for distributed consensus problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
Self-citationThe Weak Byzantine Generals Problem
Lamport, L. (1983) · Journal of the ACM · doi:10.1145/2402.322398 · Cited by 221
Mahaney, S. R., & Schneider, F. B. (1985) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/323596.323618 · Cited by 115
On the possibility and impossibility of achieving clock synchronization
Dolev, D., Halpern, J., & Strong, H. R. (1984) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800057.808720 · Cited by 66
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
Self-citationPerfectly secure message transmission
Dolev, D., Dwork, C., Waarts, O., & Yung, M. (1993) · Journal of the ACM · doi:10.1145/138027.138036 · Cited by 412
The consensus problem in fault-tolerant computing
Barborak, M., Dahbura, A., & Malek, M. (1993) · ACM Computing Surveys · doi:10.1145/152610.152612 · Cited by 400
SBFT: A Scalable and Decentralized Trust Infrastructure
Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2019) · 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00063 · Cited by 362
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Gärtner, F. C. (1999) · ACM Computing Surveys · doi:10.1145/311531.311532 · Cited by 346
Metadata
- Authors
- Fischer, M. J., Lynch, N. A., & Merritt, M.
- Venue
- Distributed Computing
- Published
- 1986-03
- Volume
- 1
- Issue
- 1
- Pages
- 26-39
- ISSN
- 0178-2770 (ISSN-L)
- 1432-0452
- OpenAlex
- W2082257278
- Cited by
- 257
- References
- 7
- FWCI
- 6.93
- Type
- journal article
- 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.