{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:58:28Z","timestamp":1742392708458},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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":[[1994,9]]},"DOI":"10.1016\/0166-218x(94)90176-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"15-24","source":"Crossref","is-referenced-by-count":9,"title":["Fast gossiping with short unreliable messages"],"prefix":"10.1016","volume":"53","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90176-7_BIB1","first-page":"66","article-title":"Investigations of fault-tolerant networks of computers","author":"Berman","year":"1988","journal-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(94)90176-7_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\/0166-218X(94)90176-7_BIB3","series-title":"Probability and Measure","author":"Billingsley","year":"1979"},{"key":"10.1016\/0166-218X(94)90176-7_BIB4","first-page":"266","article-title":"Optimal broadcasting in faulty hypercubes","author":"Chlebus","year":"1991","journal-title":"Digest of Papers"},{"key":"10.1016\/0166-218X(94)90176-7_BIB5","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks and A. Pelc, Sorting on a mesh-connected computer with delaying links, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/S0895480191198604"},{"key":"10.1016\/0166-218X(94)90176-7_BIB6","series-title":"Proceedings of the Seventh SE Conference on Combinatorics, Graph Theory and Computing","first-page":"239","article-title":"Extensions of the telephone problem","author":"Cot","year":"1976"},{"key":"10.1016\/0166-218X(94)90176-7_BIB7","first-page":"978","article-title":"Reliable gossip schemes with random link failures","author":"Diks","year":"1990","journal-title":"Proceedings of the 28th Annual Allerton Conference on Comm. Control and Comp."},{"key":"10.1016\/0166-218X(94)90176-7_BIB8","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\/0166-218X(94)90176-7_BIB9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230220505","article-title":"Tighter time bounds on fault tolerant broadcasting and gossiping","volume":"22","author":"Gargano","year":"1992","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)90176-7_BIB10","series-title":"Fundamentals of Queuing Theory","author":"Gross","year":"1985"},{"key":"10.1016\/0166-218X(94)90176-7_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\/0166-218X(94)90176-7_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\/0166-218X(94)90176-7_BIB13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/0221026","article-title":"Fast gossiping for the hypercube","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90176-7_BIB14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","article-title":"Gossiping in minimal time","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90176-7_BIB15","first-page":"475","article-title":"The telephone problem for trees","volume":"22","author":"Labahn","year":"1986","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0166-218X(94)90176-7_BIB16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/net.3230220503","article-title":"Reliable communication in networks with Byzantine link failures","volume":"22","author":"Pelc","year":"1992","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)90176-7_BIB17","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:0166218X94901767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:28:33Z","timestamp":1555122513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0166218X94901767"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90176-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}