On the public citation graph
Highly concurrent logically synchronous multicast
0 signed · 40 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/bfb0019807openalex-snapshot
A modular proof of correctness for a network synchronizer
inferredcites →https://doi.org/10.1007/bfb0039061openalex-snapshot
The need for headers: An impossibility result for communication over unreliable channels
inferredcites →https://doi.org/10.1016/0011-684x(85)90108-xopenalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(86)90014-9openalex-snapshot
Introduction to the theory of nested transactions
inferredcites →https://doi.org/10.1109/12.9729openalex-snapshot
Constructing two-writer atomic registers
inferredcites →https://doi.org/10.1109/lics.1990.113769openalex-snapshot
Modelling shared state in a shared action model
inferredcites →https://doi.org/10.1145/195664.195666openalex-snapshot
Quorum consensus in nested-transaction systems
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/357162.357163openalex-snapshot
Synchronization in Distributed Programs
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/41840.41843openalex-snapshot
Quorum consensus in nested transaction systems
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.1145/48022.48023openalex-snapshot
Distributed cooperation with action systems
inferredcites →https://doi.org/10.1145/62546.62552openalex-snapshot
A lattice-structured proof of a minimum spanning
inferredcites →https://doi.org/10.1145/62546.62572openalex-snapshot
Data link layer: two impossibility results
inferredcites →https://doi.org/10.1145/62546.62593openalex-snapshot
Impossibility and universality results for wait-free synchronization
inferredcites →https://doi.org/10.1145/6462.6485openalex-snapshot
Distributed discrete-event simulation
inferredcites →https://doi.org/10.1145/69624.357208openalex-snapshot
An Effective Implementation for the Generalized Input-Output Construct of CSP
inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot
Reliable communication in the presence of failures
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.21236/ada198312openalex-snapshot
A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm
inferredcites →https://doi.org/10.21236/ada200983openalex-snapshot
The Data Link Layer: Two Impossibility Results
inferredcites →https://doi.org/10.21236/ada216390openalex-snapshot
Synthesis of Efficient Drinking Philosophers Algorithms
inferredcites →https://doi.org/10.21236/ada221279openalex-snapshot
Modelling Shared State in a Shared Action Model
inferredcites →https://doi.org/10.21236/ada228113openalex-snapshot
Distributed Algorithm Simulation Using Input/Output Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4615-5449-3_2openalex-snapshot
Using Static Total Causal Ordering Protocols to Achieve Ordered View Synchrony
inferred← citeshttps://doi.org/10.1007/s10009-008-0097-7openalex-snapshot
Automated implementation of complex distributed algorithms specified in the IOA language
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90029-mopenalex-snapshot
A flexible causal broadcast communication interface for distributed applications
inferred← citeshttps://doi.org/10.1109/12.280800openalex-snapshot
Logically instantaneous message passing in asynchronous distributed systems
inferred← citeshttps://doi.org/10.1109/2.223535openalex-snapshot
Formal models of communication services: a case study
inferred← citeshttps://doi.org/10.1109/32.464547openalex-snapshot
The Programmers' Playground: I/O abstraction for user-configurable distributed applications
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627357openalex-snapshot
Early delivery totally ordered multicast in asynchronous environments
inferred← citeshttps://doi.org/10.1109/hicss.1994.323247openalex-snapshot
The Programmers' Playground: I/O abstraction for heterogeneous distributed systems
inferred← citeshttps://doi.org/10.1109/nca.2004.1347769openalex-snapshot
Compiling IOA without global synchronization
inferred← citeshttps://doi.org/10.7936/k7mg7mthopenalex-snapshot
The Programmers' Playground: I/O Abstraction for Heterogeneous Distributed Systems
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.