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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Spreading Rumors Rapidly Despite an Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conductors and constant-degree lossless expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust gossiping with an application to consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Communication Efficient Consensus for Crash Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective asynchronous reading with polylogarithmic worst-case overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal adaptive broadcasting with a bounded fraction of faulty nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of asynchronous gossip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient gossip and robust distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial gossip and resource location protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Communication Surplus Incurred by Faulty Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant broadcasting and gossiping in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of an optimal non-blocking commutation scheme without reorganization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Selecting in Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loss-less condensers, unbalanced expanders, and extractors / rank
 
Normal rank

Latest revision as of 21:57, 4 July 2024

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