{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:09:55Z","timestamp":1760706595946},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0167-8191(96)00023-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"903-912","source":"Crossref","is-referenced-by-count":18,"title":["Adaptive broadcasting with faulty nodes"],"prefix":"10.1016","volume":"22","author":[{"given":"Leszek","family":"Ga\u0327sieniec","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(96)00023-3_BIB1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0607002","article-title":"Telephone problems with failures","volume":"7","author":"Berman","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0167-8191(96)00023-3_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(88)90037-6","article-title":"Broadcasting with random faults","volume":"20","author":"Bienstock","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-8191(96)00023-3_BIB3","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks and A. Pelc, Sparse networks supporting efficient reliable broadcasting, in: Proc. ICALP'93, Lecture Notes in Computer Science 700 (Springer, Berlin) 388\u2013397.","DOI":"10.1007\/3-540-56939-1_88"},{"key":"10.1016\/0167-8191(96)00023-3_BIB4","first-page":"266","article-title":"Optimal broadcasting in faulty hypercubes","author":"Chlebus","year":"1991","journal-title":"Digest of Papers, FTCS'21"},{"key":"10.1016\/0167-8191(96)00023-3_BIB5","first-page":"187","article-title":"Waking up an anonymous faulty network from a single source","volume":"Vol. 2","author":"Chlebus","year":"1994"},{"key":"10.1016\/0167-8191(96)00023-3_BIB6","author":"Cormen","year":"1990"},{"key":"10.1016\/0167-8191(96)00023-3_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-8191(96)00023-3_BIB8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230220505","article-title":"Tighter bounds on fault-tolerant broadcasting and gossiping","volume":"22","author":"Gargano","year":"1992","journal-title":"Networks"},{"key":"10.1016\/0167-8191(96)00023-3_BIB9","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0405015","article-title":"Minimum time networks tolerating a logarithmic number of faults","volume":"5","author":"Gargano","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-8191(96)00023-3_BIB10","article-title":"Broadcasting with a bounded fraction of faulty nodes","author":"Ga\u0327sieniec","year":"1995"},{"key":"10.1016\/0167-8191(96)00023-3_BIB11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0608036","article-title":"On gossiping with faulty telephone lines","volume":"8","author":"Haddad","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0167-8191(96)00023-3_BIB12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0167-8191(96)00023-3_BIB13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230150203","article-title":"Fault-tolerant broadcast graphs","volume":"15","author":"Liestman","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0167-8191(96)00023-3_BIB14","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/net.3230190706","article-title":"Time bounds on fault-tolerant broadcasting","volume":"19","author":"Peleg","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0167-8191(96)00023-3_BIB15","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/12.9743","article-title":"Reliable broadcast in hypercube multicomputers","volume":"37","author":"Ramanathan","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(96)00023-3_BIB16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(89)90007-3","article-title":"Optimal and near-optimal broadcast in random graphs","volume":"25","author":"Scheinerman","year":"1989","journal-title":"Discrete Appl. Math."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819196000233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819196000233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:20:20Z","timestamp":1555557620000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819196000233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0167819196000233"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(96)00023-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}