On the public citation graph
A belated proof of self-stabilization
0 signed · 123 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.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1998.1606openalex-snapshot
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0059openalex-snapshot
A Self-Stabilizing Leader Election Algorithm for Tree Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_14openalex-snapshot
Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_7openalex-snapshot
Self-Stabilizing Token Circulation on Uniform Trees by Using Edge-Tokens
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/3-540-45438-1_5openalex-snapshot
Dijkstra’s Self-Stabilizing Algorithm in Unsupportive Environments
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_17openalex-snapshot
A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_27openalex-snapshot
Verifying a Self-Stabilizing Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-58892-2_16openalex-snapshot
Self-Stabilizing Domination Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_20openalex-snapshot
Implicit Rankings for Verifying Liveness Properties in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_10openalex-snapshot
Self-stabilizing Resource Discovery Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-11764-5_12openalex-snapshot
SMT-Based Synthesis of Distributed Self-stabilizing Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-39570-8_9openalex-snapshot
Specification-Based Synthesis of Distributed Self-Stabilizing Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_15openalex-snapshot
ASSESS: A Tool for Automated Synthesis of Distributed Self-stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-90089-6_2openalex-snapshot
Self-stabilization Through the Lens of Game Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-24604-6_3openalex-snapshot
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_19openalex-snapshot
On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_4openalex-snapshot
A Self-stabilizing Algorithm For 3-Edge-Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_11openalex-snapshot
On the Performance of Dijkstra’s Third Self-stabilizing Algorithm for Mutual Exclusion
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_5openalex-snapshot
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_6openalex-snapshot
Fast Distributed Approximations in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_4openalex-snapshot
Systematic Correct Construction of Self-stabilizing Systems: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-46604-5_3openalex-snapshot
Derivation of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_29openalex-snapshot
CoLoSL: Concurrent Local Subjective Logic
inferred← citeshttps://doi.org/10.1007/bf02278851openalex-snapshot
Self-stabilization of dynamic systems assuming only read/write atomicity
inferred← citeshttps://doi.org/10.1007/bf02278856openalex-snapshot
A self-stabilizing algorithm for coloring planar graphs
inferred← citeshttps://doi.org/10.1007/bf02278857openalex-snapshot
Self-stabilizing depth-first token circulation on networks
inferred← citeshttps://doi.org/10.1007/pl00008931openalex-snapshot
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
inferred← citeshttps://doi.org/10.1007/s00236-019-00361-7openalex-snapshot
Parameterized synthesis of self-stabilizing protocols in symmetric networks
inferred← citeshttps://doi.org/10.1007/s00446-006-0001-1openalex-snapshot
An efficient fault-containing self-stabilizing algorithm for the shortest path problem
inferred← citeshttps://doi.org/10.1007/s00446-010-0104-6openalex-snapshot
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms
inferred← citeshttps://doi.org/10.1007/s004460050035openalex-snapshot
Self-stabilizing token circulation in uniform networks
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90125-6openalex-snapshot
On distributed snapshots
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90131-7openalex-snapshot
An exercise in proving self-stabilization with a variant function
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90111-topenalex-snapshot
A self-stabilizing algorithm for constructing spanning trees
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90172-eopenalex-snapshot
Binary self-stabilization in distributed systems
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90015-nopenalex-snapshot
A self-stabilizing algorithm for maximal matching
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90264-vopenalex-snapshot
A self-stabilizing algorithm for constructing breadth-first trees
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90121-2openalex-snapshot
A self-stabilizing algorithm for coloring bipartite graphs
inferred← citeshttps://doi.org/10.1016/0045-7906(94)90037-xopenalex-snapshot
A self-stabilizing algorithm to synchronize digital clocks in a distributed system
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90044-nopenalex-snapshot
On the complexity of deadlock-free programs on a ring of processors
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00143-mopenalex-snapshot
A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.01.014openalex-snapshot
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.05.002openalex-snapshot
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.01.021openalex-snapshot
A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.02.052openalex-snapshot
Quasi-self-stabilization of a distributed system assuming read/write atomicity
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.12.011openalex-snapshot
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.004openalex-snapshot
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00183-8openalex-snapshot
A self-stabilizing algorithm which finds a 2-center of a tree
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90143-xopenalex-snapshot
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00068-6openalex-snapshot
A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
inferred← citeshttps://doi.org/10.1080/00207160410001708779openalex-snapshot
Reliable synchronization in distributed systems
inferred← citeshttps://doi.org/10.1080/01495730108935264openalex-snapshot
SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
inferred← citeshttps://doi.org/10.1080/10637199408915459openalex-snapshot
A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
inferred← citeshttps://doi.org/10.1080/10637199708915620openalex-snapshot
A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
inferred← citeshttps://doi.org/10.1109/71.899941openalex-snapshot
Symbolic model checking for self-stabilizing algorithms
inferred← citeshttps://doi.org/10.1109/ase.2013.6693075openalex-snapshot
Ranger: Parallel analysis of alloy models by range partitioning
inferred← citeshttps://doi.org/10.1109/eeis.1989.720146openalex-snapshot
Self Stabilization of Dynamic Systems
inferred← citeshttps://doi.org/10.1109/ftcs.1995.466988openalex-snapshot
Self-stabilizing mutual exclusion in the presence of faulty nodes
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235106openalex-snapshot
Analyzing self-stabilization with finite-state machine model
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302448openalex-snapshot
Distributed execution model for self-stabilizing systems
inferred← citeshttps://doi.org/10.1109/icdcs.2006.21openalex-snapshot
Computing in the Presence of Timing Failures
inferred← citeshttps://doi.org/10.1109/icpp.1999.797437openalex-snapshot
Mobility tolerant maintenance of multi-cast tree in mobile multi-hop radio networks
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016537openalex-snapshot
Fault tolerant distributed coloring algorithms that stabilize in linear time
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213302openalex-snapshot
Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213437openalex-snapshot
A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303177openalex-snapshot
Fault tolerant algorithms for orderings and colorings
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.370265openalex-snapshot
Energy-Aware Self-Stabilization in Mobile Ad Hoc Networks: A Multicasting Case Study
inferred← citeshttps://doi.org/10.1109/issre.1993.624289openalex-snapshot
A new fault tolerant distributed algorithm for longest paths in a DAG
inferred← citeshttps://doi.org/10.1109/istcs.1993.253472openalex-snapshot
Structured design of self-stabilizing programs
inferred← citeshttps://doi.org/10.1109/pccc.1998.659897openalex-snapshot
A fault-tolerant token passing algorithm on tree networks
inferred← citeshttps://doi.org/10.1109/prdc.2014.21openalex-snapshot
Exploiting Synchronicity for Immediate Feedback in Self-Stabilizing PIF Algorithms
inferred← citeshttps://doi.org/10.1109/reldis.1994.336913openalex-snapshot
A methodology for constructing a stabilizing crash-tolerant application
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/slfstb.1999.777484openalex-snapshot
A case-study in component-based mechanical verification of fault-tolerant programs
inferred← citeshttps://doi.org/10.1109/spdp.1996.570316openalex-snapshot
Almost two-state self-stabilizing algorithm for token rings
inferred← citeshttps://doi.org/10.1109/tpds.2003.1225054openalex-snapshot
An efficient fault-containing self-stabilizing algorithm for finding a maximal independent set
inferred← citeshttps://doi.org/10.1109/tpds.2006.47openalex-snapshot
How to improve safety under convergence using stable storage
inferred← citeshttps://doi.org/10.1109/tse.2015.2510001openalex-snapshot
A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors
inferred← citeshttps://doi.org/10.1134/s1064230721020131openalex-snapshot
Game Theoretic Analysis of Self-Stabilizing Systems on Arrays
inferred← citeshttps://doi.org/10.1142/s012905410500284xopenalex-snapshot
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
inferred← citeshttps://doi.org/10.1142/s0129054106003851openalex-snapshot
SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
inferred← citeshttps://doi.org/10.1142/s0129054111008623openalex-snapshot
SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS
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/s0129626413500011openalex-snapshot
SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS
inferred← citeshttps://doi.org/10.1145/155183.155228openalex-snapshot
An alternative solution to a problem on self-stabilization
inferred← citeshttps://doi.org/10.1145/169683.174161openalex-snapshot
Leader election in uniform rings
inferred← citeshttps://doi.org/10.1145/2767133openalex-snapshot
SMT-Based Synthesis of Distributed Self-Stabilizing Systems
inferred← citeshttps://doi.org/10.1145/343477.343626openalex-snapshot
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
inferred← citeshttps://doi.org/10.1145/93385.93407openalex-snapshot
Self-stabilization of dynamic systems assuming only read/write atomicity
inferred← citeshttps://doi.org/10.1504/ijhpcn.2011.038709openalex-snapshot
A self-stabilising algorithm for 3-edge-connectivity
inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot
Time- and space-efficient self-stabilizing algorithms
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1570openalex-snapshot
On the Time Complexity of Dijkstra's Three-State Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.21220/s2-qa9t-5z25openalex-snapshot
Files As First-Class Objects In Fault -Tolerant Concurrent Systems
inferred← citeshttps://doi.org/10.23638/lmcs-14(1:12)2018openalex-snapshot
Automated Synthesis of Distributed Self-Stabilizing Protocols
inferred← citeshttps://doi.org/10.31237/osf.io/r2bxwopenalex-snapshot
Modelling and Verification of Multi-agent Hybrid Systems
inferred← citeshttps://doi.org/10.4018/978-1-4666-1574-8.ch003openalex-snapshot
Wave Propagation in Filamental Cellular Automata
inferred← citeshttps://doi.org/10.4018/jncr.2010010103openalex-snapshot
Wave Propagation in Filamental Cellular Automata
inferred← citeshttps://doi.org/10.4204/eptcs.96.2openalex-snapshot
Rapid Recovery for Systems with Scarce Faults
inferred← citeshttps://doi.org/10.48550/arxiv.1901.04709openalex-snapshot
Self-Stabilization Through the Lens of Game Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10275openalex-snapshot
2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network
inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
inferred← citeshttps://doi.org/10.6688/jise.2008.24.6.6openalex-snapshot
A Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems
inferred← citeshttps://doi.org/10.6688/jise.2010.26.1.12openalex-snapshot
A Fault-Containing Self-Stabilizing Algorithm for 6-Coloring Planar Graphs
inferred← citeshttps://doi.org/10.70675/85771ea9z2e41z4a55z8d32z371ff7342705openalex-snapshot
Asynchronous Self-Stabilizing Stable Marriage
inferred← citeshttps://doi.org/10.7936/k75h7dh9openalex-snapshot
2-Edge-Connectivity and 2-Vertex-Connectivity with Fault Containment
inferred← citeshttps://doi.org/10.7936/k7ht2mjjopenalex-snapshot
Studying Network Optimization in the Context of Self-Stabilization
inferred← citeshttps://doi.org/10.7936/k7ng4nw0openalex-snapshot
Self-Stabilization in the Distributed Systems of Finite State Machines
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.