On the public citation graph

Self-stabilizing depth-first token circulation on networks

0 signed · 76 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-53487-3_54openalex-snapshot

Distributed reset

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

A belated proof of self-stabilization

inferredcites →https://doi.org/10.1016/0020-0190(73)90024-0openalex-snapshot

A note on implementing parallel assignment instructions

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/0020-0190(87)90228-6openalex-snapshot

A time-optimal message-efficient distributed algorithm for depth-first-search

inferredcites →https://doi.org/10.1016/0020-0190(88)90131-7openalex-snapshot

An exercise in proving self-stabilization with a variant function

inferredcites →https://doi.org/10.1016/0020-0190(91)90111-topenalex-snapshot

A self-stabilizing algorithm for constructing spanning trees

inferredcites →https://doi.org/10.1016/0020-0190(92)90264-vopenalex-snapshot

A self-stabilizing algorithm for constructing breadth-first trees

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

Token systems that self-stabilize

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

Stabilizing communication protocols

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

Self Stabilization of Dynamic Systems

inferredcites →https://doi.org/10.1137/0201010openalex-snapshot

Depth-First Search and Linear Graph Algorithms

inferredcites →https://doi.org/10.1137/0203006openalex-snapshot

Finding Dominators in Directed Graphs

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

Self-stabilizing systems in spite of distributed control

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

Uniform self-stabilizing rings

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

1983 Invited address solved problems, unsolved problems and non-problems in concurrency

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11516798_20openalex-snapshot

Snap-Stabilizing Depth-First Search on Arbitrary Networks

inferred← citeshttps://doi.org/10.1007/11577327_3openalex-snapshot

A Snap-Stabilizing DFS with a Lower Space Requirement

inferred← citeshttps://doi.org/10.1007/11602569_50openalex-snapshot

Snap-Stabilizing Detection of Cutsets

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-45438-1_14openalex-snapshot

Fast Self-Stabilizing Depth-First Token Circulation

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-031-60603-8_6openalex-snapshot

Optimal Memory Requirement for Self-stabilizing Token Circulation

inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_23openalex-snapshot

Self-stabilizing Graph Exploration by a Single Agent

inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_22openalex-snapshot

Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree

inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_6openalex-snapshot

Concurrency in Snap-Stabilizing Local Resource Allocation

inferred← citeshttps://doi.org/10.1007/978-3-319-39570-8_3openalex-snapshot

A Framework for Certified Self-Stabilization

inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_14openalex-snapshot

From Self- to Snap- Stabilization

inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_36openalex-snapshot

Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework

inferred← citeshttps://doi.org/10.1007/978-3-540-85257-5_22openalex-snapshot

Timer-Based Composition of Fault-Containing Self-stabilizing Protocols

inferred← citeshttps://doi.org/10.1007/bf02684333openalex-snapshot

A self-stabilizing algorithm for strong fairness

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/bfb0030689openalex-snapshot

Self-stabilizing depth-first token passing on rooted networks

inferred← citeshttps://doi.org/10.1007/bfb0057900openalex-snapshot

Mutual exclusion between neighboring nodes in a tree that stabilizes using read/write atomicity

inferred← citeshttps://doi.org/10.1007/s00446-007-0030-4openalex-snapshot

Snap-stabilization and PIF in tree networks

inferred← citeshttps://doi.org/10.1007/s004460050035openalex-snapshot

Self-stabilizing token circulation in uniform networks

inferred← citeshttps://doi.org/10.1007/s00607-009-0025-zopenalex-snapshot

Stabilizing maximum matching in bipartite networks

inferred← citeshttps://doi.org/10.1016/j.comcom.2008.12.035openalex-snapshot

An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks

inferred← citeshttps://doi.org/10.1016/j.ins.2005.11.013openalex-snapshot

Request-based token passing for self-stabilizing mutual exclusion

inferred← citeshttps://doi.org/10.1016/j.ins.2009.10.003openalex-snapshot

Timer-based composition of fault-containing self-stabilizing protocols

inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.001openalex-snapshot

An optimal self-stabilizing strarvation-free alternator

inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.08.008openalex-snapshot

Optimal snap-stabilizing depth-first token circulation in tree networks

inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.09.004openalex-snapshot

Snap-stabilizing committee coordination

inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.11.004openalex-snapshot

Concurrency in snap-stabilizing local resource allocation

inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.02.007openalex-snapshot

A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon

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/s0129-6264(00)00003-2openalex-snapshot

Optimality and Self-Stabilization in Rooted Tree Networks

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

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

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

SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM

inferred← citeshttps://doi.org/10.1093/comjnl/bxh154openalex-snapshot

Snap-Stabilizing Depth-First Search on Arbitrary Networks

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

Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees

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

Self-Stabilizing Distributed Cooperative Reset

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

Avoiding faulty privileges in self-stabilizing depth-first token passing

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

Snap-Stabilizing Committee Coordination

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

A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon

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

Color optimal self-stabilizing depth-first token circulation

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/reldis.2002.1180176openalex-snapshot

Service time optimal self-stabilizing token circulation protocol on anonymous undirectional rings

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

A Distributed Drone Weather System Using LoRaWAN and LoRa Meshnet

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/srds.2009.13openalex-snapshot

A Self-Stabilizing O(n)-Round k-Clustering Algorithm

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.1134/s1064230721020131openalex-snapshot

Game Theoretic Analysis of Self-Stabilizing Systems on Arrays

inferred← citeshttps://doi.org/10.1142/s0129626400000032openalex-snapshot

OPTIMALITY AND SELF-STABILIZATION IN ROOTED TREE NETWORKS

inferred← citeshttps://doi.org/10.1142/s0129626499000293openalex-snapshot

OPTIMALITY AND SELF-STABILIZATION IN ROOTED TREE NETWORKS

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

Light enabling snap-stabilization of fundamental protocols

inferred← citeshttps://doi.org/10.1587/transinf.e92.d.451openalex-snapshot

Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property

inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot

Introduction to Distributed Self-Stabilizing Algorithms

inferred← citeshttps://doi.org/10.23638/lmcs-13(4:14)2017openalex-snapshot

A Framework for Certified Self-Stabilization

inferred← citeshttps://doi.org/10.3166/tsi.23.1027-1056openalex-snapshot

Autostabilisation et protocoles réseau

inferred← citeshttps://doi.org/10.4018/jalr.2010070105openalex-snapshot

The Worst-Case Stabilization Time of a Self-Stabilizing Algorithm under the Weakly Fair Daemon Model

inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.11openalex-snapshot

Communication Efficient Self-Stabilizing Leader Election

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

Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes

inferred← citeshttps://doi.org/10.5860/choice.33-0987openalex-snapshot

Introduction to distributed algorithms

inferred← citeshttps://doi.org/10.7936/k7ht2mjjopenalex-snapshot

Studying Network Optimization in the Context of Self-Stabilization

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.