On the public citation graph
A modular proof of correctness for a network synchronizer
0 signed · 23 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.1002/net.3230150404openalex-snapshot
Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronization
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1016/0304-3975(86)90014-9openalex-snapshot
Introduction to the theory of nested transactions
inferredcites →https://doi.org/10.1145/28659.28669openalex-snapshot
Nested transactions and read-write locking
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_35openalex-snapshot
Highly concurrent logically synchronous multicast
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_87openalex-snapshot
Foundations of compositional program refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-38123-2_9openalex-snapshot
Simulating Synchrony on Top of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/bf01784720openalex-snapshot
Highly concurrent logically synchronous multicast
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/bfb0039061openalex-snapshot
The need for headers: An impossibility result for communication over unreliable channels
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00022-gopenalex-snapshot
Hyper-ring connection machines
inferred← citeshttps://doi.org/10.1109/fscs.1990.89572openalex-snapshot
Network synchronization with polylogarithmic overhead
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302420openalex-snapshot
A synchronizer with low memory overhead
inferred← citeshttps://doi.org/10.1145/100216.100227openalex-snapshot
The use of a synchronizer yields maximum computation rate in distributed networks
inferred← citeshttps://doi.org/10.1145/129712.129767openalex-snapshot
Adapting to asynchronous dynamic networks (extended abstract)
inferred← citeshttps://doi.org/10.1145/190809.190337openalex-snapshot
A methodology for designing communication protocols
inferred← citeshttps://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
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.