{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:18Z","timestamp":1725543978877},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_5","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:15:31Z","timestamp":1264382131000},"page":"44-56","source":"Crossref","is-referenced-by-count":0,"title":["Sub-linear Universal Spatial Gossip Protocols"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Baumann","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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: 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-52921-7_62","volume-title":"Algorithms","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 128\u2013137. Springer, Heidelberg (1990)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C., Kosowski, A., Lebhar, E., Lotker, Z.: Universal Augmentation Schemes for Network Navigability: Overcoming the \n                    \n                      \n                    \n                    $\\sqrt{n}$\n                  -Barrier. In: 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 1\u20137 (2007)","DOI":"10.1145\/1248377.1248379"},{"key":"5_CR4","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 Math.\u00a010, 57\u201377 (1985)","journal-title":"Discrete Applied Math."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, I., Kermarrec, A.-M., Ganesh, A.: Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast. In: 21st Symposium on Reliable Distributed Systems (SRDS), pp. 180\u2013189 (2002)","DOI":"10.1109\/RELDIS.2002.1180187"},{"key":"5_CR6","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Computing Aggregate Information using Gossip. In: 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS (2003)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. In: 33rd ACM Symposium on Theory of Computing, pp. 163\u2013172 (2001)","DOI":"10.1145\/380752.380796"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.: Protocols and impossibility results for gossip-based communication mechanisms. In: Proc. 43rd IEEE Symp. on Foundations of Computer Science, pp. 471\u2013480 (2002)","DOI":"10.1109\/SFCS.2002.1181971"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Luo, J., Eugster, P., Hubaux, J.-P.: Route driven gossip: probabilistic reliable multicast in ad hoc networks. In: 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 2229\u20132239 (2003)","DOI":"10.1109\/INFCOM.2003.1209243"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"Pittel, B.: On spreading a rumour. SIAM J. Applied Math.\u00a047, 213\u2013223 (1987)","journal-title":"SIAM J. Applied Math."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Plaxton, G., Rajaraman, R., Richa, A.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In: 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T22:53:44Z","timestamp":1552344824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}