Communication complexity of gossiping by packets

DOI10.1007/3-540-61422-2_135zbMath1502.68037OpenAlexW1554518241MaRDI QIDQ5054816

Adele A. Rescigno, Luisa Gargano, Ugo Vaccaro

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_135

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Methods and problems of communication in usual networks
• On Gossiping with Faulty Telephone Lines
• The Communication Complexity of Atomic Commitment and of Gossiping
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Sequential information dissemination by packets
• Parallel Information Dissemination by Packets
• Fast gossiping by short messages
• Efficient Gossiping by Packets in Networks with Random Faults

This page was built for publication: Communication complexity of gossiping by packets