On the public citation graph
Self-stabilization over unreliable communication media
0 signed · 98 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.1007/bf02278852openalex-snapshot
Self-stabilizing extensions for meassage-passing systems
inferredcites →https://doi.org/10.1016/0020-0190(79)90151-0openalex-snapshot
Self-stabilization (in spite of distributed control) in tree-structured systems
inferredcites →https://doi.org/10.1016/0376-5075(76)90015-5openalex-snapshot
A data transfer protocol
inferredcites →https://doi.org/10.1016/0898-1221(82)90043-8openalex-snapshot
Bounds on the size and transmission rate of communications protocols
inferredcites →https://doi.org/10.1109/26.2744openalex-snapshot
Reliable link initialization procedures
inferredcites →https://doi.org/10.1109/sfcs.1987.7openalex-snapshot
Applying static network protocols to dynamic networks
inferredcites →https://doi.org/10.1109/tcom.1985.1096296openalex-snapshot
On "A Simple Protocol Whose Proof Isńt": The State Machine Approach
inferredcites →https://doi.org/10.1109/tcom.1985.1096306openalex-snapshot
A Simple Protocol Whose Proof Isn't
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1145/62546.62570openalex-snapshot
End-to-end communication in unreliable networks
inferredcites →https://doi.org/10.1145/62546.62572openalex-snapshot
Data link layer: two impossibility results
inferredcites →https://doi.org/10.1145/93385.93405openalex-snapshot
Self-stabilizing extensions for message-passing systems
inferredcites →https://doi.org/10.21236/ada200983openalex-snapshot
The Data Link Layer: Two Impossibility Results
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.781openalex-snapshot
A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1317openalex-snapshot
Self-Stabilizing Routing and Related Protocols
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1825openalex-snapshot
Finite-State Self-Stabilizing Protocols in Message-Passing Systems
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1827openalex-snapshot
Tolerating Transient and Intermittent Failures
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_9openalex-snapshot
A New Self-Stabilizing κ-out-of-ℓ Exclusion Algorithm on Rings
inferred← citeshttps://doi.org/10.1007/3-540-45438-1_10openalex-snapshot
A New Efficient Tool for the Design of Self-Stabilizing ℓ-Exclusion Algorithms: The Controller
inferred← citeshttps://doi.org/10.1007/3-540-45438-1_6openalex-snapshot
Communication Adaptive Self-Stabilizing Group Membership Service
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_76openalex-snapshot
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm
inferred← citeshttps://doi.org/10.1007/978-0-387-69858-8_1openalex-snapshot
The Wandering Token: Congestion Avoidance of a Shared Resource
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_3openalex-snapshot
Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_22openalex-snapshot
Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications
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-319-11764-5_21openalex-snapshot
Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model
inferred← citeshttps://doi.org/10.1007/978-3-540-92295-7_34openalex-snapshot
Snap-Stabilization in Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_25openalex-snapshot
Separation of Circulating Tokens
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_19openalex-snapshot
Self-stabilizing (k,r)-Clustering in Clock Rate-Limited Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_14openalex-snapshot
Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_4openalex-snapshot
Temporal Logic for Stabilizing Systems
inferred← citeshttps://doi.org/10.1007/bfb0002772openalex-snapshot
A space-efficient and self-stabilizing depth-first token circulation protocol for asynchronous message-passing systems
inferred← citeshttps://doi.org/10.1007/bfb0049408openalex-snapshot
Non-exploratory self-stabilization for constant-space symmetry-breaking
inferred← citeshttps://doi.org/10.1007/s00236-010-0119-2openalex-snapshot
Randomization adaptive self-stabilization
inferred← citeshttps://doi.org/10.1007/s00446-004-0111-6openalex-snapshot
Unifying stabilization and termination in message-passing systems
inferred← citeshttps://doi.org/10.1007/s004460100062openalex-snapshot
Universal dynamic synchronous self-stabilization
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2004.10.005openalex-snapshot
A fault-tolerant message passing algorithm and its hardware implementation
inferred← citeshttps://doi.org/10.1016/j.future.2009.05.002openalex-snapshot
The wandering token: Congestion avoidance of a shared resource
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.010openalex-snapshot
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.04.002openalex-snapshot
Snap-stabilization in message-passing systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.05.006openalex-snapshot
Disconnected components detection and rooted shortest-path tree maintenance in networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.07.007openalex-snapshot
Self-stabilizing token distribution on trees with constant space
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.013openalex-snapshot
Separation of circulating tokens
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.013openalex-snapshot
Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.031openalex-snapshot
Loosely-stabilizing maximal independent set algorithms with unreliable communications
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(96)00286-1openalex-snapshot
The local detection paradigm and its applications to self-stabilization
inferred← citeshttps://doi.org/10.1109/90.588093openalex-snapshot
Self-stabilizing sliding window ARQ protocols
inferred← citeshttps://doi.org/10.1109/icarcv.2008.4795490openalex-snapshot
Synchronization of dynamical systems with unreliable communication links
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302448openalex-snapshot
Distributed execution model for self-stabilizing systems
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918938openalex-snapshot
Unifying stabilization and termination in message-passing systems
inferred← citeshttps://doi.org/10.1109/iceee2.2018.8391375openalex-snapshot
Fault tolerance performance of self-stabilizing independent set algorithms on a covering-based problem: The case of link monitoring in WSNs
inferred← citeshttps://doi.org/10.1109/ipdps.2011.200openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size
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/ipdpsw.2013.7openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation Algorithm in an Undirected Ring of Arbitrary Size and Its Orientation
inferred← citeshttps://doi.org/10.1109/ispan.1997.645076openalex-snapshot
An implementable dynamic automatic self-stabilizing protocol
inferred← citeshttps://doi.org/10.1109/rtas48715.2020.00-13openalex-snapshot
Bounded-time recovery for distributed real-time systems
inferred← citeshttps://doi.org/10.1109/siu.2018.8404284openalex-snapshot
Evaluation of fault tolerant link monitoring algorithms for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/slfstb.1999.777488openalex-snapshot
Finite-state self-stabilizing protocols in message-passing systems
inferred← citeshttps://doi.org/10.1109/tpds.2003.1214322openalex-snapshot
Communication adaptive self-stabilizing group membership service
inferred← citeshttps://doi.org/10.1109/wi.2018.0-109openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation in Unoriented Cactus Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792235074openalex-snapshot
Resource Bounds for Self-Stabilizing Message-Driven Protocols
inferred← citeshttps://doi.org/10.1137/s009753979732760xopenalex-snapshot
Self-Stabilization by Counter Flushing
inferred← citeshttps://doi.org/10.1137/s0097539798285997openalex-snapshot
Self-Stabilizing Symmetry Breaking in Constant Space
inferred← citeshttps://doi.org/10.1142/s0129054112400357openalex-snapshot
SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE
inferred← citeshttps://doi.org/10.1142/s0129626417500025openalex-snapshot
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge
inferred← citeshttps://doi.org/10.1145/129712.129777openalex-snapshot
Self-stabilizing symmetry breaking in constant-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/1400751.1400838openalex-snapshot
Snap-stabilization in message-passing systems
inferred← citeshttps://doi.org/10.1145/197917.198102openalex-snapshot
Self-stabilization by counter flushing
inferred← citeshttps://doi.org/10.1145/248052.248104openalex-snapshot
Crash failures can drive protocols to arbitrary states
inferred← citeshttps://doi.org/10.1145/3288599.3288607openalex-snapshot
Silent self-stabilizing scheme for spanning-tree-like constructions
inferred← citeshttps://doi.org/10.1145/333979.333982openalex-snapshot
The fault span of crash failures
inferred← citeshttps://doi.org/10.1145/3350546.3352536openalex-snapshot
Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation
inferred← citeshttps://doi.org/10.11575/prism/30833openalex-snapshot
SELF-STABILIZING TOKEN CIRCULATION ON ANONYMOUS MESSAGE PASSING RINGS
inferred← citeshttps://doi.org/10.1201/9781584888215-c26openalex-snapshot
Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.1504/ijcnds.2009.021695openalex-snapshot
Fault tolerance in wireless sensor networks through self-stabilisation
inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot
Time- and space-efficient self-stabilizing algorithms
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_42openalex-snapshot
Self-Stabilizing Master-Slave Token Circulation Algorithm in Undirected Rings and Unicyclic Graphs of Arbitrary Size and Their Orientations
inferred← citeshttps://doi.org/10.1587/transinf.2023edp7075openalex-snapshot
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set
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.4230/lipics.disc.2020.11openalex-snapshot
Communication Efficient Self-Stabilizing Leader Election
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1123openalex-snapshot
Snap-Stabilization in Message-Passing Systems
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.48550/arxiv.2006.05901openalex-snapshot
Self-Stabilizing Automatic Repeat Request Algorithms for (Bounded Capacity, Omitting, Duplicating and non-FIFO) Computer Networks
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.