On the public citation graph

Distributed algorithms for synchronizing interprocess communication within real time

0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00288965openalex-snapshot
The choice coordination problem
inferredcites →https://doi.org/10.1109/sfcs.1980.2openalex-snapshot
A distributed abstract data type implemented by a probabilistic communication scheme
inferredcites →https://doi.org/10.1109/sfcs.1980.26openalex-snapshot
N-process synchronization by 4.log2N-valued shared variable
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/357094.357101openalex-snapshot
Output Guards and Nondeterminism in “Communicating Sequential Processes”
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/800076.802466openalex-snapshot
A difference in efficiency between synchronous and asynchronous systems
inferredcites →https://doi.org/10.1145/800141.804654openalex-snapshot
Fast allocation of nearby resources in a distributed system
inferredcites →https://doi.org/10.1145/800141.804655openalex-snapshot
Local and global properties in networks of processors (Extended Abstract)
inferredcites →https://doi.org/10.1145/800141.804656openalex-snapshot
Deadlock- and livelock-free packet switching networks

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-13345-3_36openalex-snapshot
Probabilistic bidding gives optimal distributed resource allocation
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_1openalex-snapshot
A Glimpse at Paul G. Spirakis
inferred← citeshttps://doi.org/10.1007/bf00283332openalex-snapshot
The complexity of reachability in distributed communicating processes
inferred← citeshttps://doi.org/10.1007/bf01407862openalex-snapshot
Data flow analysis of distributed communicating processes
inferred← citeshttps://doi.org/10.1007/bf02737107openalex-snapshot
The complexity of reachability in distributed communicating processes
inferred← citeshttps://doi.org/10.1007/bfb0012790openalex-snapshot
On the power of probabilistic choice in synchronous parallel computations
inferred← citeshttps://doi.org/10.1007/bfb0025793openalex-snapshot
Critical remarks on max model of concurrency
inferred← citeshttps://doi.org/10.1007/bfb0036917openalex-snapshot
Concurrent probabilistic program, or: How to schedule if you must
inferred← citeshttps://doi.org/10.1109/sfcs.1981.41openalex-snapshot
Symmetry breaking in distributive networks
inferred← citeshttps://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferred← citeshttps://doi.org/10.1145/2993.357244openalex-snapshot
Real-Time Synchronization of Interprocess Communications
inferred← citeshttps://doi.org/10.1145/582153.582154openalex-snapshot
Termination of probabilistic concurrent programs
inferred← citeshttps://doi.org/10.1145/582153.582159openalex-snapshot
Unbounded speed variability in distributed communication systems
inferred← citeshttps://doi.org/10.1145/800220.806685openalex-snapshot
Real time resource allocation in distributed systems
inferred← citeshttps://doi.org/10.1145/800222.806753openalex-snapshot
Distributed algorithms for ensuring fair interprocess communicatons
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.