{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:37Z","timestamp":1759063537891,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_36","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"451-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotics for Push on the Complete Graph"],"prefix":"10.1007","author":[{"given":"Rami","family":"Daknama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Panagiotou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Reisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/312203.312207","volume":"17","author":"KP Birman","year":"1999","unstructured":"Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41\u201388 (1999)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/(SICI)1098-2418(200005)16:3<277::AID-RSA4>3.0.CO;2-1","volume":"16","author":"S Boucheron","year":"2000","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: A sharp concentration inequality with applications. Random Struct. Algorithms 16(3), 277\u2013292 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 399\u2013408. ACM (2010)","DOI":"10.1145\/1806689.1806745"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1657\u20131663. SIAM (2010)","DOI":"10.1137\/1.9781611973075.135"},{"key":"36_CR5","unstructured":"Daknama, R., Panagiotou, K., Reisser, S.: Robustness of randomized rumour spreading. In: Proceedings of the 27th Annual European Symposium on Algorithms, ESA. Leibniz International Proceedings in Informatics (LIPIcs), vol. 144, pp. 36:1\u201336:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, PODC, pp. 1\u201312. ACM (1987)","DOI":"10.1145\/41840.41841"},{"key":"36_CR7","unstructured":"Doerr, B., K\u00fcnnemann, M.: Tight analysis of randomized rumor spreading in complete graphs. In: Proceedings of the 11th Workshop on Analytic Algorithmics and Combinatorics, ANALCO, pp. 82\u201391. SIAM (2014)"},{"key":"36_CR8","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On a classical problem of probability theory. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 6, 215\u2013220 (1961)"},{"issue":"4","key":"36_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 Struct. Algorithms 1(4), 447\u2013460 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Huber, A., Panagiotou, K.: Reliable broadcasting in random networks and the effect of density. In: Proceedings of the 29th IEEE International Conference on Computer Communications, IEEE Annual Joint Conference, INFOCOM, pp. 2552\u20132560 (2010)","DOI":"10.1109\/INFCOM.2010.5462084"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-642-15369-3_42","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N Fountoulakis","year":"2010","unstructured":"Fountoulakis, N., Panagiotou, K.: Rumor spreading on random regular graphs and expanders. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX\/RANDOM - 2010. LNCS, vol. 6302, pp. 560\u2013573. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15369-3_42"},{"issue":"1","key":"36_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"AM Frieze","year":"1985","unstructured":"Frieze, A.M., Grimmett, G.R.: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1), 57\u201377 (1985)","journal-title":"Discrete Appl. Math."},{"key":"36_CR13","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, STACS, Dortmund, Germany, pp. 57\u201368 (2011)"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading with vertex expansion. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, Portland, Oregon, USA, pp. 801\u2013815 (2014)","DOI":"10.1137\/1.9781611973402.59"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, Kyoto, Japan, 17\u201319 January 2012, pp. 1623\u20131641 (2012)","DOI":"10.1137\/1.9781611973099.129"},{"key":"36_CR16","volume-title":"Wright: An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1979","unstructured":"Hardy, G.H.: Wright: An Introduction to the Theory of Numbers. Oxford University Press, Oxford (1979)"},{"key":"36_CR17","unstructured":"Lugosi, G.: Concentration-of-Measure Inequalities. Lecture notes (2009)"},{"issue":"7","key":"36_CR18","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 54(7), 2997\u20133007 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"36_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1017\/S0963548314000194","volume":"24","author":"K Panagiotou","year":"2015","unstructured":"Panagiotou, K., P\u00e9rez-Gim\u00e9nez, X., Sauerwald, T., Sun, H.: Randomized rumour spreading: the effect of the network topology. Comb. Probab. Comput. 24(2), 457\u2013479 (2015)","journal-title":"Comb. Probab. Comput."},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Patsonakis, C., Roussopoulos, M.: Revisiting asynchronous rumor spreading in the blockchain era. In: Proceedings of the IEEE 25th International Conference on Parallel and Distributed Systems, ICPADS, pp. 284\u2013293 (2019)","DOI":"10.1109\/ICPADS47876.2019.00048"},{"issue":"1","key":"36_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B Pittel","year":"1987","unstructured":"Pittel, B.: On spreading a rumor. SIAM J. Appl. Math. 47(1), 213\u2013223 (1987)","journal-title":"SIAM J. Appl. Math."},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Sauerwald, T., Stauffer, A.: Rumor spreading and vertex expansion on regular graphs. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 462\u2013475 (2011)","DOI":"10.1137\/1.9781611973082.37"}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T01:51:45Z","timestamp":1669945905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}