On the public citation graph

An algorithm for k-mutual exclusion in decentralized systems

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.
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/978-3-540-30501-9_57openalex-snapshot
A Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems
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(92)90079-bopenalex-snapshot
Another distributed algorithm for multiple entries to a critical section
inferredcites →https://doi.org/10.1016/0020-0190(94)00019-0openalex-snapshot
A token based k-resilient mutual exclusion algorithm for distributed systems
inferredcites →https://doi.org/10.1016/0020-0190(94)00039-5openalex-snapshot
Nondominated k-coteries for multiple mutual exclusion
inferredcites →https://doi.org/10.1016/0020-0190(94)90014-0openalex-snapshot
A distributed k-mutual exclusion algorithm using k-coterie
inferredcites →https://doi.org/10.1016/s0020-0190(02)00355-1openalex-snapshot
A simple group mutual l-exclusion algorithm
inferredcites →https://doi.org/10.1016/s0304-3975(97)00303-4openalex-snapshot
k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion
inferredcites →https://doi.org/10.1080/17445760701536084openalex-snapshot
A distributed mutual exclusion algorithm over multi-routing protocol for mobilead hocnetworks
inferredcites →https://doi.org/10.1109/12.223674openalex-snapshot
Availability of k-coterie
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.1109/icdcs.1995.500014openalex-snapshot
A distributed K-mutual exclusion algorithm
inferredcites →https://doi.org/10.1109/icpads.1994.590392openalex-snapshot
Obtaining nondominated k-coteries for fault-tolerant distributed k-mutual exclusion
inferredcites →https://doi.org/10.1109/icpads.1998.741086openalex-snapshot
A comparison of two torus-based k-coteries
inferredcites →https://doi.org/10.1109/spdp.1992.242717openalex-snapshot
A token based distributed k mutual exclusion algorithm
inferredcites →https://doi.org/10.1109/tpds.2003.1199064openalex-snapshot
Quorum-based algorithms for group mutual exclusion
inferredcites →https://doi.org/10.1109/tpds.2004.23openalex-snapshot
k-Coteries for tolerating network 2-partition
inferredcites →https://doi.org/10.1109/tpds.2007.1072openalex-snapshot
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
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/6110.214406openalex-snapshot
A distributed mutual exclusion algorithm
inferredcites →https://doi.org/10.3217/jucs-012-02-0140openalex-snapshot
An O(√n) Distributed Mutual Exclusion Algorithm Using Queue Migration
inferredcites →https://doi.org/10.6688/jise.2001.17.4.2openalex-snapshot
k-Arbiter Join Operation *

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-71368-7_12openalex-snapshot
Power Auctioning in Resource Constrained Micro-grids: Cases of Cheating
inferred← citeshttps://doi.org/10.1007/978-3-319-91427-5_6openalex-snapshot
The Design and Classification of Cheating Attacks on Power Marketing Schemes in Resource Constrained Smart Micro-Grids
inferred← citeshttps://doi.org/10.1007/s11227-021-03802-8openalex-snapshot
Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.08.117openalex-snapshot
Adaptive teleoperation using intelligent dynamic voting
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.11.232openalex-snapshot
Redefining voting to enable simultaneous multioperator robot navigation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.01.003openalex-snapshot
Mutual inclusion in asynchronous message-passing distributed systems
inferred← citeshttps://doi.org/10.1109/candar.2017.18openalex-snapshot
An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem
inferred← citeshttps://doi.org/10.1109/tla.2017.8070421openalex-snapshot
A Fault-Tolerant Algorithm For Distributed Resource Allocation
inferred← citeshttps://doi.org/10.1155/2013/120308openalex-snapshot
Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems
inferred← citeshttps://doi.org/10.3390/a10020038openalex-snapshot
An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem
inferred← citeshttps://doi.org/10.4204/eptcs.27.2openalex-snapshot
On Secure Workflow Decentralisation on the Internet
inferred← citeshttps://doi.org/10.48550/arxiv.1807.05674openalex-snapshot
An asynchronous message-passing distributed algorithm for the global critical section problem
inferred← citeshttps://doi.org/10.70675/72972be7z855bz4a06z8b88zfc0aa06e852copenalex-snapshot
Distributed resource allocation for virtual networks
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.