A deterministic worst-case message complexity optimal solution for resource discovery
DOI10.1016/J.TCS.2014.11.027zbMATH Open1315.68019OpenAlexW2175970924MaRDI QIDQ2345458FDOQ2345458
Authors: Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
- Self-stabilizing systems in spite of distributed control
- Reaching Agreement in the Presence of Faults
- Group-based cryptography
- Novel architectures for P2P applications: the continuous-discrete approach
- Title not available (Why is that?)
- Viceroy, a scalable and dynamic emulation of the butterfly
- HyperTree for self-stabilizing peer-to-peer systems
- A self-stabilizing and local Delaunay graph construction
- Title not available (Why is that?)
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Linearization: locally self-stabilizing sorting in graphs
- The hyperring: a low-congestion deterministic data structure for distributed environments
- A Distributed and Oblivious Heap
- Self-stabilizing minimum degree spanning tree within one from the optimal degree
- Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
- Resource discovery in distributed networks
- Discovery through gossip
- Deterministic resource discovery in distributed networks
Cited In (1)
Uses Software
This page was built for publication: A deterministic worst-case message complexity optimal solution for resource discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345458)
