On the public citation graph

A Snap-Stabilizing DFS with a Lower Space Requirement

https://doi.org/10.1007/11577327_3
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.1007/11516798_20openalex-snapshot
Snap-Stabilizing Depth-First Search on Arbitrary Networks
inferredcites →https://doi.org/10.1007/11577327_3openalex-snapshot
A Snap-Stabilizing DFS with a Lower Space Requirement
inferredcites →https://doi.org/10.1007/3-540-45032-7_15openalex-snapshot
An Improved Snap-Stabilizing PIF Algorithm
inferredcites →https://doi.org/10.1007/bf02278857openalex-snapshot
Self-stabilizing depth-first token circulation on networks
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0030689openalex-snapshot
Self-stabilizing depth-first token passing on rooted networks
inferredcites →https://doi.org/10.1007/pl00008919openalex-snapshot
Self-stabilizing depth-first token circulation in arbitrary rooted networks
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1109/71.588622openalex-snapshot
Uniform dynamic self-stabilizing leader election
inferredcites →https://doi.org/10.1109/icdcs.2003.1203447openalex-snapshot
Enabling snap-stabilization
inferredcites →https://doi.org/10.1109/icdcs11988.2007openalex-snapshot
27th International Conference on Distributed Computing Systems (ICDCS '07)
inferredcites →https://doi.org/10.1109/slfstb.1999.777490openalex-snapshot
State-optimal snap-stabilizing PIF in tree networks
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1201/b17224-21openalex-snapshot
◾ Self-Stabilizing Systems

What points at this work

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

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-642-11476-2_12openalex-snapshot
A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_12openalex-snapshot
The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction
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.2019.01.005openalex-snapshot
The first fully polynomial stabilizing algorithm for BFS tree construction
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.2015.09.004openalex-snapshot
Snap-stabilizing committee coordination
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.036openalex-snapshot
The expressive power of snap-stabilization
inferred← citeshttps://doi.org/10.1109/ipdps.2011.31openalex-snapshot
Snap-Stabilizing Committee Coordination
inferred← citeshttps://doi.org/10.1145/1400751.1400838openalex-snapshot
Snap-stabilization in message-passing systems
inferred← citeshttps://doi.org/10.1145/1462187.1462193openalex-snapshot
Light enabling snap-stabilization of fundamental protocols
inferred← citeshttps://doi.org/10.1145/3288599.3288607openalex-snapshot
Silent self-stabilizing scheme for spanning-tree-like constructions
inferred← citeshttps://doi.org/10.1145/3571306.3571397openalex-snapshot
Self-stabilizing Synchronous Unison in Directed Networks
inferred← citeshttps://doi.org/10.1145/3662158.3662778openalex-snapshot
On Self-stabilizing Leader Election in Directed Networks
inferred← citeshttps://doi.org/10.1371/journal.pone.0259736openalex-snapshot
Memory and communication efficient algorithm for decentralized counting of nodes in networks
inferred← citeshttps://doi.org/10.23638/dmtcs-19-3-14openalex-snapshot
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1123openalex-snapshot
Snap-Stabilization in Message-Passing Systems
inferred← citeshttps://doi.org/10.7936/k7ht2mjjopenalex-snapshot
Studying Network Optimization in the Context of Self-Stabilization
showing the first 18 of 19 · page through all 19
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.