Regular ArticleReliable Broadcasting in Logarithmic Time with Byzantine Link Failures
References (19)
Broadcasting with random faults
Discrete Appl. Math.
(1988)- et al.
A guided tour of Chernoff bounds
Inform. Process. Lett.
(1990) - et al.
Optimal and near-optimal broadcast in random graphs
Discrete Appl. Math.
(1989) - et al.
Fault-tolerant sorting networks
SIAM J. Discrete Math.
(1991) - et al.
Telephone problems with failures
SIAM J. Algebra Discrete Methods
(1986) - P. Berman, A. Pelc, 1992, Efficient Broadcasting and Gossiping with Byzantine Link Failures, Université du Québec à...
- et al.
Optimal communication in networks with randomly distributed Byzantine faults
Networks
(1993) - B. S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proceedings ICALP-93,...
- et al.
Optimal broadcasting in faulty hypercubes
Digest of Papers, FTCS-21
(1991)
There are more references available in the full text version of this article.
Cited by (23)
Rapid almost-complete broadcasting in faulty networks
2009, Theoretical Computer ScienceOn fractional dynamic faults with thresholds
2008, Theoretical Computer ScienceFeasibility and complexity of broadcasting with random transmission failures
2007, Theoretical Computer ScienceBroadcasting with locally bounded Byzantine faults
2005, Information Processing LettersPacket Routing in Fixed-Connection Networks: A Survey
1998, Journal of Parallel and Distributed ComputingFast broadcasting with byzantine faults
2006, International Journal of Foundations of Computer Science
- *
Partly supported by NSERC International Fellowship and Grant KBN 2-2043-92-03.
- †
Partly supported by NSERC Grant OGP 0008136.
Copyright © 1997 Academic Press. All rights reserved.