On the public citation graph
A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks
0 signed · 35 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/11516798_21openalex-snapshot
A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks
inferredcites →https://doi.org/10.1007/3-540-44681-8_67openalex-snapshot
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
inferredcites →https://doi.org/10.1007/3-540-57271-6_35openalex-snapshot
Tolerating transient and permanent failures (extended abstract)
inferredcites →https://doi.org/10.1007/978-3-540-27820-7_6openalex-snapshot
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/bf02278856openalex-snapshot
A self-stabilizing algorithm for coloring planar graphs
inferredcites →https://doi.org/10.1016/0020-0255(93)90121-2openalex-snapshot
A self-stabilizing algorithm for coloring bipartite graphs
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.005openalex-snapshot
Self-stabilizing coloration in anonymous planar networks
inferredcites →https://doi.org/10.1016/s0020-0190(03)00299-0openalex-snapshot
Linear time self-stabilizing colorings
inferredcites →https://doi.org/10.1080/00207729708929476openalex-snapshot
Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors
inferredcites →https://doi.org/10.1109/infcom.2005.1498534openalex-snapshot
Link scheduling in sensor networks: distributed edge coloring revisited
inferredcites →https://doi.org/10.1109/mtdt.2000.868626openalex-snapshot
Proceedings 2000. International Workshop on Parallel Processing
inferredcites →https://doi.org/10.1109/reldis.2002.1180170openalex-snapshot
Tolerance to unbounded Byzantine faults
inferredcites →https://doi.org/10.1145/164051.164074openalex-snapshot
Unifying self-stabilization and fault-tolerance
inferredcites →https://doi.org/10.1145/259380.259515openalex-snapshot
On FTSS-solvable distributed problems
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470610893.ch10openalex-snapshot
Fault‐Tolerant Distributed Algorithms for Scalable Systems
inferred← citeshttps://doi.org/10.1007/11780823_17openalex-snapshot
Discovering Network Topology in the Presence of Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_26openalex-snapshot
Distributed Edge Coloration for Bipartite Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_31openalex-snapshot
Bounding the Impact of Unbounded Attacks in Stabilization
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_32openalex-snapshot
On Bootstrapping Topology Knowledge in Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_12openalex-snapshot
Adaptive Containment of Time-Bounded Byzantine Faults
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.11.006openalex-snapshot
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
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.1109/icdcs.2012.15openalex-snapshot
Limiting Byzantine Influence in Multihop Asynchronous Networks
inferred← citeshttps://doi.org/10.1109/icnc.2011.68openalex-snapshot
Self-Stabilization in Unstable Network Environments
inferred← citeshttps://doi.org/10.1109/icnc.2011.72openalex-snapshot
Design and Communication Complexity of Self-Stabilizing Protocols Resilient to Byzantine Faults
inferred← citeshttps://doi.org/10.1109/pdcat.2009.53openalex-snapshot
Reliable Communication on Emulated Channels Resilient to Transient Faults
inferred← citeshttps://doi.org/10.1109/pdcat.2009.71openalex-snapshot
A Self-Stabilizing (Δ+ 1)- Edge-Coloring Algorithm of Arbitrary Graphs
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/tpds.2009.25openalex-snapshot
Discovering Network Topology in the Presence of Byzantine Faults
inferred← citeshttps://doi.org/10.1145/1462187.1462195openalex-snapshot
On bootstrapping topology knowledge in anonymous networks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.5824openalex-snapshot
Limiting Byzantien Influence in Multihop Asynchronous Networks
inferred← citeshttps://doi.org/10.7155/jgaa.00384openalex-snapshot
An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous 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.