On the public citation graph
Analysis of quorum-based protocols for distributed (k+1)-exclusion
0 signed · 37 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-54945-5_45openalex-snapshot
Distributed k-mutual exclusion problem and k-coteries
inferredcites →https://doi.org/10.1007/bfb0022455openalex-snapshot
A robust distributed mutual exclusion algorithm
inferredcites →https://doi.org/10.1016/0012-365x(80)90160-0openalex-snapshot
Basic techniques of combinatorial theory
inferredcites →https://doi.org/10.1016/0020-0190(89)90211-1openalex-snapshot
A distributed algorithm for multiple entries to a critical section
inferredcites →https://doi.org/10.1016/0020-0190(90)90194-3openalex-snapshot
Exploiting logical structures in replicated databases
inferredcites →https://doi.org/10.1016/0020-0190(92)90079-bopenalex-snapshot
Another distributed algorithm for multiple entries to a critical section
inferredcites →https://doi.org/10.1057/jors.1980.16openalex-snapshot
Basic Techniques of Combinatorial Theory
inferredcites →https://doi.org/10.1109/12.338112openalex-snapshot
Comments on "Availability of k-Coterie"
inferredcites →https://doi.org/10.1109/12.83661openalex-snapshot
Hierarchical quorum consensus: a new algorithm for managing replicated data
inferredcites →https://doi.org/10.1109/32.16608openalex-snapshot
Performance characterization of quorum-consensus algorithms for replicated data
inferredcites →https://doi.org/10.1109/71.598279openalex-snapshot
Analysis of quorum-based protocols for distributed (k+1)-exclusion
inferredcites →https://doi.org/10.1109/icdcs.1993.287721openalex-snapshot
k-coteries for fault-tolerant k entries to a critical section
inferredcites →https://doi.org/10.1145/103727.103728openalex-snapshot
An efficient and fault-tolerant solution for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/113413.113419openalex-snapshot
Bounded ignorance in replicated 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/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/6110.214406openalex-snapshot
A distributed mutual exclusion algorithm
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.2307/2002374openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.2307/2310497openalex-snapshot
An Introduction to Combinatorial Analysis.
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-45801-8_57openalex-snapshot
Optimal k-Coteries That Maximize Availability in General Networks
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-0094-4openalex-snapshot
On quorum systems for group resources allocation
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.05.009openalex-snapshot
An algorithm for k-mutual exclusion in decentralized systems
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00164-8openalex-snapshot
A generalized grid quorum strategy for k-mutual exclusion in distributed systems
inferred← citeshttps://doi.org/10.1016/s0920-5489(02)00105-8openalex-snapshot
A survey of permission-based distributed mutual exclusion algorithms
inferred← citeshttps://doi.org/10.1109/71.954617openalex-snapshot
Coterie join operation and tree structured k-coteries
inferred← citeshttps://doi.org/10.1109/icoin.1998.648432openalex-snapshot
An extended degree-k-tree quorum strategy for K-mutual exclusion in distributed systems
inferred← citeshttps://doi.org/10.1109/icpads.1998.741086openalex-snapshot
A comparison of two torus-based k-coteries
inferred← citeshttps://doi.org/10.1109/prfts.1997.640134openalex-snapshot
An extended binary tree quorum strategy for K-mutual exclusion in distributed systems
inferred← citeshttps://doi.org/10.1109/tpds.2004.23openalex-snapshot
k-Coteries for tolerating network 2-partition
inferred← citeshttps://doi.org/10.1201/9781315141411-4openalex-snapshot
Mutual Exclusion And Election Algorithms
inferred← citeshttps://doi.org/10.22215/etd/2007-06184openalex-snapshot
Performance modeling of replication techniques in parallel and distributed layered service architectures
showing the first 13 of 14 · page through all 14
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.