The forgiving tree, a self-healing distributed data structure
DOI10.1145/1400751.1400779zbMATH Open1301.68108OpenAlexW2136928097MaRDI QIDQ2934347FDOQ2934347
Authors: Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan 
Publication date: 12 December 2014
Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1400751.1400779
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cited In (13)
- Xheal: a localized self-healing algorithm using expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
- A theoretical and empirical evaluation of an algorithm for self-healing computation
- The forgiving graph, a distributed data structure for low stretch under adversarial attack
- Compact routing messages in self-healing trees
- 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)
