Broadcasting with locally bounded byzantine faults
type: Item
instance of: scholarly article
title: Broadcasting with locally bounded byzantine faults
zbMATH Open document ID: 1173.68390
author: Andrzej Pelc
author: David Peleg
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 5599193
zbMATH Keywords: algorithms
zbMATH Keywords: distributed computing
zbMATH Keywords: fault tolerance
zbMATH Keywords: broadcast
zbMATH Keywords: byzantine faults
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.10.007
OpenAlex ID: W2094285453
cites work: Information dissemination in distributed systems with faulty units
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
cites work: Optimal communication in networks with randomly distributed byzantine faults
cites work: The Byzantine generals strike again
cites work: Broadcast in radio networks tolerating byzantine adversarial behavior
cites work: Fault-tolerant broadcasting in radio networks
cites work: Fault-tolerant broadcasting and gossiping in communication networks
DOI: 10.1016/J.IPL.2004.10.007
description: scientific article; zbMATH DE number 5599193