On the public citation graph
Uniform dynamic self-stabilizing leader election
0 signed · 56 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-54099-7_1openalex-snapshot
Self-stabilizing ring orientation
inferredcites →https://doi.org/10.1007/3-540-54099-7_2openalex-snapshot
Memory-efficient self stabilizing protocols for general networks
inferredcites →https://doi.org/10.1016/0020-0190(79)90151-0openalex-snapshot
Self-stabilization (in spite of distributed control) in tree-structured systems
inferredcites →https://doi.org/10.1109/cdc.1984.272191openalex-snapshot
Selecting a leader in a clique in 0(N log N) messages
inferredcites →https://doi.org/10.1109/eeis.1989.720146openalex-snapshot
Self Stabilization of Dynamic Systems
inferredcites →https://doi.org/10.1109/sfcs.1991.185377openalex-snapshot
Distributed program checking: a paradigm for building self-stabilizing distributed protocols
inferredcites →https://doi.org/10.1145/112600.112624openalex-snapshot
Resource bounds for self stabilizing message driven protocols
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.1145/69622.357194openalex-snapshot
An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
inferredcites →https://doi.org/10.1145/72981.73004openalex-snapshot
Calling names in nameless networks
inferredcites →https://doi.org/10.1145/77606.77610openalex-snapshot
A modular technique for the design of efficient distributed leader finding algorithms
inferredcites →https://doi.org/10.1145/800222.806747openalex-snapshot
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
inferredcites →https://doi.org/10.1145/93385.93405openalex-snapshot
Self-stabilizing extensions for message-passing systems
inferredcites →https://doi.org/10.1145/93385.93407openalex-snapshot
Self-stabilization of dynamic systems assuming only read/write atomicity
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.1997.1317openalex-snapshot
Self-Stabilizing Routing and Related Protocols
inferred← citeshttps://doi.org/10.1007/11549468_68openalex-snapshot
Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_14openalex-snapshot
Memory adaptive self-stabilizing protocols (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_34openalex-snapshot
Optimal time self stabilization in dynamic systems
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_35openalex-snapshot
Tolerating transient and permanent failures (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_72openalex-snapshot
Time optimal self-stabilizing spanning tree algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-02013-1openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-72685-2_67openalex-snapshot
A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_10openalex-snapshot
Time Optimal Asynchronous Self-stabilizing Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_25openalex-snapshot
Self-stabilizing Algorithm of Two-Hop Conflict Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_7openalex-snapshot
Time Optimal Synchronous Self Stabilizing Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_16openalex-snapshot
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs
inferred← citeshttps://doi.org/10.1007/bfb0020442openalex-snapshot
Average and randomized complexity of distributed problems
inferred← citeshttps://doi.org/10.1007/bfb0022152openalex-snapshot
A uniform self-stabilizing minimum diameter spanning tree algorithm
inferred← citeshttps://doi.org/10.1007/bfb0022436openalex-snapshot
More on the power of random walks: Uniform self-stabilizing randomized algorithms
inferred← citeshttps://doi.org/10.1007/s00446-007-0032-2openalex-snapshot
Fault-containing self-stabilizing distributed protocols
inferred← citeshttps://doi.org/10.1007/s004460050017openalex-snapshot
Design and analysis of dynamic leader election protocols in broadcast networks
inferred← citeshttps://doi.org/10.1007/s004460050035openalex-snapshot
Self-stabilizing token circulation in uniform networks
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90103-1openalex-snapshot
Self-stabilizing depth-first search
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00150-8openalex-snapshot
On the computational power of self-stabilizing systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00286-1openalex-snapshot
The local detection paradigm and its applications to self-stabilization
inferred← citeshttps://doi.org/10.1109/chinacom.2009.5339815openalex-snapshot
A self-stabilizing leader election algorithm in OneHop DHT
inferred← citeshttps://doi.org/10.1109/ipdps.2005.400openalex-snapshot
Self-Stabilizing Anonymous Leader Election in a Tree
inferred← citeshttps://doi.org/10.1137/s0097539792235074openalex-snapshot
Resource Bounds for Self-Stabilizing Message-Driven Protocols
inferred← citeshttps://doi.org/10.1137/s0097539793252432openalex-snapshot
Average and Randomized Complexity of Distributed Problems
inferred← citeshttps://doi.org/10.1137/s0097539798285997openalex-snapshot
Self-Stabilizing Symmetry Breaking in Constant Space
inferred← citeshttps://doi.org/10.1145/1017460.1017463openalex-snapshot
Self-stabilizing clock synchronization in the presence of Byzantine faults
inferred← citeshttps://doi.org/10.1145/112600.112624openalex-snapshot
Resource bounds for self stabilizing message driven protocols
inferred← citeshttps://doi.org/10.11501/3106036openalex-snapshot
A Study on Distributed k-Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.47749/t/unicamp.1998.128514openalex-snapshot
Algoritmos para eleição de lider em sistemas distribuidos
inferred← citeshttps://doi.org/10.5555/313852.314120openalex-snapshot
Self-stabilizing algorithms for synchronous unidirectional rings
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
inferred← citeshttps://doi.org/10.70675/7460ac8fzfa00z40a2z84d6z573cfd929fa2openalex-snapshot
Independent sets and beyond, through the prism of distributed systems and colored graphs
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.