An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks (Q1402221): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 17:00, 31 January 2024

scientific article
Language Label Description Also known as
English
An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
scientific article

    Statements

    An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks (English)
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    Gossiping
    0 references
    Radio network
    0 references
    Deterministic algorithm
    0 references

    Identifiers