{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:50:36Z","timestamp":1761976236303,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_14","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"194-208","source":"Crossref","is-referenced-by-count":4,"title":["Gossip Protocols for Renaming and Sorting"],"prefix":"10.1007","author":[{"given":"George","family":"Giakkoupis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An O(nlogn) sorting network. In: Proc. 15th STOC, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gilbert, S., Guerraoui, R.: The complexity of renaming. In: Proc. 52nd FOCS, pp. 718\u2013727 (2011)","DOI":"10.1109\/FOCS.2011.66"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chen, J., Wu, Y., Yin, Y.: Fast construction of overlay networks. In: Proc. 17th SPAA, pp. 145\u2013154 (2005)","DOI":"10.1145\/1073970.1073991"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference, pp. 307\u2013314 (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"14_CR6","unstructured":"Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating Aggregates on a Peer-to-Peer Network. Technical report, Stanford University (2003)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Els\u00e4sser, R., Friedetzky, T.: Efficient randomized broadcasting in random regular networks with applications in peer-to-peer systems. In: Proc. 27th PODC, pp. 155\u2013164 (2008)","DOI":"10.1145\/1400751.1400773"},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S.P. Boyd","year":"2006","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory,\u00a052(6), 2508\u20132530 (2006)","journal-title":"IEEE Trans. Inf. Theory,"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Cooper, C., Dyer, M.E., Handley, A.J.: The flip markov chain and a randomising P2P protocol. In: Proc. 28th PODC, pp. 141\u2013150 (2009)","DOI":"10.1145\/1582716.1582742"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H.E., Swinehart, D.C., Terry, D.B.: Epidemic algorithms for replicated database maintenance. In: Proc. 6th PODC, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Woelfel, P.: Tight lower bounds for greedy routing in uniform small world rings. In: Proc. 41st STOC, pp. 591\u2013600 (2009)","DOI":"10.1145\/1536414.1536494"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-22012-8_40","volume-title":"Automata, Languages and Programming","author":"B. Doerr","year":"2011","unstructured":"Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 502\u2013513. Springer, Heidelberg (2011)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proc. 43rd STOC, pp. 21\u201330 (2011)","DOI":"10.1145\/1993636.1993640"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-02927-1_31","volume-title":"Automata, Languages and Programming","author":"B. Doerr","year":"2009","unstructured":"Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: Expanders, push vs. Pull, and robustness. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 366\u2013377. Springer, Heidelberg (2009)"},{"issue":"36","key":"14_CR15","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1016\/j.tcs.2008.04.017","volume":"410","author":"R. Els\u00e4sser","year":"2009","unstructured":"Els\u00e4sser, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. Theor. Comput. Sci.\u00a0410(36), 3414\u20133427 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Feder, T., Guetz, A., Mihail, M., Saberi, A.: A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks. In: Proc. 47th FOCS, pp. 69\u201376 (2006)","DOI":"10.1109\/FOCS.2006.5"},{"key":"14_CR17","unstructured":"Felber, P.: Epidemic algorithms: A \u201csystems\u201d perspective. Talk at the Dagstuhl Seminar 13042, Epidemic Algorithms and Processes: From Theory to Practice (February 2013), Slides available online at http:\/\/www.dagstuhl.de\/mat\/Files\/13\/13042\/13042.FelberPascal.Slides.pdf"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting in random networks and the effect of density. In: Proc. 29th INFOCOM, pp. 2552\u20132560 (2010)","DOI":"10.1109\/INFCOM.2010.5462084"},{"key":"14_CR19","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proc. 28th STACS, pp. 57\u201368 (2011)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Kermarrec, A.-M.: Ordered slicing of very large-scale overlay networks. In: Peer-to-Peer Computing, pp. 117\u2013124 (2006)","DOI":"10.1109\/P2P.2006.25"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1275517.1275520","volume":"25","author":"M. Jelasity","year":"2007","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst.\u00a025(3), 8 (2007)","journal-title":"ACM Trans. Comput. Syst."},{"key":"14_CR22","unstructured":"Karp, R.M., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc. 41st FOCS, pp. 565\u2013574 (2000)"},{"key":"14_CR23","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. 44th FOCS, pp. 482\u2013491 (2003)"},{"issue":"6","key":"14_CR24","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1145\/1039488.1039491","volume":"51","author":"D. Kempe","year":"2004","unstructured":"Kempe, D., Kleinberg, J.M., Demers, A.J.: Spatial gossip and resource location protocols. J. ACM\u00a051(6), 943\u2013967 (2004)","journal-title":"J. ACM"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Navigation in a small-world. Nature, 845 (2000)","DOI":"10.1038\/35022643"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: The small-world phenomenon: An algorithm perspective. In: Proc. 32nd STOC, pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"14_CR27","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"issue":"7","key":"14_CR28","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1109\/TIT.2008.924648","volume":"54","author":"D. Mosk-Aoyama","year":"2008","unstructured":"Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Trans. Inf. Theory\u00a054(7), 2997\u20133007 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw.\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0214009","volume":"14","author":"A.C.-C. Yao","year":"1985","unstructured":"Yao, A.C.-C., Yao, F.F.: On fault-tolerant networks for sorting. SIAM J. Comput.\u00a014(1), 120\u2013128 (1985)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:28Z","timestamp":1746026848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}