{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:21Z","timestamp":1760706501319},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00107-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"121-133","source":"Crossref","is-referenced-by-count":8,"title":["Broadcasting with linearly bounded transmission faults"],"prefix":"10.1016","volume":"83","author":[{"given":"L.","family":"Ga\u0327sieniec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00107-8_BIB1","series-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing","first-page":"486","article-title":"Searching in the presence of linearly bounded errors","author":"Aslam","year":"1991"},{"key":"10.1016\/S0166-218X(97)00107-8_BIB2","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. Algebra Discrete Meth."},{"key":"10.1016\/S0166-218X(97)00107-8_BIB3","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\/S0166-218X(97)00107-8_BIB4","first-page":"266","article-title":"Optimal broadcasting in faulty hypercubes","author":"Chlebus","year":"1991"},{"key":"10.1016\/S0166-218X(97)00107-8_BIB5","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks, A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proceedings ICALP'93, 700, pp. 388\u2013397.","DOI":"10.1007\/3-540-56939-1_88"},{"key":"10.1016\/S0166-218X(97)00107-8_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<309::AID-NET5>3.0.CO;2-K","article-title":"Broadcasting in synchronous networks with dynamic faults","volume":"27","author":"Chlebus","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00107-8_BIB7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0405025","article-title":"Almost safe gossiping in bounded degree networks","volume":"5","author":"Diks","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00107-8_BIB8","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\/S0166-218X(97)00107-8_BIB9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(91)90105-Q","article-title":"Broadcasting in a hypercube when some calls fail","volume":"39","author":"Fraigniaud","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00107-8_BIB10","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\/S0166-218X(97)00107-8_BIB11","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\/S0166-218X(97)00107-8_BIB12","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. Algebra Discrete Meth."},{"key":"10.1016\/S0166-218X(97)00107-8_BIB13","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\/S0166-218X(97)00107-8_BIB14","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\/S0166-218X(97)00107-8_BIB15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(89)90077-7","article-title":"Searching with known error probability","volume":"63","author":"Pelc","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00107-8_BIB16","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\/S0166-218X(97)00107-8_BIB17","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\/S0166-218X(97)00107-8_BIB18","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:51:23Z","timestamp":1556117483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001078"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00107-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}