Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066)

From MaRDI portal
Revision as of 00:21, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
scientific article

    Statements

    Meeting the deadline: on the complexity of fault-tolerant continuous gossip (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    gossip
    0 references
    crashes and restarts
    0 references
    dynamic rumor injection
    0 references
    random and expander graphs
    0 references
    0 references