Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 590

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

Open access
Ben-Or, Michael·1983·Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83

Abstract

Recently, Fischer, Lynch and Paterson [3] proved that no completely asynchronous consensus protocol can tolerate even a single unannounced process death. We exhibit here a probabilistic solution for this problem, which guarantees that as long as a majority of the processes continues to operate, a decision will be made (Theorem 1). Our solution is completely asynchronous and is rather strong: As in [4], it is guaranteed to work with probability 1 even against an adversary scheduler who knows all about the system.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/800221.806707

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 590

Metadata

Authors
Ben-Or, M.
Venue
Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83
Publisher
ACM Press
Published
1983
Pages
27-30
OpenAlex
W2131848219
Cited by
590
References
3
FWCI
8.42
Type
conference paper
Language
en
Open access
bronze

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols. https://app.cochat.ai/papers/10.1145/800221.806707
The paper
Ben-Or, M. (1983). Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols. Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83. https://doi.org/10.1145/800221.806707

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.