On the public citation graph

An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem

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.1007/3-540-40026-5_15openalex-snapshot
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
inferredcites →https://doi.org/10.1016/0020-0190(86)90046-3openalex-snapshot
An implementation of mutual inclusion
inferredcites →https://doi.org/10.1016/j.comcom.2008.05.009openalex-snapshot
An algorithm for k-mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1016/j.ipl.2014.08.012openalex-snapshot
On the family of critical section problems
inferredcites →https://doi.org/10.1016/j.jpdc.2015.01.003openalex-snapshot
Mutual inclusion in asynchronous message-passing distributed systems
inferredcites →https://doi.org/10.1016/s0020-0190(01)00164-8openalex-snapshot
A generalized grid quorum strategy for k-mutual exclusion in distributed systems
inferredcites →https://doi.org/10.1016/s0304-3975(00)00325-xopenalex-snapshot
Self-stabilizing ℓ-exclusion
inferredcites →https://doi.org/10.1016/s0920-5489(02)00105-8openalex-snapshot
A survey of permission-based distributed mutual exclusion algorithms
inferredcites →https://doi.org/10.1109/12.223674openalex-snapshot
Availability of k-coterie
inferredcites →https://doi.org/10.1109/fscs.1990.89525openalex-snapshot
A dining philosophers algorithm with polynomial response time
inferredcites →https://doi.org/10.1109/icdcs.2008.76openalex-snapshot
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
inferredcites →https://doi.org/10.1109/tmc.2009.137openalex-snapshot
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1145/1780.1804openalex-snapshot
The drinking philosophers problem
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/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/800141.804654openalex-snapshot
Fast allocation of nearby resources in a distributed system
inferredcites →https://doi.org/10.5120/ijca2015907089openalex-snapshot
A Review of various Mutual Exclusion Algorithms in Distributed Environment

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.5628openalex-snapshot
A self‐stabilizing distributed algorithm for the local (1,|Ni|)‐critical section problem
inferred← citeshttps://doi.org/10.1002/cpe.70872openalex-snapshot
Self‐Stabilizing Algorithms for the Dynamic Total Domination Problem
inferred← citeshttps://doi.org/10.1016/j.future.2018.12.069openalex-snapshot
Design and topological analysis of probabilistic distributed mutual exclusion algorithm with unbiased refined ordering
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/candar68384.2025.00015openalex-snapshot
A self-stabilizing algorithm for the dynamic total domination problem
inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00106openalex-snapshot
A Self-Stabilizing Algorithm for the Local (1,|Ni|)-Critical Section Problem with Safe Convergence
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00093openalex-snapshot
A self-stabilizing token circulation with graceful handover on bidirectional ring networks
inferred← citeshttps://doi.org/10.15803/ijnc.12.1_103openalex-snapshot
A self-stabilizing token circulation with graceful handover on bidirectional ring networks
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.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.