Communication complexity of fault-tolerant information diffusion
type: Item
instance of: scholarly article
title: Communication complexity of fault-tolerant information diffusion
zbMATH Open document ID: 0912.68028
DOI: 10.1016/S0304-3975(97)00109-6
author: Luisa Gargano
author: Adele A. Rescigno
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68P99
zbMATH DE Number: 1238693
zbMATH Keywords: communication time
zbMATH Keywords: communication complexity
zbMATH Keywords: fault-tolerant gossiping algorithms
MaRDI profile type: Publication
cites work: Q5689764
cites work: Information dissemination in distributed systems with faulty units
cites work: Parallel Information Dissemination by Packets
cites work: Sequential information dissemination by packets
cites work: Gossips and telephones
cites work: Telephone Problems with Failures
cites work: Broadcasting and Gossiping in de Bruijn Networks
cites work: Fast Gossiping by Short Messages
cites work: Q4001523
cites work: A Problem with Telephones
cites work: Q3619797
cites work: Q4132560
cites work: Efficient Gossiping by Packets in Networks with Random Faults
cites work: On the minimal synchronism needed for distributed consensus
cites work: Augmentation Problems
cites work: Methods and problems of communication in usual networks
cites work: Q4198056
cites work: Tighter time bounds on fault-tolerant broadcasting and gossiping
cites work: Reliable broadcasting
cites work: Communication complexity of gossiping by packets
cites work: Fault—tolerant hypercube broadcasting via information dispersal
cites work: Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
cites work: On Gossiping with Faulty Telephone Lines
cites work: A Cure for the Telephone Disease
cites work: The communication problem on graphs
cites work: Note on optimal gossiping in some weak-connected graphs
cites work: Q4870160
cites work: Further gossip problems
cites work: Reordered gossip schemes
cites work: Gossiping in Minimal Time
cites work: Kernels of minimum size gossip schemes
cites work: Fault-tolerant broadcast graphs
cites work: Q4276003
cites work: Fault-tolerant broadcasting and gossiping in communication networks
cites work: A note on optimal time broadcast in faulty hypercubes
cites work: Time bounds on fault‐tolerant broadcasting
cites work: On the communication complexity of polling
cites work: Data communication in parallel architectures
cites work: The Communication Complexity of Atomic Commitment and of Gossiping
description: scientific article; zbMATH DE number 1238693