{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:06Z","timestamp":1725600306256},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_10","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"72-83","source":"Crossref","is-referenced-by-count":2,"title":["Faster Coupon Collecting via Replication with Applications in Gossiping"],"prefix":"10.1007","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Friedetzky","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Nagel","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced Allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-14162-1_10","volume-title":"Automata, Languages and Programming","author":"D. Alistarh","year":"2010","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Zadimoghaddam, M.: How efficient can gossip be (On the cost of resilient information exchange). In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 115\u2013126. Springer, Heidelberg (2010)"},{"key":"10_CR3","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. of PODC 2008, pp. 155\u2013164 (2008)","DOI":"10.1145\/1400751.1400773"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Czyzowicz, J., Els\u00e4sser, R., Gasieniec, L.: Efficient information exchange in the random phone-call model (2010) (manuscript)","DOI":"10.1007\/978-3-642-14162-1_11"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Pandurangan, G.: Optimal Gossip-Based Aggregate Computation. To appear in Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2010)","DOI":"10.1145\/1810479.1810504"},{"key":"10_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 1987, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"10_CR7","unstructured":"Els\u00e4sser, R., Sauerwald, T.: The power of memory in randomized broadcasting. In: Proc. of SODA 2008, pp. 290\u2013227 (2008)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Els\u00e4sser, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proc. of SPAA 2006, pp. 148\u2013157 (2006)","DOI":"10.1145\/1148109.1148135"},{"issue":"4","key":"10_CR9","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":"10_CR10","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1016\/j.jpdc.2007.05.004","volume":"12","author":"Y. Fernandess","year":"2007","unstructured":"Fernandess, Y., Malkhi, D.: On collaborative content distribution using multi-message gossip. Journal of Parallel and Distributed Computing\u00a012, 1232\u20131239 (2007)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR11","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc. of FOCS 2000, pp. 565\u2013574 (2000)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of FOCS 2003, pp. 482\u2013491 (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambdrige University Press, Cambdrige (1995)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:10Z","timestamp":1606187410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}