On the public citation graph

Self-stabilizing depth-first token circulation in arbitrary rooted networks

https://doi.org/10.1007/pl00008919
0 signed · 51 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/11516798_19openalex-snapshot
A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks
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/11604655_11openalex-snapshot
Self-stabilizing Deterministic TDMA for Sensor Networks
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-1-84800-909-7_4openalex-snapshot
Stabilizing Interference-Free Slot Assignment for Wireless Mesh Networks
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-540-49823-0_14openalex-snapshot
From Self- to Snap- Stabilization
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/s00446-007-0030-4openalex-snapshot
Snap-stabilization and PIF in tree networks
inferred← citeshttps://doi.org/10.1007/s00453-014-9913-5openalex-snapshot
Maximum Metric Spanning Tree Made Byzantine Tolerant
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.dam.2017.07.006openalex-snapshot
Maintaining balanced trees for structured distributed streaming systems
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.jcss.2005.05.001openalex-snapshot
An optimal self-stabilizing strarvation-free alternator
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.03.009openalex-snapshot
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
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.tcs.2015.01.023openalex-snapshot
Safe and stabilizing distributed multi-path cellular flows
inferred← citeshttps://doi.org/10.1093/comjnl/bxh154openalex-snapshot
Snap-Stabilizing Depth-First Search on Arbitrary Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840972openalex-snapshot
Self-stabilizing network orientation algorithms in arbitrary rooted networks
inferred← citeshttps://doi.org/10.1109/icon.2005.1635479openalex-snapshot
A Clustering Mutual Exclusion Protocol For Multi-Hop Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2011.31openalex-snapshot
Snap-Stabilizing Committee Coordination
inferred← citeshttps://doi.org/10.1109/prdc.2014.21openalex-snapshot
Exploiting Synchronicity for Immediate Feedback in Self-Stabilizing PIF Algorithms
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/slfstb.1999.777490openalex-snapshot
State-optimal snap-stabilizing PIF in tree networks
inferred← citeshttps://doi.org/10.1109/tmc.2005.25openalex-snapshot
Distributed token circulation in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/tpds.2012.165openalex-snapshot
The Bodyguard Allocation Problem
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.1145/570810.570815openalex-snapshot
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1504/ijahuc.2006.009885openalex-snapshot
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.2514/1.19952openalex-snapshot
Self-Stabilizing Deterministic Time Division Multiple Access for Sensor Networks
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.4086/cjtcs.1999.010openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.11openalex-snapshot
Communication Efficient Self-Stabilizing Leader Election
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2021.24openalex-snapshot
A Taxonomy of Daemons in Self-stabilization
inferred← citeshttps://doi.org/10.46298/dmtcs.9335openalex-snapshot
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
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.7936/k7ht2mjjopenalex-snapshot
Studying Network Optimization in the Context of Self-Stabilization
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.