On the public citation graph
Coterie join algorithm
0 signed · 55 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/bf01786230openalex-snapshot
Mutual exclusion in partitioned distributed systems
inferredcites →https://doi.org/10.1016/0020-0190(90)90194-3openalex-snapshot
Exploiting logical structures in replicated databases
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
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/6306.6308openalex-snapshot
A quorum-consensus replication method for abstract data types
inferredcites →https://doi.org/10.1145/6420.6421openalex-snapshot
The vulnerability of vote assignments
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
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/11576235_16openalex-snapshot
A Quorum Based Group k-Mutual Exclusion Algorithm for Open Distributed Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_7openalex-snapshot
On Quorum Systems for Group Resources with Bounded Capacity
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_30openalex-snapshot
A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem
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/s00446-010-0094-4openalex-snapshot
On quorum systems for group resources allocation
inferred← citeshttps://doi.org/10.1007/s446-002-8030-8openalex-snapshot
A self-stabilizing quorum-based protocol for maxima computing
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00053-lopenalex-snapshot
Decompositions of positive self-dual boolean functions
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00039-5openalex-snapshot
Nondominated k-coteries for multiple mutual exclusion
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90020-xopenalex-snapshot
A quorum-based algorithm for parameterized semaphore operations
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/s0164-1212(96)00042-8openalex-snapshot
Properties of nondominated k-coteries
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00096-7openalex-snapshot
Minimum self-dual decompositions of positive dual-minor Boolean functions
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00116-3openalex-snapshot
A delay optimal coterie on the k-dimensional folded Petersen graph
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.1080/02533839.1994.9677620openalex-snapshot
Logical scheme improvement for maintaining replicated data in distributed environment
inferred← citeshttps://doi.org/10.1088/1742-6596/1341/4/042020openalex-snapshot
k-Coterie and Coterie Join Operation
inferred← citeshttps://doi.org/10.1109/12.780882openalex-snapshot
Improving the availability of mutual exclusion systems on incomplete networks
inferred← citeshttps://doi.org/10.1109/71.238300openalex-snapshot
A theory of coteries: mutual exclusion in distributed systems
inferred← citeshttps://doi.org/10.1109/71.388047openalex-snapshot
Performance characterization of the tree quorum algorithm
inferred← citeshttps://doi.org/10.1109/71.466629openalex-snapshot
Generating and approximating nondominated coteries
inferred← citeshttps://doi.org/10.1109/71.706045openalex-snapshot
Recognizing nondominated coteries and wr-coteries by availability
inferred← citeshttps://doi.org/10.1109/71.954617openalex-snapshot
Coterie join operation and tree structured k-coteries
inferred← citeshttps://doi.org/10.1109/aina.2008.151openalex-snapshot
A Quorum-Based Route Cache Maintenance Protocol for Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235110openalex-snapshot
A general method to define quorums
inferred← citeshttps://doi.org/10.1109/icpads.1994.590392openalex-snapshot
Obtaining nondominated k-coteries for fault-tolerant distributed k-mutual exclusion
inferred← citeshttps://doi.org/10.1109/icpads.2005.48openalex-snapshot
A Simple Quorum Reconfiguration for Open Distributed Environments
inferred← citeshttps://doi.org/10.1109/pccc.1992.200517openalex-snapshot
Availability analysis of composite coteries
inferred← citeshttps://doi.org/10.1109/pccc.1994.504097openalex-snapshot
Structures for Fault-Tolerant Distributed Protocols
inferred← citeshttps://doi.org/10.1109/spdp.1993.395499openalex-snapshot
Measures of importance and symmetry in distributed systems
inferred← citeshttps://doi.org/10.1109/spdp.1993.395526openalex-snapshot
Protocol refinement for maintaining replicated data in distributed systems
inferred← citeshttps://doi.org/10.1109/tpds.2005.25openalex-snapshot
Transversal merge operation: a nondominated coterie construction method for distributed mutual exclusion
inferred← citeshttps://doi.org/10.1137/s0097539797325235openalex-snapshot
The Load and Availability of Byzantine Quorum Systems
inferred← citeshttps://doi.org/10.1145/2007183.2007187openalex-snapshot
On the performance of distributed lock-based synchronization?
inferred← citeshttps://doi.org/10.1145/259380.259450openalex-snapshot
The load and availability of Byzantine quorum systems
inferred← citeshttps://doi.org/10.11501/3106036openalex-snapshot
A Study on Distributed k-Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.11591/ijeecs.v18.i2.pp953-960openalex-snapshot
An Algorithm to construct nondominated k-coteries
inferred← citeshttps://doi.org/10.20956/jmsk.v14i2.3585openalex-snapshot
OPERASI JOIN KOTERI-k DIPERLUAS
inferred← citeshttps://doi.org/10.20956/jmsk.v16i3.6940openalex-snapshot
A Union Operation of Non-Dominated K-Coterie in Distributed System
inferred← citeshttps://doi.org/10.21236/ada457900openalex-snapshot
Networking Foundations for Collaborative Computing at Internet Scope
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9908011openalex-snapshot
The Load and Availability of Byzantine Quorum Systems
inferred← citeshttps://doi.org/10.55657/rmns.v1i2.61openalex-snapshot
Operasi Cross-Union pada Koleksi Himpunan Koteri Majority
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.