On the public citation graph
Deterministic, constant space, self-stabilizing leader election on uniform rings
0 signed · 42 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.1016/0020-0190(90)90107-9openalex-snapshot
Probabilistic self-stabilization
inferredcites →https://doi.org/10.1109/sfcs.1994.365691openalex-snapshot
Fast and lean self-stabilizing asynchronous protocols
inferredcites →https://doi.org/10.1145/129712.129777openalex-snapshot
Self-stabilizing symmetry breaking in constant-space (extended abstract)
inferredcites →https://doi.org/10.1145/169683.174161openalex-snapshot
Leader election in uniform rings
inferredcites →https://doi.org/10.1145/197917.198104openalex-snapshot
Memory-efficient and self-stabilizing network RESET (extended abstract)
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2707openalex-snapshot
Self-Stabilizing Ring Orientation Using Constant Space
inferred← citeshttps://doi.org/10.1007/11795490_10openalex-snapshot
Self-stabilizing Population Protocols
inferred← citeshttps://doi.org/10.1007/11945529_28openalex-snapshot
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_16openalex-snapshot
A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings
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-642-36065-7_15openalex-snapshot
Daemon Conversions in Distributed Self-stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_6openalex-snapshot
Compact Deterministic Self-stabilizing Leader Election
inferred← citeshttps://doi.org/10.1007/s002360050180openalex-snapshot
Memory requirements for silent stabilization
inferred← citeshttps://doi.org/10.1007/s00446-017-0294-2openalex-snapshot
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
inferred← citeshttps://doi.org/10.1007/s00446-025-00493-9openalex-snapshot
Deterministic self-stabilising leader election for programmable matter with constant memory
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.05.019openalex-snapshot
Compact self-stabilizing leader election for general networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.032openalex-snapshot
Edge motion and the distinguishing index
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.004openalex-snapshot
Precise bounds for the distinguishing index of the Cartesian product
inferred← citeshttps://doi.org/10.1109/iccnmc.2003.1243042openalex-snapshot
Arbitrator-based algorithm for measurement collaboration problem
inferred← citeshttps://doi.org/10.1109/ipdps.2005.400openalex-snapshot
Self-Stabilizing Anonymous Leader Election in a Tree
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370455openalex-snapshot
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470841openalex-snapshot
Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size
inferred← citeshttps://doi.org/10.1109/nwesp.2005.9openalex-snapshot
A Round-2 Randomized Leader Election Algorithm and Latency for MDVM System
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.1142/s0129054108006340openalex-snapshot
ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM
inferred← citeshttps://doi.org/10.1145/1452001.1452003openalex-snapshot
Self-stabilizing population protocols
inferred← citeshttps://doi.org/10.1145/2107502.2107522openalex-snapshot
Self-stabilizing leader election for single-hop wireless networks despite jamming
inferred← citeshttps://doi.org/10.1145/248052.248055openalex-snapshot
Memory requirements for silent stabilization
inferred← citeshttps://doi.org/10.1145/2635818openalex-snapshot
Principles of Robust Medium Access and an Application to Leader Election
inferred← citeshttps://doi.org/10.1145/301308.301358openalex-snapshot
Memory space requirements for self-stabilizing leader election protocols
inferred← citeshttps://doi.org/10.1145/3796701.3815940openalex-snapshot
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
inferred← citeshttps://doi.org/10.20965/jaciii.2006.p0752openalex-snapshot
MDVM System Concept, Paging Latency and Round-2 Randomized Leader Election Algorithm in SG
inferred← citeshttps://doi.org/10.3166/tsi.23.1027-1056openalex-snapshot
Autostabilisation et protocoles réseau
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/90openalex-snapshot
On the Limits and Practice of Automatically Designing Self-Stabilization
inferred← citeshttps://doi.org/10.46298/dmtcs.9335openalex-snapshot
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election 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.48550/arxiv.1401.4972openalex-snapshot
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative
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.