Communication complexity of gossiping by packets (Q5054816): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel Information Dissemination by Packets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential information dissemination by packets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast gossiping by short messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Gossiping by Packets in Networks with Random Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and problems of communication in usual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter time bounds on fault-tolerant broadcasting and gossiping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gossiping with Faulty Telephone Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in Minimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Atomic Commitment and of Gossiping / rank
 
Normal rank

Latest revision as of 02:08, 31 July 2024

scientific article; zbMATH DE number 7631760
Language Label Description Also known as
English
Communication complexity of gossiping by packets
scientific article; zbMATH DE number 7631760

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references