Spanders: distributed spanning expanders
From MaRDI portal
Publication:395654
DOI10.1016/j.scico.2012.10.001zbMath1279.68026OpenAlexW2021142034MaRDI QIDQ395654
Publication date: 29 January 2014
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2012.10.001
Distributed systems (68M14) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (9)
DEX: self-healing expanders ⋮ TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks ⋮ Spanders: distributed spanning expanders ⋮ Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks ⋮ Xheal: a localized self-healing algorithm using expanders ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks ⋮ Physical Expander in Virtual Tree Overlay
Cites Work
- Unnamed Item
- Unnamed Item
- Spanders: distributed spanning expanders
- Testing the expansion of a graph
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
- Expander graphs and their applications
- Graph spanners
- Self-stabilizing systems in spite of distributed control
- Time, clocks, and the ordering of events in a distributed system
- Distributed Computing: A Locality-Sensitive Approach
- Many Random Walks Are Faster Than One
- Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
- Property testing in bounded degree graphs
This page was built for publication: Spanders: distributed spanning expanders