A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Chord / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pastry / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2175970924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Self-stabilizing Minimum Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing minimum degree spanning tree within one from the optimal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: HyperTree for self-stabilizing peer-to-peer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Self-stabilizing and Local Delaunay Graph Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Viceroy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-based cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel architectures for P2P applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization: Locally Self-Stabilizing Sorting in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed and Oblivious Heap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovery Through Gossip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource discovery in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic resource discovery in distributed networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:36, 10 July 2024

scientific article
Language Label Description Also known as
English
A deterministic worst-case message complexity optimal solution for resource discovery
scientific article

    Statements

    A deterministic worst-case message complexity optimal solution for resource discovery (English)
    0 references
    22 May 2015
    0 references
    distributed algorithms
    0 references
    resource discovery
    0 references
    self-stabilization
    0 references
    clique network
    0 references
    0 references
    0 references

    Identifiers