Fast gossiping with short unreliable messages
- 14 September 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 53 (1-3) , 15-24
- https://doi.org/10.1016/0166-218x(94)90176-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Sorting on a Mesh-Connected Computer with Delaying LinksSIAM Journal on Discrete Mathematics, 1994
- Almost Safe Gossiping in Bounded Degree NetworksSIAM Journal on Discrete Mathematics, 1992
- Tighter time bounds on fault‐tolerant broadcasting and gossipingNetworks, 1992
- Reliable communication in networks with Byzantine link failuresNetworks, 1992
- Fast Gossiping for the HypercubeSIAM Journal on Computing, 1992
- Gossiping in Minimal TimeSIAM Journal on Computing, 1992
- Optimal and near-optimal broadcast in random graphsDiscrete Applied Mathematics, 1989
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- Broadcasting with random faultsDiscrete Applied Mathematics, 1988
- On Gossiping with Faulty Telephone LinesSIAM Journal on Algebraic Discrete Methods, 1987