{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:24:57Z","timestamp":1737437097993,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75142-7_26","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"328-342","source":"Crossref","is-referenced-by-count":5,"title":["On the Communication Surplus Incurred by Faulty Processors"],"prefix":"10.1007","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Strojnowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing. John Willey & Sons, West Sussex, England (2004)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proc. of 34th ACM Symposium on Theory of Computing (STOC), pp. 659\u2013668 (2002)","DOI":"10.1145\/509907.510003"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1016\/j.jcss.2006.08.001","volume":"72","author":"B.S. Chlebus","year":"2006","unstructured":"Chlebus, B.S., Kowalski, D.R.: Robust gossiping with an application to consensus. Journal of Computer and System Sciences\u00a072, 1262\u20131281 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11864219_22","volume-title":"Distributed Computing","author":"B.S. Chlebus","year":"2006","unstructured":"Chlebus, B.S., Kowalski, D.R.: Time and communication efficient consensus for crash failures. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 314\u2013328. Springer, Heidelberg (2006)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proc. of 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101 (2006)","DOI":"10.1145\/1146381.1146398"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Shvartsman, A.A.: Collective asynchronous reading with polylogarithmic worst-case overhead. In: Proc. of 36th ACM Symposium on Theory of Computing (STOC), pp. 321\u2013330 (2004)","DOI":"10.1145\/1007352.1007406"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s004530010030","volume":"28","author":"K. Diks","year":"2000","unstructured":"Diks, K., Pelc, A.: Optimal adaptive broadcasting with a bounded fraction of faulty nodes. Algorithmica\u00a028(1), 37\u201350 (2000)","journal-title":"Algorithmica"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D. Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine Agreement. Journal of ACM\u00a032(1), 191\u2013204 (1985)","journal-title":"Journal of ACM"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. Fischer","year":"1982","unstructured":"Fischer, M., Lynch, N.: A lower bound for the time to assure interactive consistency. Information Processing Letters\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters"},{"issue":"5","key":"26_CR10","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1137\/S0097539793252870","volume":"25","author":"S. Fujita","year":"1996","unstructured":"Fujita, S., Yamashita, M.: Optimal group gossiping in hypercubes under circuit switching model. SIAM J. on Computing\u00a025(5), 1045\u20131060 (1996)","journal-title":"SIAM J. on Computing"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of Byzantine agreement and beyond. In: Proc. of 36th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 724\u2013733 (1995)","DOI":"10.1109\/SFCS.1995.492674"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-540-39989-6_16","volume-title":"Distributed Computing","author":"C. Georgiou","year":"2003","unstructured":"Georgiou, C., Kowalski, D.R., Shvartsman, A.A.: Efficient gossip and robust distributed computation. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 224\u2013238. Springer, Heidelberg (2003)"},{"key":"26_CR13","series-title":"EATCS Series","volume-title":"Theoretical Computer Science","author":"J. Hromkovic","year":"2005","unstructured":"Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of information in communication networks: broadcasting, gossiping, leader election, and fault-tolerance. In: Theoretical Computer Science. EATCS Series, Springer, Heidelberg (2005)"},{"key":"26_CR14","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger, G., Toueg, S.: Automatically increasing the fault-tolerance of distributed systems. Journal of Algorithms\u00a011, 374\u2013419 (1990)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T21:16:09Z","timestamp":1737407769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540751410","9783540751427"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}