Fault-Local Distributed Mending
From MaRDI portal
Recommendations
Cited in
(22)- Stabilizing time-adaptive protocols
- Local majorities, coalitions and monopolies in graphs: A review
- A computational study of \(f\)-reversible processes on graphs
- Fault-containing self-stabilization in asynchronous systems with constant fault-gap
- Fault-containing self-stabilizing distributed protocols
- Local mending
- Irreversible conversion processes with deadlines
- Network decontamination with a single agent
- scientific article; zbMATH DE number 4058841 (Why is no real title available?)
- scientific article; zbMATH DE number 1950697 (Why is no real title available?)
- scientific article; zbMATH DE number 2016060 (Why is no real title available?)
- Tight Fault Locality
- A fault recovery method for optical means of data exchange
- A Distributed Algorithm of Fault Recovery for Stateful Failover
- Implementation and Application of Automata
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- Irreversible conversion of graphs
- Distributed error confinement
- Distributed error confinement
- Fast deterministic algorithms for highly-dynamic networks
- Reversible iterative graph processes
- The conversion set problem on graphs
This page was built for publication: Fault-Local Distributed Mending
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228289)