On the public citation graph
Unison, canon, and sluggish clocks in networks controlled by a synchronizer
0 signed · 28 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-3352-7_38openalex-snapshot
Unison in Distributed Networks
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50019-2openalex-snapshot
INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS
inferredcites →https://doi.org/10.1109/sfcs.1989.63506openalex-snapshot
The synchronization of nonuniform networks of finite automata
inferredcites →https://doi.org/10.1142/s0129626491000161openalex-snapshot
MAINTAINING DIGITAL CLOCKS IN STEP
inferredcites →https://doi.org/10.1145/100216.100227openalex-snapshot
The use of a synchronizer yields maximum computation rate in distributed networks
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.21236/ada117808openalex-snapshot
Distributed Minimum Hop Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_47openalex-snapshot
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_14openalex-snapshot
Time-message trade-offs for the weak unison problem
inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_5openalex-snapshot
On the Microscopic View of Time and Messages
inferred← citeshttps://doi.org/10.1007/bf02679457openalex-snapshot
The use of a synchronizer yields the maximum computation rate in distributed networks
inferred← citeshttps://doi.org/10.1007/s00224-005-1144-3openalex-snapshot
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90102-3openalex-snapshot
Upper and lower bounds for stochastic marked graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00235-9openalex-snapshot
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems
inferred← citeshttps://doi.org/10.1017/cbo9780511662508.003openalex-snapshot
An introduction to idempotency
inferred← citeshttps://doi.org/10.1109/candar.2016.0102openalex-snapshot
On the Complexity of Distributed Wake-Up
inferred← citeshttps://doi.org/10.1109/tdsc.2007.1007openalex-snapshot
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
inferred← citeshttps://doi.org/10.1137/s0895480100376022openalex-snapshot
The Wakeup Problem in Synchronous Broadcast Systems
inferred← citeshttps://doi.org/10.1145/343477.343529openalex-snapshot
The wakeup problem in synchronous broadcast systems (extended abstract)
inferred← citeshttps://doi.org/10.70675/7de6f3c7z3095z4397za086zf91c45851ec6openalex-snapshot
Synchronization problems in dynamic multi-agent networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.