On the public citation graph
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
0 signed · 31 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.1006/jpdc.1996.0041openalex-snapshot
A Log (N) Distributed Mutual Exclusion Algorithm Based on Path Reversal
inferredcites →https://doi.org/10.1007/11549468_72openalex-snapshot
A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
inferredcites →https://doi.org/10.1007/3-540-45748-8_27openalex-snapshot
Scalable Management and Data Mining Using Astrolabe*
inferredcites →https://doi.org/10.1007/978-3-540-30183-7_2openalex-snapshot
A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems
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.1080/00401706.1984.10487955openalex-snapshot
Discrete-Event System Simulation
inferredcites →https://doi.org/10.1109/71.862205openalex-snapshot
A fair distributed mutual exclusion algorithm
inferredcites →https://doi.org/10.1109/grid.2005.1542758openalex-snapshot
Efficient mutual exclusion in peer-to-peer systems
inferredcites →https://doi.org/10.1109/icdcs.1994.302397openalex-snapshot
A O(log/sub 2/ n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure
inferredcites →https://doi.org/10.1109/icdcs.1995.500014openalex-snapshot
A distributed K-mutual exclusion algorithm
inferredcites →https://doi.org/10.1145/1015467.1015509openalex-snapshot
A scalable distributed information management system
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
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.1287/opre.9.3.383openalex-snapshot
A Proof for the Queuing Formula: L = λ W
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10766-014-0317-6openalex-snapshot
Queue-Based and Adaptive Lock Algorithms for Scalable Resource Allocation on Shared-Memory Multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.01.008openalex-snapshot
A distributed k -mutual exclusion algorithm based on autonomic spanning trees
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/icpp.2013.39openalex-snapshot
A Generalized Mutual Exclusion Problem and Its Algorithm
inferred← citeshttps://doi.org/10.1109/icpp.2015.63openalex-snapshot
Reducing Synchronization Cost in Distributed Multi-resource Allocation Problem
inferred← citeshttps://doi.org/10.1109/ispdc.2008.57openalex-snapshot
Fault Tolerant K-Mutual Exclusion Algorithm Using Failure Detector
inferred← citeshttps://doi.org/10.1109/ladc.2009.10openalex-snapshot
A Timer-Free Fault Tolerant K-Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2013.2297097openalex-snapshot
Distributed Mutual Exclusion Algorithms for Intersection Traffic Control
inferred← citeshttps://doi.org/10.11606/t.3.2013.tde-06072014-231945openalex-snapshot
Algoritmo distribuído para alocação de múltiplos recursos em ambientes distribuídos.
inferred← citeshttps://doi.org/10.15803/ijnc.9.2_147openalex-snapshot
Asynchronous message-passing distributed algorithm for the global critical section problem
inferred← citeshttps://doi.org/10.2316/p.2012.789-047openalex-snapshot
A Distributed Resource Allocation Algorithm using Fuzzy Logic
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.48550/arxiv.1807.05674openalex-snapshot
An asynchronous message-passing distributed algorithm for the global critical section problem
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.