{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:41Z","timestamp":1742617181406,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:10:49Z","timestamp":1330269049000},"page":"207-217","source":"Crossref","is-referenced-by-count":0,"title":["Fault-tolerant linear broadcasting"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","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":"18_CR2","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":"18_CR3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1006\/jagm.1993.1015","volume":"14","author":"S. Bitan","year":"1993","unstructured":"S. Bitan & S. Zaks, Optimal linear broadcast, J. of Algorithms 14 (1993), 288\u2013315.","journal-title":"J. of Algorithms"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks & A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proc. ICALP'93, LNCS 700, 388\u2013397.","DOI":"10.1007\/3-540-56939-1_88"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks & A. Pelc, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS'21 (1991), 266\u2013273.","DOI":"10.1109\/FTCS.1991.146672"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0196-6774(89)90002-3","volume":"10","author":"C.T. Chou","year":"1989","unstructured":"C.T. Chou & I.S. Gopal, Linear broadcast routing, J. of Algorithms 10 (1989), 490\u2013517.","journal-title":"J. of Algorithms"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/dac.4520010208","volume":"1","author":"I. Cidon","year":"1988","unstructured":"I. Cidon & I.S. Gopal, PARIS: An approach to private integrated networks, Intern. J. Analog Digital Cable Systems 1 (1988), 77\u201385.","journal-title":"Intern. J. Analog Digital Cable Systems"},{"key":"18_CR8","unstructured":"T. Cormen, C. Leisserson, & R.L. Rivest, Introduction to algorithms, The MIT Press, 1990."},{"key":"18_CR9","first-page":"463","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"P. Erd\u00f6s & Szekers, A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463\u2013470.","journal-title":"Compositio Mathematica"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230220505","volume":"22","author":"L. Gargano","year":"1992","unstructured":"L. Gargano, Tighter bounds on fault-tolerant broadcasting and gossiping, Networks 22 (1992), 469\u2013486.","journal-title":"Networks"},{"key":"18_CR11","unstructured":"D. Greenberg, Report dispersal, in: Open problems for the International Workshop on Networks and Information Dissemination, Bowen Island, B.C. (1992)."},{"key":"18_CR12","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. Schafer, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth. 8 (1987), 439\u2013445.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"18_CR13","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":"18_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segal","year":"1983","unstructured":"A. Segal, Distributed network protocols, IEEE Trans. Inf. Theory IT-29 (1983), 23\u201335.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:19:00Z","timestamp":1742595540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}