On the public citation graph
Some impossibility results in interprocess synchronization
0 signed · 41 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/3-540-17945-3_22openalex-snapshot
A new and efficient implementation of multiprocess synchronization
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_7openalex-snapshot
Script: A Communication Abstraction Mechanism and its Verification
inferredcites →https://doi.org/10.1007/bf01872848openalex-snapshot
Appraising fairness in languages for distributed programming
inferredcites →https://doi.org/10.1016/0020-0190(89)90049-5openalex-snapshot
Cooperating proofs for distributed programs with multiparty interactions
inferredcites →https://doi.org/10.1016/0167-6423(86)90018-3openalex-snapshot
Script: A communication abstraction mechanism and its verification
inferredcites →https://doi.org/10.1109/32.31364openalex-snapshot
Process synchronization: design and performance evaluation of distributed algorithms
inferredcites →https://doi.org/10.1109/icdcs.1992.235117openalex-snapshot
A real-time algorithm for fair interprocess synchronization
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/48022.48023openalex-snapshot
Distributed cooperation with action systems
inferredcites →https://doi.org/10.1145/69558.69561openalex-snapshot
Synchronization of asynchronous processes in CSP
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/800222.806753openalex-snapshot
Distributed algorithms for ensuring fair interprocess communicatons
inferredcites →https://doi.org/10.1145/99583.99614openalex-snapshot
Coordinating first-order multiparty interactions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.903openalex-snapshot
An order‐based algorithm for implementing multiparty synchronization
inferred← citeshttps://doi.org/10.1006/inco.2000.3014openalex-snapshot
On Fairness Notions in Distributed Systems
inferred← citeshttps://doi.org/10.1006/inco.2000.3015openalex-snapshot
On Fairness Notions in Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_42openalex-snapshot
Fairness of N-party synchronization and its implementation in a distributed environment
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_121openalex-snapshot
Characterizing fairness implementability for multiparty interaction
inferred← citeshttps://doi.org/10.1007/bfb0030687openalex-snapshot
Strong interaction fairness in a fully distributed system with unbounded speed variability
inferred← citeshttps://doi.org/10.1016/j.inffus.2020.05.007openalex-snapshot
A scheduler for SCADA-based multi-source fusion systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.09.004openalex-snapshot
Snap-stabilizing committee coordination
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00013-7openalex-snapshot
Implementation of communicating reactive processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00224-2openalex-snapshot
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
inferred← citeshttps://doi.org/10.1109/71.296319openalex-snapshot
Fault-tolerant algorithms for fair interprocess synchronization
inferred← citeshttps://doi.org/10.1109/71.508250openalex-snapshot
Localizing failures in distributed synchronization
inferred← citeshttps://doi.org/10.1109/71.663873openalex-snapshot
Strong interaction fairness via randomization
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235117openalex-snapshot
A real-time algorithm for fair interprocess synchronization
inferred← citeshttps://doi.org/10.1109/icdcs.1996.507996openalex-snapshot
Strong interaction fairness via randomization
inferred← citeshttps://doi.org/10.1109/ipdps.2011.31openalex-snapshot
Snap-Stabilizing Committee Coordination
inferred← citeshttps://doi.org/10.1145/177492.177739openalex-snapshot
Coordinating first-order multiparty interactions
inferred← citeshttps://doi.org/10.1145/227595.227601openalex-snapshot
A comprehensive study of the complexity of multiparty interaction
inferred← citeshttps://doi.org/10.29375/25392115.1109openalex-snapshot
Vivacidad y justicia en entornos no deterministas
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.