The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Complexity of network synchronization
Open accessAbstract
The problem of simulating a synchronous network by an asynchronous network is investigated. A new simulation technique, referred to as a synchronizer, which is a new, simple methodology for designing efficient distributed algorithms in asynchronous networks, is proposed. The synchronizer exhibits a trade-off between its communication and time complexities, which is proved to be within a constant factor of the lower bound.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Time, clocks, and the ordering of events in a distributed system
Massachusetts Computer Associates, I., & Lamport, L. (2019) · Concurrency: the Works of Leslie Lamport · doi:10.1145/3335772.3335934 · Cited by 1,979
Even, S. (1979) · Cited by 1,280
An O(n2log n) parallel max-flow algorithm
Shiloach, Y., & Vishkin, U. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90013-x · Cited by 226
Synchronization in Distributed Programs
Schneider, F. B. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357163 · Cited by 142
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Garg, N., Vazirani, V. V., & Yannakakis, M. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793243016 · Cited by 335
A new approach to the maximum flow problem
Goldberg, A. V., & Tarjan, R. E. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12144 · Cited by 329
Metadata
- Authors
- Awerbuch, B.
- Venue
- Journal of the ACM
- Published
- 1985-10
- Volume
- 32
- Issue
- 4
- Pages
- 804-823
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2092534058
- Cited by
- 687
- References
- 5
- FWCI
- 20.30
- Type
- journal article
- 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: Complexity of network synchronization. https://app.cochat.ai/papers/10.1145/4221.4227
- The paper
- Awerbuch, B. (1985). Complexity of network synchronization. Journal of the ACM. https://doi.org/10.1145/4221.4227
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.