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

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 83, Issue 1-3, 1998, Pages 121-133

Broadcasting with linearly bounded transmission faults

(2) Gasieniec L a Pelc, A b

a UNIVERSITY OF WARSAW (Poland)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042855217 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(97)00107-8 Document Type: Article

Times cited : (7)

References (18)

1
- 0002400370
- Searching in the presence of linearly bounded errors
- J.A. Aslam, A. Dhagat, Searching in the presence of linearly bounded errors, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing. 1991, pp. 486-493.
- (1991) Proceedings of the 23rd Annual ACM Symposium on Theory of Computing , pp. 486-493
- Aslam, J.A.¹ Dhagat, A.²

2
- 0040705692
- Telephone problems with failures
- K.A. Berman, M. Hawrylycz, Telephone problems with failures, SIAM J. Algebra Discrete Meth. 7 (1986) 13-17.
- (1986) SIAM J. Algebra Discrete Meth. , vol.7 , pp. 13-17
- Berman, K.A.¹ Hawrylycz, M.²

3
- 0024014549
- Broadcasting with random faults
- D. Bienstock, Broadcasting with random faults, Discrete Appl. Math. 20 (1988) 1-7.
- (1988) Discrete Appl. Math. , vol.20 , pp. 1-7
- Bienstock, D.¹

4
- 0026172385
- Optimal broadcasting in faulty hypercubes
- B.S. Chlebus, K. Diks, A. Pelc, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS'21, 1991, pp. 266-273.
- (1991) Digest of Papers, FTCS'21 , pp. 266-273
- Chlebus, B.S.¹ Diks, K.² Pelc, A.³

5
- 21144480429
- Sparse networks supporting efficient reliable broadcasting
- B.S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proceedings ICALP'93, 700, pp. 388-397.
- Proceedings ICALP'93 , vol.700 , pp. 388-397
- Chlebus, B.S.¹ Diks, K.² Pelc, A.³

6
- 0040153414
- Broadcasting in synchronous networks with dynamic faults
- B.S. Chlebus, K. Diks, A. Pelc, Broadcasting in synchronous networks with dynamic faults, Networks, 27 (1996) 309-318.
- (1996) Networks , vol.27 , pp. 309-318
- Chlebus, B.S.¹ Diks, K.² Pelc, A.³

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

8
- 0002675271
- Methods and problems of communication in usual networks
- P. Fraigniaud, E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53 (special issue on broadcasting and gossiping) (1994) 79-133.
- (1994) Discrete Appl. Math. , vol.53 , Issue.SPECIAL ISSUE ON BROADCASTING AND GOSSIPING , pp. 79-133
- Fraigniaud, P.¹ Lazard, E.²

9
- 0026206743
- Broadcasting in a hypercube when some calls fail
- P. Fraigniaud, C. Peyrat, Broadcasting in a hypercube when some calls fail, Inform. Process. Lett. 39 (1991) 115-119.
- (1991) Inform. Process. Lett. , vol.39 , pp. 115-119
- Fraigniaud, P.¹ Peyrat, C.²

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

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

12
- 0038927696
- On gossiping with faulty telephone lines
- R.W. Haddad, S. Roy, A.A. Schäffer, On gossiping with faulty telephone lines, SIAM J. Algebra Discrete Meth. 8 (1987) 439-445.
- (1987) SIAM J. Algebra Discrete Meth. , vol.8 , pp. 439-445
- Haddad, R.W.¹ Roy, S.² Schäffer, A.A.³

13
- 84986959281
- A survey of gossiping and broadcasting in communication networks
- S.M. Hedetniemi, S.T. Hedetniemi, A.L. Liestman, 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.³

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

15
- 0024608726
- Searching with known error probability
- A. Pelc, Searching with known error probability, Theoret. Comput. Sci. 63 (1989) 185-202.
- (1989) Theoret. Comput. Sci. , vol.63 , pp. 185-202
- Pelc, A.¹

16
- 84986938680
- Time bounds on fault-tolerant broadcasting
- D. Peleg, A.A. Schäffer, 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
- 0024142782
- Reliable broadcast in hypercube multicomputers
- P. Ramanathan, K.G. Shin, Reliable broadcast in hypercube multicomputers, IEEE Trans. Comput. 37 (1988) 1654-1657.
- (1988) IEEE Trans. Comput. , vol.37 , pp. 1654-1657
- Ramanathan, P.¹ Shin, K.G.²

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

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