The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.

Complexity of network synchronization

The work

AuthorsBaruch Awerbuch
Editors
Typearticle
Year1985
Citekeyawerbuch1985complexity

Where it appeared

Published inJournal of the ACM
PublisherAssociation for Computing Machinery
Volume32
Issue4
Pages804--823

Identifiers

DOI10.1145/4221.4227
OpenAlexW2092534058

Access

Landing pagehttps://doi.org/10.1145/4221.4227
Free full texthttps://dl.acm.org/doi/pdf/10.1145/4221.4227

From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.

Abstract

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.

How it got here

How it got hereagent via openalex
Added2026-10-27 07:45 UTC
Not denied bya person 2026-10-29 17:12 UTC

Filed under

jacm

Cite it as

@article{awerbuch1985complexity,
  title        = {Complexity of network synchronization},
  author       = {Baruch Awerbuch},
  year         = {1985},
  journal      = {Journal of the ACM},
  publisher    = {Association for Computing Machinery},
  volume       = {32},
  number       = {4},
  pages        = {804--823},
  doi          = {10.1145/4221.4227},
}

This record lives at https://refs.drheap.org/awerbuch1985complexity/ and will keep doing so.