Broadcasting in complete networks with faulty nodes using unreliable calls

Angluin, 1979, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci., 18, 155, 10.1016/0022-0000(79)90045-X Berman, 1986, Telephone problems with failures, SIAM J. Algebraic Discrete Methods, 7, 13, 10.1137/0607002 Bienstock, 1988, Broadcasting with random faults, Discrete Appl. Math., 20, 1, 10.1016/0166-218X(88)90037-6 Chlebus, 1990, Optimal broadcasting in faulty hypercubes Diks, 1990, Reliable gossip schemes with random link failures, Proc. 28th Ann. Allerton Conf. on Comm. Control and Comp., 978 K. Diks and A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. Discrete Math., to appear. Gargano, 1988, Tighter time bounds on fault tolerant broadcasting and gossiping, Manuscript Haddad, 1987, On gossiping with faulty telephone lines, SIAM J. Algebraic Discrete Methods, 8, 439, 10.1137/0608036 Hagerup, 1989, A guided tour of Chernoff bounds, Inform. Process. Lett., 33, 305, 10.1016/0020-0190(90)90214-I Hedetniemi, 1988, A survey of gossiping and broadcasting in communication networks, Networks, 18, 319, 10.1002/net.3230180406 Scheinerman, 1989, Optimal and nearoptimal broadcast in random graphs, Discrete Appl. Math., 25, 289, 10.1016/0166-218X(89)90007-3