{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T10:23:20Z","timestamp":1784802200894,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_11","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"127-138","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Information Exchange in the Random Phone-Call Model"],"prefix":"10.1007","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Zadimoghaddam, M.: How Efficient is Gossip? (On the Message Complexity of Resilient Information Exchange). In: Proc. 37th International Colloquium on Automata, Languages and Programming, ICALP 2010 (2010)","DOI":"10.1007\/978-3-642-14162-1_10"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Els\u00e4sser, R., Friedetzky, T.: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In: Proc. 27th ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 155\u2013164 (2008)","DOI":"10.1145\/1400751.1400773"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J., Pandurangan, G.: Optimal Gossip-Based Aggregate Computation. In: Proc. of 22nd ACM Symposium on Parallel Algorithms and Architectures, SPAA 2010 (2010)","DOI":"10.1145\/1810479.1810504"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: Measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann.\u00a0Math.\u00a0Statist.\u00a023, 493\u2013507 (1952)","journal-title":"Ann.\u00a0Math.\u00a0Statist."},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/S0895480295292934","volume":"11","author":"A. Czumaj","year":"1998","unstructured":"Czumaj, A., G\u0105sieniec, L., Pelc, A.: L\u00a0G\u0105sieniec, and A.\u00a0Pelc. Time and cost trade-offs in gossiping. SIAM J. Discrete Mathematics\u00a011(3), 400\u2013413 (1998)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Maintenance. In: Proc. 6th ACM Symposium on Principles of Distributed Computing, PODC \u201987, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D. Dubhashi","year":"1998","unstructured":"Dubhashi, D., Ranjan, D.: Balls and Bins: A Study in Negative Dependence. Random Structures and Algorithms\u00a013(2), 99\u2013124 (1998)","journal-title":"Random Structures and Algorithms"},{"key":"11_CR8","unstructured":"Els\u00e4sser, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proc. 19th ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 290\u2013227 (2008)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proc. 18th ACM Symposium on Parallel Algorithms and Architectures, SPAA 2006, pp. 148\u2013157 (2006)","DOI":"10.1145\/1148109.1148135"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithms\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Structures and Algorithms"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A. Frieze","year":"1985","unstructured":"Frieze, A., Grimmett, G.: The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics\u00a010, 57\u201377 (1985)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/0404021","volume":"4","author":"M. Grigni","year":"1991","unstructured":"Grigni, M., Peleg, D.: Tight Bounds on Minimum Broadcast Networks. SIAM J. on Discrete Mathematics\u00a04(2), 207\u2013222 (1991)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks\u00a018(4), 319\u2013349 (1988)","journal-title":"Networks"},{"key":"11_CR14","volume-title":"Dissemination of Information in Communication Networks - Broadcasting. Gossiping, Leader Election, and Fault-Tolerance","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. Springer, Heidelberg (2005)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc. 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, pp. 565\u2013574 (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0196-6774(87)90040-X","volume":"8","author":"B. Pittel","year":"1987","unstructured":"Pittel, B.: Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. J. Algorithms\u00a08(2), 236\u2013249 (1987)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:48:05Z","timestamp":1606168085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}