On the communication complexity of polling
type: Item
instance of: scholarly article
title: On the communication complexity of polling
zbMATH Open document ID: 0875.68045
DOI: 10.1016/0020-0190(96)00127-5
author: Adele A. Rescigno
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 984198
zbMATH Keywords: Interconnection networks
zbMATH Keywords: Distributed computing
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00127-5
OpenAlex ID: W1969957915
cites work: Parallel Information Dissemination by Packets
cites work: Sequential information dissemination by packets
cites work: Fast Gossiping by Short Messages
cites work: Architectures and monitoring techniques for active databases: An evaluation
cites work: Q3337487
cites work: Methods and problems of communication in usual networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q4870160
cites work: Q4319638
cites work: The Communication Complexity of Atomic Commitment and of Gossiping
description: scientific article; zbMATH DE number 984198