On the public citation graph

How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion

0 signed · 29 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.1109/tc.1982.1675885openalex-snapshot
Elections in a Distributed Computing System
inferredcites →https://doi.org/10.1145/2993.2994openalex-snapshot
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1995.1016openalex-snapshot
A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm
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/3-540-61769-8openalex-snapshot
Distributed Algorithms
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/0020-0255(96)00038-2openalex-snapshot
Fault-tolerant logarithmic mutual exclusion with lazy update propagation
inferred← citeshttps://doi.org/10.1016/b978-0-12-803663-1.00006-1openalex-snapshot
Transparent distributed data management in large scale distributed systems
inferred← citeshttps://doi.org/10.1016/j.comcom.2024.02.007openalex-snapshot
An efficient failure-resilient mutual exclusion algorithm for distributed systems leveraging a novel zero-message overlay structure
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.1016/s0164-1212(96)00149-5openalex-snapshot
Critical analysis of “A fault-tolerant algorithm for mutual exclusion in a distributed system”
inferred← citeshttps://doi.org/10.1109/hicss.1997.667337openalex-snapshot
Static and dynamic adaptation of transactional consistency
inferred← citeshttps://doi.org/10.1109/icdcs.1991.148689openalex-snapshot
A DAG-based algorithm for distributed mutual exclusion
inferred← citeshttps://doi.org/10.1109/icdcs.1996.508029openalex-snapshot
Robust distributed mutual exclusion
inferred← citeshttps://doi.org/10.1109/icet.2006.336002openalex-snapshot
A Hybrid Distributed Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1109/icfn.2010.45openalex-snapshot
Reducing Coordinator Failures in Centralized Algorithm to Guarantee Mutual Exclusion Using a Backup Site
inferred← citeshttps://doi.org/10.1109/icict.2007.375369openalex-snapshot
A Broadcast Fault-Tolerant Hierarchical Token-Based Mutual Exclusion 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/ipdps.2001.925101openalex-snapshot
Fault tolerance for token-based synchronization protocols
inferred← citeshttps://doi.org/10.1109/iscit.2006.339910openalex-snapshot
Fault-Tolerant Hierarchical Token-Based Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1109/nca.2009.8openalex-snapshot
Proximity-Aware Distributed Mutual Exclusion for Effective Peer-to-Peer Replica Management
inferred← citeshttps://doi.org/10.1109/pdp.2009.57openalex-snapshot
Byte-Range Asynchronous Locking in Distributed Settings
inferred← citeshttps://doi.org/10.1109/pdp.2012.32openalex-snapshot
A Dynamic Distributed Algorithm for Read Write Locks
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/103727.103728openalex-snapshot
An efficient and fault-tolerant solution for distributed mutual exclusion
inferred← citeshttps://doi.org/10.30973/progmat/2019.11.1/3openalex-snapshot
Avances en Algoritmos de Exclusión Mutua en Sistemas Distribuidos
inferred← citeshttps://doi.org/10.32913/mic-ict-research-vn.v2019.n2.848openalex-snapshot
Song song hóa thuật toán Lamport trong loại trừ tương hỗ phân tán
inferred← citeshttps://doi.org/10.3844/jcssp.2009.398.404openalex-snapshot
Distributed Mutual Exclusion Based on Causal Ordering
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3347openalex-snapshot
A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
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.