On the public citation graph
A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm
0 signed · 25 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.2001.1834openalex-snapshot
Space and Time Efficient Self-Stabilizing ℓ-Exclusion in Tree Networks
inferredcites →https://doi.org/10.1007/3-540-45438-1_10openalex-snapshot
A New Efficient Tool for the Design of Self-Stabilizing ℓ-Exclusion Algorithms: The Controller
inferredcites →https://doi.org/10.1007/3-540-54029-6_209openalex-snapshot
A distributed solution to the k-out of-M resources allocation problem
inferredcites →https://doi.org/10.1007/bf02242715openalex-snapshot
Self-stabilizing multi-token rings
inferredcites →https://doi.org/10.1007/bf02278853openalex-snapshot
Self-stabilization over unreliable communication media
inferredcites →https://doi.org/10.1007/bfb0020419openalex-snapshot
Distributed Algorithms: 8th International Workshop, Wdag'1994 Terschelling, the Netherlands September 29-October 1, 1994 : Proceedings
inferredcites →https://doi.org/10.1016/s0304-3975(97)00303-4openalex-snapshot
k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://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
inferredcites →https://doi.org/10.1109/icdcs.2000.840972openalex-snapshot
Self-stabilizing network orientation algorithms in arbitrary rooted networks
inferredcites →https://doi.org/10.1145/197917.198102openalex-snapshot
Self-stabilization by counter flushing
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/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/62212.62220openalex-snapshot
Toward a non-atomic era: l-exclusion as a test case
inferredcites →https://doi.org/10.1515/9780773591141openalex-snapshot
International Informatics Series 7
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.3696openalex-snapshot
Ray‐tracing domain decomposition methods for real‐time simulation on multi‐core and multi‐processor systems
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_76openalex-snapshot
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_6openalex-snapshot
Concurrency in Snap-Stabilizing Local Resource Allocation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.09.004openalex-snapshot
Snap-stabilizing committee coordination
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.11.004openalex-snapshot
Concurrency in snap-stabilizing local resource allocation
inferred← citeshttps://doi.org/10.1016/s2307-1877(25)00973-3openalex-snapshot
A stabilizing l-exclusion algorithm in arbitrary rooted networks
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160875openalex-snapshot
Self-Stabilizing k-out-of-ℓ exclusion on tree networks
inferred← citeshttps://doi.org/10.1109/ipdps.2011.31openalex-snapshot
Snap-Stabilizing Committee Coordination
inferred← citeshttps://doi.org/10.1142/s0129054111008283openalex-snapshot
SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS
inferred← citeshttps://doi.org/10.48550/arxiv.0812.1093openalex-snapshot
Self-stabilizing K-out-of-L exclusion on tree network
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.