Fast gossiping with short unreliable messages
type: Item
instance of: scholarly article
title: Fast gossiping with short unreliable messages
zbMATH Open document ID: 0807.94029
DOI: 10.1016/0166-218X(94)90176-7
author: Bogdan S. Chlebus
author: Krzysztof Diks
author: Andrzej Pelc
published in: Discrete Applied Mathematics
publication date: 1994-12-11T00:00:00Z
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 701695
zbMATH Keywords: gossiping
zbMATH Keywords: communication network graph
MaRDI profile type: Publication
cites work: Broadcasting with random faults
cites work: Q4197800
cites work: Sorting on a Mesh-Connected Computer with Delaying Links
cites work: Almost Safe Gossiping in Bounded Degree Networks
cites work: Tighter time bounds on fault-tolerant broadcasting and gossiping
cites work: Q3806522
cites work: On Gossiping with Faulty Telephone Lines
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Fast Gossiping for the Hypercube
cites work: Gossiping in Minimal Time
cites work: Q3744177
cites work: Reliable communication in networks with Byzantine link failures
cites work: Optimal and near-optimal broadcast in random graphs
Wikidata QID: Q127705921
description: scientific article; zbMATH DE number 701695