{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:22Z","timestamp":1725488422092},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666943"},{"type":"electronic","value":"9783540478492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-47849-3_26","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T04:45:30Z","timestamp":1186807530000},"page":"387-394","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Gossiping by Packets in Faulty Networks"],"prefix":"10.1007","author":[{"given":"Anna","family":"Gambin","sequence":"first","affiliation":[]},{"given":"Adam","family":"Malinowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"26_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0049426","volume-title":"Proceedings of the 2nd Annual European Symposium on Algorithms","author":"B. S. Chlebus","year":"1994","unstructured":"B. S. Chlebus, A. Gambin, P. Indyk, PRAM computations resilient to memory faults, Proceedings of the 2nd Annual European Symposium on Algorithms, LNCS 855 (1994), 401\u2013412."},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R. E. Tarjan, Dynamic perfect hashing: upper and lower bounds, SIAM J. Comput. Vol. 23, No. 4 (1994), 738\u2013761.","journal-title":"SIAM J. Comput."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1137\/0409002","volume":"9","author":"K. Diks","year":"1996","unstructured":"K. Diks, A. Pelc, Efficient gossiping by packets in networks with random faults, SIAM J. on Discr. Math. 9 (1996), 7\u201318.","journal-title":"SIAM J. on Discr. Math."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"U. Feige, D. Peleg, P. Raghavan, E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms 1 (1990), 447\u2013460.","journal-title":"Random Structures and Algorithms"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud, E. Lazard, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79\u2013133.","journal-title":"Disc. Appl. Math."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989","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":"26_CR7","doi-asserted-by":"publisher","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"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0129626497000097","volume":"7","author":"A. Malinowski","year":"1997","unstructured":"A. Malinowski, Efficient Byzantine Agreement in networks with random faults, Parallel Proc. Letters Vol. 7, No. 1 (1997), 69\u201376.","journal-title":"Parallel Proc. Letters"},{"key":"26_CR9","doi-asserted-by":"publisher","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":"26_CR10","unstructured":"J. P. Schmidt, A. Siegel, A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence, Proceedings of the ACM\/SIAM Symposium on Discrete Algorithms (1993), 331\u2013340."}],"container-title":["Lecture Notes in Computer Science","SOFSEM\u201999: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47849-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T10:27:40Z","timestamp":1550744860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47849-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666943","9783540478492"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-47849-3_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}