On the public citation graph
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
0 signed · 27 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/bf01843566openalex-snapshot
A belated proof of self-stabilization
inferredcites →https://doi.org/10.1007/bf02278852openalex-snapshot
Self-stabilizing extensions for meassage-passing systems
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(94)90103-1openalex-snapshot
Self-stabilizing depth-first search
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1080/10637199408915459openalex-snapshot
A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
inferredcites →https://doi.org/10.1109/32.295897openalex-snapshot
Two-state self-stabilizing algorithms for token rings
inferredcites →https://doi.org/10.1142/s0129626491000161openalex-snapshot
MAINTAINING DIGITAL CLOCKS IN STEP
inferredcites →https://doi.org/10.1145/164051.164074openalex-snapshot
Unifying self-stabilization and fault-tolerance
inferredcites →https://doi.org/10.1145/169683.174161openalex-snapshot
Leader election in uniform rings
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/858336.858339openalex-snapshot
Solved problems, unsolved problems and non-problems in concurrency
inferredcites →https://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
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-03089-0_9openalex-snapshot
Leader Election and Centers and Medians in Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_8openalex-snapshot
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
inferred← citeshttps://doi.org/10.1007/s00453-010-9447-4openalex-snapshot
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.11.002openalex-snapshot
Median problem in some plane triangulations and quadrangulations
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)90143-xopenalex-snapshot
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
inferred← citeshttps://doi.org/10.1109/icdcs.2003.1203448openalex-snapshot
Efficient self-stabilizing algorithms for tree networks
inferred← citeshttps://doi.org/10.1142/s0129054111008623openalex-snapshot
SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS
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/1462187.1462194openalex-snapshot
Self-stabilizing philosophers with generic conflicts
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.