On the public citation graph
Fault tolerance for token-based synchronization protocols
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.1006/jpdc.1996.0030openalex-snapshot
A Simulation Study on Distributed Mutual Exclusion
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/bfb0019802openalex-snapshot
How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion
inferredcites →https://doi.org/10.1016/0164-1212(90)90056-ropenalex-snapshot
Fault-tolerant mutual exclusion algorithms
inferredcites →https://doi.org/10.1016/0743-7315(90)90114-5openalex-snapshot
Two algorithms for mutual exclusion in real-time distributed computer systems
inferredcites →https://doi.org/10.1109/12.24268openalex-snapshot
A heuristically-aided algorithm for mutual exclusion in distributed systems
inferredcites →https://doi.org/10.1109/ipps.1995.395942openalex-snapshot
A performance comparison of fast distributed mutual exclusion algorithms
inferredcites →https://doi.org/10.1109/ipps.1997.580904openalex-snapshot
Empirical evaluation of distributed mutual exclusion algorithms
inferredcites →https://doi.org/10.1109/ipps.1998.670018openalex-snapshot
Prioritized token-based mutual exclusion for distributed systems
inferredcites →https://doi.org/10.1109/real.1999.818861openalex-snapshot
Priority inheritance and ceilings for distributed mutual exclusion
inferredcites →https://doi.org/10.1142/s0129626492000428openalex-snapshot
AN IMPROVEMENT OF MAEKAWA'S MUTUAL EXCLUSION ALGORITHM TO MAKE IT FAULT-TOLERANT
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/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
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/359545.359563openalex-snapshot
Time, clocks, and the ordering of events 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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11549468_72openalex-snapshot
A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
inferred← citeshttps://doi.org/10.1007/s10514-012-9275-2openalex-snapshot
Decentralized path planning for multi-agent teams with complex constraints
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.jpdc.2003.10.001openalex-snapshot
Scalable hierarchical locking for distributed systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.02.005openalex-snapshot
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
inferred← citeshttps://doi.org/10.1109/iscit.2006.339910openalex-snapshot
Fault-Tolerant Hierarchical Token-Based Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1109/pdp.2009.57openalex-snapshot
Byte-Range Asynchronous Locking in Distributed Settings
inferred← citeshttps://doi.org/10.1109/sbac-pad.2013.11openalex-snapshot
Easily Rendering Token-Ring Algorithms of Distributed and Parallel Applications Fault Tolerant
inferred← citeshttps://doi.org/10.1109/snpd.2007.18openalex-snapshot
Research of Real-time Forecast Technology in Fault of Missile Guidance System Based on Grey Model and Data Fusion
inferred← citeshttps://doi.org/10.1109/srds.2006.35openalex-snapshot
Performance evaluation of a fair fault-tolerant mutual exclusion algorithm
inferred← citeshttps://doi.org/10.1145/1183401.1183433openalex-snapshot
Scalable, fault tolerant membership for MPI tasks on HPC systems
inferred← citeshttps://doi.org/10.5753/wtf.2010.23093openalex-snapshot
Garantindo a Circulação e Unicidade do Token em Algoritmos com Nós Organizados em Anel Sujeitos a Falhas
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.