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

The DOI matches its Crossref record.

Spatial gossip and resource location protocols

Kempe, David, Kleinberg, Jon, Demers, Alan · 2001 · Proceedings of the thirty-third annual ACM symposium on Theory of computing

Abstract

The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying deterministic or randomized algorithm, exchanging information in each communication step. In a variety of contexts, the use of randomization to propagate information has been found to provide better reliability and scalability than more regimented deterministic approaches.

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/380752.380796

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.

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

Cited by

See all 224

Metadata

Authors
Kempe, D., Kleinberg, J., & Demers, A.
Venue
Proceedings of the thirty-third annual ACM symposium on Theory of computing
Publisher
ACM
Published
2001-07-06
Pages
163-172
OpenAlex
W1975950716
Cited by
224
References
0
FWCI
5.75
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

How to cite

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

This page
CoChat. (2026). Citation check: Spatial gossip and resource location protocols. https://app.cochat.ai/papers/10.1145/380752.380796
The paper
Kempe, D., Kleinberg, J., & Demers, A. (2001). Spatial gossip and resource location protocols. Proceedings of the thirty-third annual ACM symposium on Theory of computing. https://doi.org/10.1145/380752.380796

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.