On the public citation graph
A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed 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.
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/bf01667083openalex-snapshot
Fair mutual exclusion on a graph of processes
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/71.80161openalex-snapshot
A resilient mutual exclusion algorithm for computer networks
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1145/24068.28052openalex-snapshot
The information structure of distributed mutual exclusion algorithms
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/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
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
inferredcites →https://doi.org/10.1145/72981.72994openalex-snapshot
Efficient solution to the distributed mutual exclusion problem
inferredcites →https://doi.org/10.2307/2316883openalex-snapshot
An Introduction to Finite Projective Planes.
inferredcites →https://doi.org/10.2307/2529058openalex-snapshot
An Introduction to Finite Projective Planes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_2openalex-snapshot
Quorum-Based Algorithms for Group Mutual Exclusion
inferred← citeshttps://doi.org/10.1007/978-1-4020-6264-3_61openalex-snapshot
Access Concurrents Sessions Based on Quorums
inferred← citeshttps://doi.org/10.1007/978-3-642-38123-2_10openalex-snapshot
Permission-Based Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.1007/bf02242735openalex-snapshot
A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00025-5openalex-snapshot
Distributed algorithms for multiple entries to a critical section with priority
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.1023/b:mone.0000034704.13096.22openalex-snapshot
Causality and the Spatial–Temporal Ordering in Mobile Systems
inferred← citeshttps://doi.org/10.1109/71.970560openalex-snapshot
A delay-optimal quorum-based mutual exclusion algorithm for distributed systems
inferred← citeshttps://doi.org/10.1109/ccaa.2015.7148479openalex-snapshot
Quorum-based mutual exclusion algorithm for mobile ad-hoc network (MANET)
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302396openalex-snapshot
An O(N/sup M/(M+1/)) distributed algorithm for the k-out of-M resources allocation problem
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679773openalex-snapshot
A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability
inferred← citeshttps://doi.org/10.1109/icdcs.2002.1022301openalex-snapshot
Dynamic behaviour of the distributed tree quorum algorithm
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918928openalex-snapshot
Backoff protocols for distributed mutual exclusion and ordering
inferred← citeshttps://doi.org/10.1109/iis.1997.645389openalex-snapshot
A distributed mutual exclusion algorithm for mobile computing environments
inferred← citeshttps://doi.org/10.1109/pdcat.2003.1236404openalex-snapshot
A quorum-based distributed algorithm for group mutual exclusion
inferred← citeshttps://doi.org/10.1109/tpds.2003.1199064openalex-snapshot
Quorum-based algorithms for group mutual exclusion
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239865openalex-snapshot
An efficient distributed algorithm for detection of knots and cycles in a distributed graph
inferred← citeshttps://doi.org/10.11501/3106036openalex-snapshot
A Study on Distributed k-Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
inferred← citeshttps://doi.org/10.70675/6da8d938zde89z4bffzb535zed8657b6e60bopenalex-snapshot
Vers une structuration auto-stabilisante des réseaux ad hoc : cas des réseaux de capteurs sans fil
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.