Adaptive broadcasting with faulty nodes

DOI10.1016/0167-8191(96)00023-3zbMath0875.68055OpenAlexW2056496732MaRDI QIDQ671453

Leszek Gąsieniec, Andrzej Pelc

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(96)00023-3

zbMATH Keywords

AlgorithmsBroadcastingAdaptiveFault-tolerance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (7)

Simple and optimal randomized fault-tolerant rumor spreading ⋮ On the runtime and robustness of randomized broadcasting ⋮ On mixing and edge expansion properties in randomized broadcasting ⋮ Minimum time broadcast in faulty star networks ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ On Mixing and Edge Expansion Properties in Randomized Broadcasting ⋮ Deterministic Models of Communication Faults

This page was built for publication: Adaptive broadcasting with faulty nodes