DEX: self-healing expanders

DOI10.1007/s00446-015-0258-3zbMath1362.68286arXiv1206.1522OpenAlexW2261964368WikidataQ59475328 ScholiaQ59475328MaRDI QIDQ2629213

Peter Robinson, Amitabh Trehan, Gopal Pandurangan

Publication date: 5 July 2016

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.1522

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Explicit expanding expanders ⋮ Distributed agreement in dynamic peer-to-peer networks

Uses Software

• Xheal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanders: distributed spanning expanders
• Araneola: a scalable reliable multicast system for dynamic environments
• Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
• Universal continuous routing strategies
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
• The expansion and mixing time of skip graphs with applications
• The forgiving tree
• Xheal
• Expander graphs and their applications
• Novel architectures for P2P applications
• A Chernoff Bound for Random Walks on Expander Graphs
• Distributed Computing: A Locality-Sensitive Approach
• The flip markov chain and a randomising P2P protocol
• Fast distributed random walks
• Correctness of Gossip-Based Membership under Message Loss
• Probability and Computing
• SKIP ⁺

This page was built for publication: DEX: self-healing expanders