The forgiving tree

From MaRDI portal

Revision as of 20:15, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2934347

Jump to:navigation, search

DOI10.1145/1400751.1400779zbMath1301.68108OpenAlexW2136928097MaRDI QIDQ2934347

Jared Saia, Tom Hayes, Navin Rustagi, 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

zbMATH Keywords

networks distributed peer-to-peer self-healing reconfigurable data structure responsive

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed systems (68M14)

Related Items (5)

DEX: self-healing expanders ⋮ A theoretical and empirical evaluation of an algorithm for self-healing computation ⋮ Compact routing messages in self-healing trees ⋮ The forgiving graph: a distributed data structure for low stretch under adversarial attack ⋮ Xheal: a localized self-healing algorithm using expanders

This page was built for publication: The forgiving tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2934347&oldid=15920899"