Efficient broadcasting with linearly bounded faults
type: Item
instance of: scholarly article
title: Efficient broadcasting with linearly bounded faults
zbMATH Open document ID: 0921.68007
DOI: 10.1016/S0166-218X(98)00118-8
author: Krzysztof Ciebiera
author: Adam Malinowski
published in: Discrete Applied Mathematics
publication date: 1999-09-29T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1267544
zbMATH Keywords: broadcasting algorithm
MaRDI profile type: Publication
cites work: Broadcasting in synchronous networks with dynamic faults
cites work: Broadcasting with linearly bounded transmission faults
cites work: Fault-tolerant broadcasting and gossiping in communication networks
cites work: Searching with known error probability
Recommended article: Broadcasting with linearly bounded transmission faults
Recommended article: Q4895545
Recommended article: FAST BROADCASTING WITH BYZANTINE FAULTS
Recommended article: On optimal broadcasting in faulty hypercubes
Recommended article: Communication-efficient broadcasting in complete networks with dynamic faults
Recommended article: Tighter time bounds on fault-tolerant broadcasting and gossiping
Recommended article: Broadcasting in hypercubes with randomly distributed Byzantine faults
Recommended article: A note on broadcasting with linearly bounded transmission faults in constant degree networks
Recommended article: Optimal broadcasting in hypercubes with dynamic faults
description: scientific article; zbMATH DE number 1267544