On the public citation graph
Uniform and self-stabilizing token rings allowing unfair daemon
0 signed · 45 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/3-540-61769-8_20openalex-snapshot
A timestamp based transformation of self-stabilizing programs for distributed computing environments
inferredcites →https://doi.org/10.1016/0020-0190(88)90131-7openalex-snapshot
An exercise in proving self-stabilization with a variant function
inferredcites →https://doi.org/10.1016/0020-0190(90)90107-9openalex-snapshot
Probabilistic self-stabilization
inferredcites →https://doi.org/10.1109/icdcs.1994.302448openalex-snapshot
Distributed execution model for self-stabilizing systems
inferredcites →https://doi.org/10.1109/simsym.1992.227579openalex-snapshot
Simulation of self-stabilizing algorithms in distributed systems
inferredcites →https://doi.org/10.1137/0406029openalex-snapshot
Collisions Among Random Walks on a Graph
inferredcites →https://doi.org/10.1145/169683.174161openalex-snapshot
Leader election in uniform rings
inferredcites →https://doi.org/10.1145/197917.198141openalex-snapshot
Probabilistic self-stabilizing mutual exclusion in uniform rings
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/93385.93409openalex-snapshot
Token management schemes and random walks yield self-stabilizing mutual exclusion
inferredcites →https://doi.org/10.11501/3106036openalex-snapshot
A Study on Distributed k-Mutual Exclusion Algorithms
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.70872openalex-snapshot
Self‐Stabilizing Algorithms for the Dynamic Total Domination Problem
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/3-540-45414-4_17openalex-snapshot
Randomized Finite-state Distributed Algorithms As Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-45438-1_2openalex-snapshot
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_15openalex-snapshot
Randomized Dining Philosophers without Fairness Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_7openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_31openalex-snapshot
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
inferred← citeshttps://doi.org/10.1007/s00446-003-0102-zopenalex-snapshot
Randomized dining philosophers without fairness assumption
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.1016/j.ipl.2015.01.008openalex-snapshot
Self-stabilizing distributed algorithm for local mutual inclusion
inferred← citeshttps://doi.org/10.1109/71.689445openalex-snapshot
A self-stabilizing ring orientation algorithm with a smaller number of processor states
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846023openalex-snapshot
Self-stabilizing mutual exclusion using unfair distributed scheduler
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/reldis.2002.1180189openalex-snapshot
Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct
inferred← citeshttps://doi.org/10.1109/tii.2020.2990732openalex-snapshot
A Consortium Blockchain-Enabled Secure and Privacy-Preserving Optimized Charging and Discharging Trading Scheme for Electric Vehicles
inferred← citeshttps://doi.org/10.1109/tsg.2019.2958971openalex-snapshot
An Iterative Two-Layer Optimization Charging and Discharging Trading Scheme for Electric Vehicle Using Consortium Blockchain
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.1142/s0129626406002460openalex-snapshot
A RANDOMIZED 1-LATENT, TIME-ADAPTIVE AND SAFE SELF-STABILIZING MUTUAL EXCLUSION PROTOCOL
inferred← citeshttps://doi.org/10.1142/s0129626414500029openalex-snapshot
Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator
inferred← citeshttps://doi.org/10.1145/2484239.2484246openalex-snapshot
Introducing speculation in self-stabilization
inferred← citeshttps://doi.org/10.1145/301308.301358openalex-snapshot
Memory space requirements for self-stabilizing leader election protocols
inferred← citeshttps://doi.org/10.1145/343477.343626openalex-snapshot
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
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.1302.2217openalex-snapshot
Introducing Speculation in Self-Stabilization - An Application to Mutual Exclusion
inferred← citeshttps://doi.org/10.48550/arxiv.1606.01451openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report)
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.