{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:19:58Z","timestamp":1740028798522,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633976"},{"type":"electronic","value":"9783540695363"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63397-9_10","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"118-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal adaptive broadcasting with a bounded fraction of faulty nodes"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/12.286303","volume":"43","author":"A. Bagchi","year":"1994","unstructured":"A. Bagchi and S.L. Hakimi, Information dissemination in distributed systems with faulty units, IEEE Trans. Comp. 43 (1994), 698\u2013710.","journal-title":"IEEE Trans. Comp."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"R. Beigel, W. Hurwood and N. Kahale, Fault diagnosis in a flash, Proc. 36th Symp. on Found. of Comp. Sci. (1995), 571\u2013580.","DOI":"10.1109\/SFCS.1995.492587"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0607002","volume":"7","author":"K.A. Berman","year":"1986","unstructured":"K.A. Berman and M. Hawrylycz, Telephone problems with failures, SIAM J. Alg. Disc. Meth. 7 (1986), 13\u201317.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10_CR4","unstructured":"D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, (1989)."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, L. Gasieniec and A. Pelc, Fast deterministic simulation of computations on faulty parallel machines, Proc. 3rd Ann. Eur. Symp. on Alg. ESA'95, (1995), 89\u2013101.","DOI":"10.1007\/3-540-60313-1_136"},{"key":"10_CR6","volume-title":"System-level diagnosis: A perspective for the third decade, Concurrent Computation: Algorithms, Architectures, Technologies","author":"A.T. Dahbura","year":"1988","unstructured":"A.T. Dahbura, System-level diagnosis: A perspective for the third decade, Concurrent Computation: Algorithms, Architectures, Technologies, Plenum Press, New York (1988)."},{"key":"10_CR7","unstructured":"A. Farley, Reliable minimum-time broadcast networks, in: Proc. 18th SE Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium 59 (1987), 37\u201348."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud and E. Lazaxd, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79\u2013133.","journal-title":"Disc. Appl. Math"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0405015","volume":"5","author":"L. Gaxgano","year":"1992","unstructured":"L. Gaxgano and U. Vaccaxo, Minimum time networks tolerating a logarithmic number of faults, SIAM J. Disc. Math. 5 (1992), 178\u2013198.","journal-title":"SIAM J. Disc. Math"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1016\/0167-8191(96)00023-3","volume":"22","author":"L. Gasieniec","year":"1996","unstructured":"L. Gasieniec and A. Pelc, Adaptive broadcasting with faulty nodes, Parallel Computing 22 (1996), 903\u2013912.","journal-title":"Parallel Computing"},{"key":"10_CR11","unstructured":"L. Gasieniec and A. Pelc, Broadcasting with linearly bounded transmission faults, Discrete Applied Mathematics, to appear."},{"key":"10_CR12","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 and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"10_CR13","unstructured":"S.L. Johnsson and C.T. Ho, Matrix multiplication on Boolean cubes using generic communication primitives, in: Parallel Processing and Medium-Scale Multiprocessors, A. Wouk (Ed.), SIAM, (1989), 108\u2013156."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J.G. Kuhl and S.M. Reddy, Distributed fault-tolerance for large multiprocessor systems, Proc. IEEE Symp. Comp. Architecture (1980), 23\u201330.","DOI":"10.1145\/800053.801905"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"A. Lubotzky, R. Philips and P. Sasnak, Explicit expanders and the Ramanujan conjectures, Proc. 18th Ann. ACM Symp. on Theory of Computing (1986), 247\u2013263.","DOI":"10.1145\/12130.12154"},{"key":"10_CR16","unstructured":"K. Nakajima, A new approach to system diagnosis, Proc. 19th Allerton Conf. Commun. Contr. and Computing (1981), 697\u2013706."},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A. Pelc","year":"1996","unstructured":"A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143\u2013156.","journal-title":"Networks"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/net.3230190706","volume":"19","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and A.A. Schiffer, Time bounds on fault-tolerant broadcasting, Networks 19 (1989), 803\u2013822.","journal-title":"Networks"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"F. Preparata","year":"1967","unstructured":"F. Preparata, G. Metze and R. Chien, On the connection assignment problem of diagnosable systems, IEEE Transactions on Electron. Computers 16 (1967), 848\u2013854.","journal-title":"IEEE Transactions on Electron. Computers"},{"key":"10_CR20","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"E. Upfal","year":"1994","unstructured":"E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Information and Computation 115 (1994), 312\u2013320.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63397-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:14:10Z","timestamp":1739999650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63397-9_10"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633976","9783540695363"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-63397-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"30 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}