On the public citation graph

The triumph and tribulation of system stabilization

0 signed · 67 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/3-540-54099-7_1openalex-snapshot

Self-stabilizing ring orientation

inferredcites →https://doi.org/10.1007/bf00264283openalex-snapshot

The instability of self-stabilization

inferredcites →https://doi.org/10.1007/bf02278852openalex-snapshot

Self-stabilizing extensions for meassage-passing systems

inferredcites →https://doi.org/10.1007/bf02278854openalex-snapshot

Stabilization and pseudo-stabilization

inferredcites →https://doi.org/10.1016/0020-0190(94)00123-5openalex-snapshot

Stabilizing observers

inferredcites →https://doi.org/10.1016/0020-0190(96)00026-9openalex-snapshot

A highly safe self-stabilizing mutual exclusion algorithm

inferredcites →https://doi.org/10.1090/dimacs/018/21openalex-snapshot

Constraint satisfaction as a basis for designing nonmasking fault-tolerance

inferredcites →https://doi.org/10.1109/12.24293openalex-snapshot

Token systems that self-stabilize

inferredcites →https://doi.org/10.1109/12.312126openalex-snapshot

Distributed reset

inferredcites →https://doi.org/10.1109/12.88464openalex-snapshot

Stabilizing communication protocols

inferredcites →https://doi.org/10.1109/26.24597openalex-snapshot

Event driven topology broadcast without sequence numbers

inferredcites →https://doi.org/10.1109/32.256850openalex-snapshot

Closure and convergence: a foundation of fault-tolerant computing

inferredcites →https://doi.org/10.1109/32.92911openalex-snapshot

Adaptive programming

inferredcites →https://doi.org/10.1109/icdcs.1992.235005openalex-snapshot

Asynchronous unison

inferredcites →https://doi.org/10.1109/icdcs.1994.302447openalex-snapshot

Constraint satisfaction as a basis for designing nonmasking fault-tolerance

inferredcites →https://doi.org/10.1109/spdp.1990.143510openalex-snapshot

Composite routing protocols

inferredcites →https://doi.org/10.1109/spdp.1990.143666openalex-snapshot

Convergence/response tradeoffs in concurrent systems

inferredcites →https://doi.org/10.1145/1017460.1017463openalex-snapshot

Self-stabilizing clock synchronization in the presence of Byzantine faults

inferredcites →https://doi.org/10.1145/151254.151256openalex-snapshot

Self-stabilization

inferredcites →https://doi.org/10.1145/197917.198104openalex-snapshot

Memory-efficient and self-stabilizing network RESET (extended abstract)

inferredcites →https://doi.org/10.1145/224964.224993openalex-snapshot

SuperStabilizing protocols for dynamic distributed systems

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.1007/3-540-45438-1_3openalex-snapshot

Easy Stabilization with an Agent

inferred← citeshttps://doi.org/10.1007/3-540-45438-1_8openalex-snapshot

The Theory of Weak Stabilization

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-3-540-76627-8_14openalex-snapshot

Stabilization of Loop-Free Redundant Routing

inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_22openalex-snapshot

r-Semi-Groups: A Generic Approach for Designing Stabilizing Silent Tasks

inferred← citeshttps://doi.org/10.1007/978-3-540-89335-6_15openalex-snapshot

Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links

inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_22openalex-snapshot

Nash Equilibria in Stabilizing Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-40213-5_2openalex-snapshot

On the Complexity of Adding Convergence

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/s446-002-8029-yopenalex-snapshot

Torus orientation

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.027openalex-snapshot

Nash equilibria in stabilizing systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.008openalex-snapshot

Automated constraint-based addition of nonmasking and stabilizing fault-tolerance

inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00207-6openalex-snapshot

Elements of security: Closure, convergence, and protection

inferred← citeshttps://doi.org/10.1016/s0140-3664(96)01151-6openalex-snapshot

Group routing without group routing tables: an exercise in protocol design

inferred← citeshttps://doi.org/10.1063/1.56339openalex-snapshot

Anticipatory programming—higher-order dynamics, fault-tolerance, composition

inferred← citeshttps://doi.org/10.1080/01495730108935264openalex-snapshot

SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS

inferred← citeshttps://doi.org/10.1109/12.600824openalex-snapshot

The request reply family of group routing protocols

inferred← citeshttps://doi.org/10.1109/32.988499openalex-snapshot

Multiphase stabilization

inferred← citeshttps://doi.org/10.1109/dsn.2001.941423openalex-snapshot

Graybox stabilization

inferred← citeshttps://doi.org/10.1109/edcc.2012.22openalex-snapshot

Swarm Synthesis of Convergence for Symmetric Protocols

inferred← citeshttps://doi.org/10.1109/icdcs.1996.507968openalex-snapshot

Group routing without group routing tables

inferred← citeshttps://doi.org/10.1109/icdcs.2012.66openalex-snapshot

Local Reasoning for Global Convergence of Parameterized Rings

inferred← citeshttps://doi.org/10.1109/icdcsw.2014.28openalex-snapshot

Preserving Routes during Fast Convergence

inferred← citeshttps://doi.org/10.1109/icon.1999.796156openalex-snapshot

Dynamic multicast trees

inferred← citeshttps://doi.org/10.1109/icpp.1998.708472openalex-snapshot

Low-cost fault-tolerance in barrier synchronizations

inferred← citeshttps://doi.org/10.1109/ipdps.2011.30openalex-snapshot

A Lightweight Method for Automated Design of Convergence

inferred← citeshttps://doi.org/10.1109/ipdps.2011.364openalex-snapshot

Lightweight Methods for Automated Design of Self-Stabilization

inferred← citeshttps://doi.org/10.1109/pdcat.2009.85openalex-snapshot

Consistent Fixed Points and Negative Gain

inferred← citeshttps://doi.org/10.1109/prdc.2008.36openalex-snapshot

On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems

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/sai.2016.7556052openalex-snapshot

An efficient self-stabilizing vertex coloring algorithm

inferred← citeshttps://doi.org/10.1109/slfstb.1999.777485openalex-snapshot

An exercise in proving convergence through transfer functions

inferred← citeshttps://doi.org/10.1109/srds.2009.11openalex-snapshot

Constraint Based Automated Synthesis of Nonmasking and Stabilizing Fault-Tolerance

inferred← citeshttps://doi.org/10.1109/tdsc.2014.2315191openalex-snapshot

On the Hardness of Adding Nonmasking Fault Tolerance

inferred← citeshttps://doi.org/10.1109/tpds.2015.2388480openalex-snapshot

Specification-Based Design of Self-Stabilization

inferred← citeshttps://doi.org/10.1145/2382570.2382574openalex-snapshot

A Lightweight Method for Automated Design of Convergence in Network Protocols

inferred← citeshttps://doi.org/10.1145/248052.248057openalex-snapshot

Fault-containing self-stabilizing algorithms

inferred← citeshttps://doi.org/10.1201/9780203323687.ch23openalex-snapshot

Self-Stabilizing Distributed Systems and Sensor Networks

inferred← citeshttps://doi.org/10.1515/9780773591141-014openalex-snapshot

Propagated Timestamps: A Scheme for the Stabilization of Maximum Flow Routing Protocols

inferred← citeshttps://doi.org/10.25335/m5jh3d441openalex-snapshot

Towards automated model revision for fault-tolerant systems

inferred← citeshttps://doi.org/10.3233/hsn-2005-254openalex-snapshot

Hello again: Stabilization of the Hello protocol in OSPF

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.37099/mtu.dc.etds/178openalex-snapshot

Automated design of self-stabilization

inferred← citeshttps://doi.org/10.48550/arxiv.1601.03767openalex-snapshot

Formally Proving and Enhancing a Self-Stabilising Distributed Algorithm

inferred← citeshttps://doi.org/10.70675/8d012040zdec4z46e9z913ez123834fc2ea4openalex-snapshot

Clustering avec reconfigurations locales pour des systèmes distribués dynamiques

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.