{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:59:24Z","timestamp":1794383964719,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540201847","type":"print"},{"value":"9783540399896","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_16","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:01:57Z","timestamp":1294434117000},"page":"224-238","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Gossip and Robust Distributed Computation"],"prefix":"10.1007","author":[{"given":"Chryssis","family":"Georgiou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. J. Wiley and Sons, Inc., Chichester (2000)","edition":"2"},{"issue":"5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/S0097539794319126","volume":"26","author":"R.J. Anderson","year":"1997","unstructured":"Anderson, R.J., Woll, H.: Algorithms for the certified Write-All problem. SIAM Journal of Computing\u00a026(5), 1277\u20131283 (1997)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/PL00008926","volume":"14","author":"B. Chlebus","year":"2001","unstructured":"Chlebus, B., De Prisco, R., Shvartsman, A.A.: Performing tasks on restartable message-passing processors. Distributed Computing\u00a014(1), 49\u201364 (2001)","journal-title":"Distributed Computing"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Gasieniec, L., Kowalski, D.R., Shvartsman, A.A.: Bounding work and communication in robust cooperative computation. In: 16th International Symposium on Distributed Computing, pp. 295\u2013310 (2002)","DOI":"10.1007\/3-540-36108-1_20"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R.: Gossiping to reach consensus. In: 14th Symposium on Parallel Algorithms and Architectures, pp. 220\u2013229 (2002)","DOI":"10.1145\/564870.564908"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"De Prisco, R., Mayer, A., Yung, M.: Time-optimal message-efficient work performance in the presence of faults. In: 13th Symposium on Principles of Distributed Computing, pp. 161\u2013172 (1994)","DOI":"10.1145\/197917.198082"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Halpern, J., Waarts, O.: Performing work efficiently in the presence of faults. SIAM Journal on Computing\u00a027(5), 1457\u20131491 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: 36th Symp. on Foundations of Comp. Sc., pp. 724\u2013733 (1995)","DOI":"10.1109\/SFCS.1995.492674"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Russell, A., Shvartsman, A.A.: The complexity of synchronous iterative Do-All with crashes. In: 15th Int-l Symposium on Distributed Computing, pp. 151\u2013165 (2001)","DOI":"10.1007\/3-540-45414-4_11"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Kowalski, D., Shvartsman, A.A.: Efficient gossip and robust distributed computation, http:\/\/www.engr.uconn.edu\/~aas\/GKS-2003.ps","DOI":"10.1007\/978-3-540-39989-6_16"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Efficient parallel algorithms can be made robust. Distributed Computing\u00a05(4), 201\u2013217 (1992)","journal-title":"Distributed Computing"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Russell, A., Shvartsman, A.A.: Distributed cooperation during the absence of communication. In: 14th Int-l Symp. on Distr. Computing, pp. 119\u2013133 (2000)","DOI":"10.1007\/3-540-40026-5_8"},{"key":"16_CR13","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":"Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks\u00a028, 143\u2013156 (1996)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39989-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:02:55Z","timestamp":1559916175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_16","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b13831","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}