On the communication complexity of polling

DOI10.1016/0020-0190(96)00127-5zbMath0875.68045OpenAlexW1969957915MaRDI QIDQ1350916

Adele A. Rescigno

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00127-5

zbMATH Keywords

Distributed computingInterconnection networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Communication complexity of fault-tolerant information diffusion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods and problems of communication in usual networks
• Architectures and monitoring techniques for active databases: An evaluation
• The Communication Complexity of Atomic Commitment and of Gossiping
• A survey of gossiping and broadcasting in communication networks
• Sequential information dissemination by packets
• Fast Gossiping by Short Messages
• Parallel Information Dissemination by Packets

This page was built for publication: On the communication complexity of polling