The forgiving tree, a self-healing distributed data structure
From MaRDI portal
Publication:2934347
Recommendations
- The forgiving graph, a distributed data structure for low stretch under adversarial attack
- The forgiving graph: a distributed data structure for low stretch under adversarial attack
- Xheal, localized self-healing using expanders
- Xheal: a localized self-healing algorithm using expanders
- DEX: self-healing expanders
Cited in
(13)- Xheal: a localized self-healing algorithm using expanders
- scientific article; zbMATH DE number 1931813 (Why is no real title available?)
- scientific article; zbMATH DE number 2089347 (Why is no real title available?)
- Xheal, localized self-healing using expanders
- HyperTree for self-stabilizing peer-to-peer systems
- DEX: self-healing expanders
- Building resilient low-diameter peer-to-peer topologies
- A Distributed and Oblivious Heap
- A theoretical and empirical evaluation of an algorithm for self-healing computation
- Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
- Compact routing messages in self-healing trees
- The forgiving graph, a distributed data structure for low stretch under adversarial attack
- The forgiving graph: a distributed data structure for low stretch under adversarial attack
This page was built for publication: The forgiving tree, a self-healing distributed data structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934347)