On the public citation graph

Self-stabilization with r-Operators Revisited

https://doi.org/10.1007/11577327_5
0 signed · 33 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.1006/jpdc.2001.1827openalex-snapshot
Tolerating Transient and Intermittent Failures
inferredcites →https://doi.org/10.1007/3-540-45032-7_2openalex-snapshot
Collision-Free Communication in Sensor Networks
inferredcites →https://doi.org/10.1007/3-540-45438-1_4openalex-snapshot
Stabilization of Routing in Directed Networks
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-27820-7_6openalex-snapshot
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/bf02278852openalex-snapshot
Self-stabilizing extensions for meassage-passing systems
inferredcites →https://doi.org/10.1007/bf02278853openalex-snapshot
Self-stabilization over unreliable communication media
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/pl00008934openalex-snapshot
Self-stabilization with r-operators
inferredcites →https://doi.org/10.1007/s00236-004-0143-1openalex-snapshot
Self-stabilizing group communication in directed networks
inferredcites →https://doi.org/10.1007/s002360050180openalex-snapshot
Memory requirements for silent stabilization
inferredcites →https://doi.org/10.1016/s0304-3975(02)00238-4openalex-snapshot
Self-stabilization with path algebra
inferredcites →https://doi.org/10.1057/jors.1994.15openalex-snapshot
Synchronization and Linearity: An Algebra for Discrete Event Systems
inferredcites →https://doi.org/10.2307/2583959openalex-snapshot
Synchronization and Linearity: An Algebra for Discrete Event Systems.
inferredcites →https://doi.org/10.4086/cjtcs.1998.003openalex-snapshot
inferredcites →https://doi.org/10.5555/314161.314193openalex-snapshot
Self-Stabilizing Unidirectional Network Algorithms by Power Supply.
inferredcites →https://doi.org/10.7551/mitpress/6156.001.0001openalex-snapshot
Self-Stabilization

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470610893.ch10openalex-snapshot
Fault‐Tolerant Distributed Algorithms for Scalable Systems
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-031-02013-1openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
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-24550-3_29openalex-snapshot
Conflict-Free Replicated Data Types
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.03.005openalex-snapshot
HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks
inferred← citeshttps://doi.org/10.1109/icdcsw.2014.28openalex-snapshot
Preserving Routes during Fast Convergence
inferred← citeshttps://doi.org/10.1109/icnc.2011.15openalex-snapshot
Self-Stabilizing Small k-Dominating Sets
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160875openalex-snapshot
Self-Stabilizing k-out-of-ℓ exclusion on tree networks
inferred← citeshttps://doi.org/10.1109/pdcat.2009.75openalex-snapshot
Stabilization of Maximal-Metric Routing without Knowledge of Network Size
inferred← citeshttps://doi.org/10.1145/1462187.1462193openalex-snapshot
Light enabling snap-stabilization of fundamental protocols
inferred← citeshttps://doi.org/10.15803/ijnc.3.1_116openalex-snapshot
Self-Stabilizing Small k-Dominating Sets
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.3166/tsi.31.1273-1299openalex-snapshot
Algorithme autostabilisant construisant un petit ensemble k-dominant
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.0812.1093openalex-snapshot
Self-stabilizing K-out-of-L exclusion on tree network
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.