{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:59Z","timestamp":1725663599862},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:56:06Z","timestamp":1330257366000},"page":"388-397","source":"Crossref","is-referenced-by-count":10,"title":["Sparse networks supporting efficient reliable broadcasting"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Diks","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin, L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18 (1979), 155\u2013193.","journal-title":"J. Comput. System Sci."},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0607002","volume":"7","author":"K. A. Berman","year":"1986","unstructured":"K.A. Berman, M. Hawrylycz, Telephone problems with failures, SIAM J. Alg. Disc. Meth. 7 (1986), 13\u201317.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(88)90037-6","volume":"20","author":"D. Bienstock","year":"1988","unstructured":"D. Bienstock, Broadcasting with random faults, Disc. Appl. Math. 20 (1988), 1\u20137.","journal-title":"Disc. Appl. Math."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks, A. Pelc, Optimal broadcasting in faulty hypercubes, Proc. 21st Int. Symp. on Fault-Tolerant Computing, Montreal, Canada (1991), 266\u2013273.","DOI":"10.1109\/FTCS.1991.146672"},{"key":"32_CR5","unstructured":"K. Diks, A. Pelc, Reliable gossip schemes with random link failures, Proc. 28th Ann. Allerton Conf. on Comm. Control and Comp. (1990), 978\u2013987."},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0405025","volume":"5","author":"K. Diks","year":"1992","unstructured":"K. Diks, A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math. 5 (1992), 338\u2013344.","journal-title":"SIAM J. Disc. Math."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"L. Gargano, Tighter time bounds on fault tolerant broadcasting and gossiping, Networks, to appear.","DOI":"10.1002\/net.3230220505"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0608036","volume":"8","author":"R. W. Haddad","year":"1987","unstructured":"R.W. Haddad, S. Roy, A.A. Schaffer, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth. 8 (1987), 439\u2013445.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989\/90","unstructured":"T. Hagerup, C. Rub, A guided tour of Chernoff bounds, Inf. Proc. Letters 33 (1989\/90), 305\u2013308.","journal-title":"Inf. Proc. Letters"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1988","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"D. W. Krumme","year":"1992","unstructured":"D.W. Krumme, K.N. Venkataraman, G. Cybenko, Gossiping in minimal time, SIAM J. on Computing 21 (1992), 111\u2013139.","journal-title":"SIAM J. on Computing"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(89)90007-3","volume":"25","author":"E. R. Scheinerman","year":"1989","unstructured":"E.R. Scheinerman, J.C. Wierman, Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math. 25 (1989), 289\u2013297.","journal-title":"Disc. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:41Z","timestamp":1619571461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}