SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Parallel and Distributed Computing

Volumn 60, Issue 5, 2000, Pages 566-584

Optimal Broadcasting in Faulty Trees

(2) Panaite, Petrişor a Pelc, Andrzej a

a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346438679 PISSN: 07437315 EISSN: None Source Type: Journal
DOI: 10.1006/jpdc.2000.1625 Document Type: Article

Times cited : (5)

References (18)

1
- 0040705692
- Telephone problems with failures
- Berman K. A., Hawrylycz M. Telephone problems with failures. SIAM J. Alg. Disc. Math. 7:1986;13-17.
- (1986) SIAM J. Alg. Disc. Math. , vol.7 , pp. 13-17
- Berman, K.A.¹ Hawrylycz, M.²

2
- 0024014549
- Broadcasting with random faults
- Bienstock D. Broadcasting with random faults. Disc. Appl. Math. 20:1988;1-7.
- (1988) Disc. Appl. Math. , vol.20 , pp. 1-7
- Bienstock, D.¹

3
- 21144480429
- Sparse networks supporting efficient reliable broadcasting
- LNCS 700
- B. S. Chlebus, K. Diks, and A. Pelc, Sparse networks supporting efficient reliable broadcasting, in Proc. ICALP'93, LNCS 700, pp. 388-397.
- In Proc. ICALP'93 , pp. 388-397
- Chlebus, B.S.¹ Diks, K.² Pelc, A.³

4
- 0039520281
- Almost safe gossiping in bounded degree networks
- Diks K., Pelc A. Almost safe gossiping in bounded degree networks. SIAM J. Disc. Math. 5:1992;338-344.
- (1992) SIAM J. Disc. Math. , vol.5 , pp. 338-344
- Diks, K.¹ Pelc, A.²

5
- 0030363275
- Efficient gossiping by packets in networks with random faults
- Diks K., Pelc A. Efficient gossiping by packets in networks with random faults. SIAM J. Disc. Math. 9:1996;7-18.
- (1996) SIAM J. Disc. Math. , vol.9 , pp. 7-18
- Diks, K.¹ Pelc, A.²

6
- 0002675271
- Methods and problems of communication in usual networks
- Fraigniaud P., Lazard E. Methods and problems of communication in usual networks. Disc. Appl. Math. 53:1994;79-133.
- (1994) Disc. Appl. Math. , vol.53 , pp. 79-133
- Fraigniaud, P.¹ Lazard, E.²

7
- 84971266763
- Tighter bounds on fault-tolerant broadcasting and gossiping
- Gargano L. Tighter bounds on fault-tolerant broadcasting and gossiping. Networks. 22:1992;469-486.
- (1992) Networks , vol.22 , pp. 469-486
- Gargano, L.¹

8
- 0040705614
- Minimum time networks tolerating a logarithmic number of faults
- Gargano L., Vaccaro U. Minimum time networks tolerating a logarithmic number of faults. SIAM J. Disc. Math. 5:1992;178-198.
- (1992) SIAM J. Disc. Math. , vol.5 , pp. 178-198
- Gargano, L.¹ Vaccaro, U.²

9
- 0038927696
- On gossiping with faulty telephone lines
- Haddad R. W., Roy S., Schäffer A. A. On gossiping with faulty telephone lines. SIAM J. Alg. Disc. Math. 8:1987;439-445.
- (1987) SIAM J. Alg. Disc. Math. , vol.8 , pp. 439-445
- Haddad, R.W.¹ Roy, S.² Schäffer, A.A.³

10
- 84986959281
- A survey of gossiping and broadcasting in communication networks
- Hedetniemi S. M., Hedetniemi S. T., Liestman A. L. A survey of gossiping and broadcasting in communication networks. Networks. 18:1988;319-349.
- (1988) Networks , vol.18 , pp. 319-349
- Hedetniemi, S.M.¹ Hedetniemi, S.T.² Liestman, A.L.³

11
- 0001330646
- Dissemination of information in interconnection networks (broadcasting and gossiping)
- F. Hsu, & D.-Z. Du. Dordrecht/Norwell: Kluwer Academic
- Hromkovič J., Klasing R., Monien B., Peine R. Dissemination of information in interconnection networks (broadcasting and gossiping). Hsu F., Du D.-Z. Combinatorial Network Theory. 1996;125-212 Kluwer Academic, Dordrecht/Norwell.
- (1996) Combinatorial Network Theory , pp. 125-212
- Hromkovič, J.¹ Klasing, R.² Monien, B.³ Peine, R.⁴

12
- 0022076604
- Fault-tolerant broadcast graphs
- Liestman A. L. Fault-tolerant broadcast graphs. Networks. 15:1985;159-171.
- (1985) Networks , vol.15 , pp. 159-171
- Liestman, A.L.¹

13
- 84958037195
- Optimal fault-tolerant broadcasting in trees
- p. 143-152
- Panaite P., Pelc A. Optimal fault-tolerant broadcasting in trees. Proc. 8th Annual International Symposium on Algorithms and Computation (ISAAC'97). LNCS 1350. Dec. 1997;. p. 143-152.
- (1997) Proc. 8th Annual International Symposium on Algorithms and Computation (ISAAC'97) LNCS 1350
- Panaite, P.¹ Pelc, A.²

14
- 0031375661
- Universally fault-tolerant broadcasting in trees
- p. 724-729
- Panaite P., Pelc A. Universally fault-tolerant broadcasting in trees. Proc. International Conference on Parallel and Distributed Systems (ICPADS'97). Dec. 1997;. p. 724-729.
- (1997) Proc. International Conference on Parallel and Distributed Systems (ICPADS'97)
- Panaite, P.¹ Pelc, A.²

15
- 0012614841
- Fault-tolerant broadcasting and gossiping in communication networks
- Pelc A. Fault-tolerant broadcasting and gossiping in communication networks. Networks. 28:1996;143-156.
- (1996) Networks , vol.28 , pp. 143-156
- Pelc, A.¹

16
- 84986938680
- Time bounds on fault-tolerant broadcasting
- Peleg D., Schäffer A. A. Time bounds on fault-tolerant broadcasting. Networks. 19:1989;803-822.
- (1989) Networks , vol.19 , pp. 803-822
- Peleg, D.¹ Schäffer, A.A.²

17
- 38249005932
- Optimal and near-optimal broadcast in random graphs
- Scheinerman E. R., Wierman J. C. Optimal and near-optimal broadcast in random graphs. Disc. Appl. Math. 25:1989;289-297.
- (1989) Disc. Appl. Math. , vol.25 , pp. 289-297
- Scheinerman, E.R.¹ Wierman, J.C.²

18
- 0000321285
- Information dissemination in trees
- Slater P. J., Cockayne E. J., Hedetniemi S. T. Information dissemination in trees. SIAM J. Comput. 10:1981;692-701.
- (1981) SIAM J. Comput. , vol.10 , pp. 692-701
- Slater, P.J.¹ Cockayne, E.J.² Hedetniemi, S.T.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.