On the public citation graph

Self-stabilizing mutual exclusion using unfair distributed scheduler

0 signed · 35 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/978-3-540-48654-1_35openalex-snapshot
Probabilistic Simulations for Probabilistic Processes
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_37openalex-snapshot
Composition and Behaviors of Probabilistic I/O Automata
inferredcites →https://doi.org/10.1007/bf02252680openalex-snapshot
Self-stabilization: randomness to reduce space
inferredcites →https://doi.org/10.1016/0020-0190(90)90107-9openalex-snapshot
Probabilistic self-stabilization
inferredcites →https://doi.org/10.1016/s0020-0190(00)00056-9openalex-snapshot
Randomized uniform self-stabilizing mutual exclusion
inferredcites →https://doi.org/10.1109/32.295897openalex-snapshot
Two-state self-stabilizing algorithms for token rings
inferredcites →https://doi.org/10.1109/32.387472openalex-snapshot
Analyzing expected time by scheduler-luck games
inferredcites →https://doi.org/10.1109/71.577257openalex-snapshot
Uniform and self-stabilizing token rings allowing unfair daemon
inferredcites →https://doi.org/10.1109/ipdps.2000.846023openalex-snapshot
Self-stabilizing mutual exclusion using unfair distributed scheduler
inferredcites →https://doi.org/10.1145/151254.151256openalex-snapshot
Self-stabilization
inferredcites →https://doi.org/10.1145/169683.174161openalex-snapshot
Leader election in uniform rings
inferredcites →https://doi.org/10.1145/301308.301358openalex-snapshot
Memory space requirements for self-stabilizing leader election protocols
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/63264.63403openalex-snapshot
Uniform self-stabilizing rings
inferredcites →https://doi.org/10.1145/93385.93409openalex-snapshot
Token management schemes and random walks yield self-stabilizing mutual exclusion

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.2001.1831openalex-snapshot
Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1832openalex-snapshot
Token-Based Self-Stabilizing Uniform Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_4openalex-snapshot
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_16openalex-snapshot
Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_30openalex-snapshot
Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links
inferred← citeshttps://doi.org/10.1016/j.ijcip.2014.12.002openalex-snapshot
Critical infrastructure protection: Requirements and challenges for the 21st century
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.01.004openalex-snapshot
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918936openalex-snapshot
Tight space self-stabilizing uniform l-mutual exclusion
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302973openalex-snapshot
Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.7openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation Algorithm in an Undirected Ring of Arbitrary Size and Its Orientation
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180176openalex-snapshot
Service time optimal self-stabilizing token circulation protocol on anonymous undirectional rings
inferred← citeshttps://doi.org/10.1109/wi.2018.0-109openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation in Unoriented Cactus Graphs
inferred← citeshttps://doi.org/10.1145/343477.343626openalex-snapshot
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
inferred← citeshttps://doi.org/10.1201/9781584888215-c26openalex-snapshot
Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_42openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation Algorithm in Undirected Rings and Unicyclic Graphs of Arbitrary Size and Their Orientations
inferred← citeshttps://doi.org/10.3166/tsi.23.1027-1056openalex-snapshot
Autostabilisation et protocoles réseau
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.24openalex-snapshot
A Taxonomy of Daemons in Self-stabilization
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2494openalex-snapshot
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes
inferred← citeshttps://doi.org/10.7936/k7ht2mjjopenalex-snapshot
Studying Network Optimization in the Context of Self-Stabilization
showing the first 19 of 20 · page through all 20
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.