On the public citation graph
A robust distributed mutual exclusion algorithm
0 signed · 30 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-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1016/0376-5075(78)90045-4openalex-snapshot
The implementation of reliable distributed multiprocess systems
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1145/24068.28052openalex-snapshot
The information structure of distributed mutual exclusion algorithms
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
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/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/58564.59295openalex-snapshot
A tree-based algorithm for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/6110.214406openalex-snapshot
A distributed mutual exclusion algorithm
inferredcites →https://doi.org/10.1145/72981.72994openalex-snapshot
Efficient solution to the distributed mutual exclusion problem
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.5555/800253.807732openalex-snapshot
A principle for resilient sharing of distributed resources
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.1169openalex-snapshot
A coterie‐based mutual exclusion algorithm for distributed systems allowing multiple process failures at arbitrary time
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_12openalex-snapshot
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_12openalex-snapshot
On the Performance of Distributed Lock-Based Synchronization
inferred← citeshttps://doi.org/10.1007/bfb0030830openalex-snapshot
Analysis of quorum-based protocols for distributed (k+1)-exclusion
inferred← citeshttps://doi.org/10.1007/s00446-010-0117-1openalex-snapshot
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
inferred← citeshttps://doi.org/10.1007/s004460050027openalex-snapshot
Crumbling walls: a class of practical and efficient quorum systems
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00016-9openalex-snapshot
The availability of crumbling wall quorum systems
inferred← citeshttps://doi.org/10.1109/71.598279openalex-snapshot
Analysis of quorum-based protocols for distributed (k+1)-exclusion
inferred← citeshttps://doi.org/10.1109/ftcs.1998.689477openalex-snapshot
A fault-tolerant algorithm for decentralized on-line quorum adaptation
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840958openalex-snapshot
Graceful quorum reconfiguration in a robust emulation of shared memory
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365692openalex-snapshot
The load, capacity and availability of quorum systems
inferred← citeshttps://doi.org/10.1145/2007183.2007187openalex-snapshot
On the performance of distributed lock-based synchronization?
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.