A deterministic worst-case message complexity optimal solution for resource discovery
From MaRDI portal
Publication:2345458
DOI10.1016/j.tcs.2014.11.027zbMath1315.68019OpenAlexW2175970924MaRDI QIDQ2345458
Christian Scheideler, Andreas Koutsopoulos, Sebastian Kniesburges
Publication date: 22 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.027
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Group-based cryptography
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
- Deterministic resource discovery in distributed networks
- HyperTree for self-stabilizing peer-to-peer systems
- Discovery Through Gossip
- Resource discovery in distributed networks
- Novel architectures for P2P applications
- Fast Self-stabilizing Minimum Spanning Tree Construction
- A Self-stabilizing and Local Delaunay Graph Construction
- Reaching Agreement in the Presence of Faults
- Self-stabilizing systems in spite of distributed control
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Viceroy
- Linearization: Locally Self-Stabilizing Sorting in Graphs
- A Distributed and Oblivious Heap