On the public citation graph

Self-stabilization with r-operators

https://doi.org/10.1007/pl00008934
0 signed · 61 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.1002/0471725250.scardopenalex-snapshot
Wiley Series in Probability and Mathematics Statistics
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.1007/bf02278851openalex-snapshot
Self-stabilization of dynamic systems assuming only read/write atomicity
inferredcites →https://doi.org/10.1007/bf02278855openalex-snapshot
Convergence of iteration systems
inferredcites →https://doi.org/10.1007/bfb0020443openalex-snapshot
Self-stabilization by local checking and global reset
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1057/jors.1994.15openalex-snapshot
Synchronization and Linearity: An Algebra for Discrete Event Systems
inferredcites →https://doi.org/10.1109/icdcs.1998.679492openalex-snapshot
Self-stabilization with global rooted synchronizers
inferredcites →https://doi.org/10.1109/icnp.1998.723727openalex-snapshot
Maximizable routing metrics
inferredcites →https://doi.org/10.1109/sfcs.1991.185378openalex-snapshot
Self-stabilization by local checking and correction
inferredcites →https://doi.org/10.1109/slfstb.1999.777481openalex-snapshot
Stabilization of maximal metric trees
inferredcites →https://doi.org/10.1142/s0129626499000529openalex-snapshot
SELF-STABILIZING ALGORITHMS IN DAG STRUCTURED NETWORKS
inferredcites →https://doi.org/10.1145/151254.151256openalex-snapshot
Self-stabilization
inferredcites →https://doi.org/10.1145/224964.224993openalex-snapshot
SuperStabilizing protocols for dynamic distributed systems
inferredcites →https://doi.org/10.1145/248052.248055openalex-snapshot
Memory requirements for silent stabilization
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/93385.93407openalex-snapshot
Self-stabilization of dynamic systems assuming only read/write atomicity
inferredcites →https://doi.org/10.5555/314161.314193openalex-snapshot
Self-Stabilizing Unidirectional Network Algorithms by Power Supply.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcm.2591openalex-snapshot
ECDGP: extended cluster‐based data gathering protocol for vehicular networks
inferred← citeshttps://doi.org/10.1007/11577327_5openalex-snapshot
Self-stabilization with r-Operators Revisited
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_14openalex-snapshot
Route Preserving Stabilization
inferred← citeshttps://doi.org/10.1007/978-3-030-03232-6_13openalex-snapshot
Acyclic Strategy for Silent Self-stabilization in Spanning Forests
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_19openalex-snapshot
Fault Tolerant Network Constructors
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-49823-0_16openalex-snapshot
Selfish Stabilization
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-77444-0_17openalex-snapshot
Snap-Stabilizing Waves in Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_19openalex-snapshot
Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_10openalex-snapshot
On Byzantine Containment Properties of the min + 1 Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_15openalex-snapshot
Self-stabilizing Distributed Data Fusion
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/s00446-007-0029-xopenalex-snapshot
Transient fault detectors
inferred← citeshttps://doi.org/10.1007/s00453-014-9913-5openalex-snapshot
Maximum Metric Spanning Tree Made Byzantine Tolerant
inferred← citeshttps://doi.org/10.1007/s00453-021-00878-9openalex-snapshot
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105037openalex-snapshot
Fault tolerant network constructors
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.2024.114744openalex-snapshot
Resource efficient stabilization for local tasks despite unknown capacity links
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00238-4openalex-snapshot
Self-stabilization with path algebra
inferred← citeshttps://doi.org/10.1093/comjnl/bxh154openalex-snapshot
Snap-Stabilizing Depth-First Search on Arbitrary Networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxv110openalex-snapshot
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property
inferred← citeshttps://doi.org/10.1109/icdcs.2010.69openalex-snapshot
Stabilizing Locally Maximizable Tasks in Unidirectional Networks Is Hard
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161053openalex-snapshot
Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks
inferred← citeshttps://doi.org/10.1109/ivs.2012.6232266openalex-snapshot
COL: A data collection protocol for VANET
inferred← citeshttps://doi.org/10.1109/pdcat.2009.85openalex-snapshot
Consistent Fixed Points and Negative Gain
inferred← citeshttps://doi.org/10.1109/srds.2016.046openalex-snapshot
Experiments with Self-Stabilizing Distributed Data Fusion
inferred← citeshttps://doi.org/10.1142/s0129626405002143openalex-snapshot
A SILENT SELF-STABILIZING ALGORITHM FOR FINDING CUT-NODES AND BRIDGES
inferred← citeshttps://doi.org/10.1145/1452001.1452005openalex-snapshot
An exercise in selfish stabilization
inferred← citeshttps://doi.org/10.1145/1810479.1810525openalex-snapshot
Best-effort group service in dynamic networks
inferred← citeshttps://doi.org/10.1145/3544585.3544592openalex-snapshot
Origin of Self-Stabilization
inferred← citeshttps://doi.org/10.1145/3662158.3662778openalex-snapshot
On Self-stabilizing Leader Election in Directed Networks
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.2514/1.19848openalex-snapshot
Self-Stabilization with r-Operators revisited
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.48550/arxiv.0805.0851openalex-snapshot
Bounds for self-stabilization in unidirectional networks
inferred← citeshttps://doi.org/10.48550/arxiv.0810.3836openalex-snapshot
Best-effort Group Service in Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0903.3106openalex-snapshot
Stabilizing Maximal Independent Set in Unidirectional Networks is Hard
inferred← citeshttps://doi.org/10.48550/arxiv.1005.5223openalex-snapshot
On Byzantine Containment Properties of the $min+1$ Protocol
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4022openalex-snapshot
Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05382openalex-snapshot
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links
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.