EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 29 / No 5 (1995) RAIRO-Theor. Inf. Appl., 29 5 (1995) 383-400 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 29, Number 5, 1995
Page(s) 383 - 400
DOI https://doi.org/10.1051/ita/1995290503831
Published online 01 February 2017
  1. 1. K. A. BERMAN and M. HAWRYLYCZ, Telephone problems with failures, SIAM J. Alg. Disc. Meth., 1986, 7, pp. 13-17. [MR: 819701] [Zbl: 0578.05059] [Google Scholar]
  2. 2. D. BIENSTOCK, Broadcasting with random faults, Disc. Appl. Math., 1988, 20, pp. 1-7. [MR: 936893] [Zbl: 0658.05068] [Google Scholar]
  3. 3. S. BITAN and S. ZAKS, Optimal linear broadcast, J. of Algorithms, 1993, 14, pp. 288-315. [MR: 1201930] [Zbl: 0774.68014] [Google Scholar]
  4. 4. B. S. CHLEBUS, K. DIKS and A. PELC, Sparse networks supporting efficient reliable broadcasting, Proc. of the 20th International Colloquium on Automata, Languages and Programming, ICALP-93, LNCS 700, pp. 388-397. [Zbl: 0817.68019] [Google Scholar]
  5. 5. B. S. CHLEBUS, K. DIKS and A. PELC, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS-21, 1991, pp. 266-273. [Google Scholar]
  6. 6. B. S. CHLEBUS, K. DIKS and A. PELC, Fast gossiping with short unreliable messages, Disc. Appl. Math., to appear. [MR: 1290999] [Zbl: 0807.94029] [Google Scholar]
  7. 7. B. S. CHLEBUS, K. DIKS and A. PELC, Waking up an anonymous faulty network from a single source, Proc. of the 27th Annual Hawaii International Conference on System Sciences, 1994, Vol. 2, pp. 187-193. [MR: 1259015] [Google Scholar]
  8. 8. C.-T. CHOU and I. S. GOPAL, Linear broadcast routing, J. of Algorithms, 1989, 10, pp. 490-517. [MR: 1022108] [Zbl: 0825.68415] [Google Scholar]
  9. 9. K. DIKS and A. PELC, Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math., 1992, 5, pp. 338-344. [MR: 1172742] [Zbl: 0768.05060] [Google Scholar]
  10. 10. K. DIKS and A. PELC, Linear time gossiping with random faults, Rapport de Recherche RR 93/02-3, Université du Québec à Hull, 1993. [Zbl: 0803.68004] [Google Scholar]
  11. 11. L. GARGANO, Tighter time bounds on fault-tolerant broadcasting and gossiping, Networks, 1992, 22, pp. 469-486. [MR: 1170949] [Zbl: 0758.90033] [Google Scholar]
  12. 12. R. W. HADDAD, S. ROY and A. A. SCHAFFER, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth., 1987, 8, pp. 439-445. [MR: 897741] [Zbl: 0626.05033] [Google Scholar]
  13. 13. T. HAGERUP and C. RUB, A guided tour of Chernoff bounds, Inf. Proc. Letters, 1989/90, 33, pp. 305-308. [MR: 1045520] [Zbl: 0702.60021] [Google Scholar]
  14. 14. S. M. HEDETNIEMI, S. T. HEDETNIEMI and A. L. LIESTMAN, A survey of gossiping and broadcasting in communication networks, Networks, 1988, 18, pp. 319-349. [MR: 964236] [Zbl: 0649.90047] [Google Scholar]
  15. 15. E. R. SCHEINERMAN and J. C. WIERMAN, Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math., 1989, 25, pp. 289-297 [MR: 1026338] [Zbl: 0709.05031] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.