{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T11:49:45Z","timestamp":1759664985035,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933117","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"185-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["How Asynchrony Affects Rumor Spreading Time"],"prefix":"10.1145","author":[{"given":"George","family":"Giakkoupis","sequence":"first","affiliation":[{"name":"INRIA, Rennes, France"}]},{"given":"Yasamin","family":"Nazari","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, Canada"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, Canada"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767416"},{"issue":"1","key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Flooding in weighted sparse random graphs","volume":"27","author":"Amini H.","year":"2013","unstructured":"H. Amini , M. Draief , and M. Lelarge . Flooding in weighted sparse random graphs . SIAMDM , 27 ( 1 ): 1 -- 26 , 2013 . H. Amini, M. Draief, and M. Lelarge. Flooding in weighted sparse random graphs. SIAMDM, 27(1):1--26, 2013.","journal-title":"SIAMDM"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662034.015"},{"issue":"6","key":"e_1_3_2_1_4_1","first-page":"2508","article-title":"Randomized gossip algorithms","volume":"52","author":"Boyd S. P.","year":"2006","unstructured":"S. P. Boyd , A. Ghosh , B. Prabhakar , and D. Shah . Randomized gossip algorithms . IEEEToIT , 52 ( 6 ): 2508 -- 2530 , 2006 . S. P. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEEToIT, 52(6):2508--2530, 2006.","journal-title":"IEEEToIT"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133071"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806745"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993640"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31155-0_27"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34862-4_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963190.2025379"},{"key":"e_1_3_2_1_12_1","first-page":"163","volume-title":"STACS","author":"Sauerwald R.","year":"2007","unstructured":"R. Els\"asser and T. Sauerwald . Broadcasting vs. mixing and information dissemination on Cayley graphs . In STACS , pp. 163 -- 174 , 2007 . R. Els\"asser and T. Sauerwald. Broadcasting vs. mixing and information dissemination on Cayley graphs. In STACS, pp. 163--174, 2007."},{"issue":"4","key":"e_1_3_2_1_13_1","first-page":"447","article-title":"Randomized broadcast in networks","volume":"1","author":"Feige U.","year":"1990","unstructured":"U. Feige , D. Peleg , P. Raghavan , and E. Upfal . Randomized broadcast in networks . RSA , 1 ( 4 ): 447 -- 460 , 1990 . U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. RSA, 1(4):447--460, 1990.","journal-title":"RSA"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005440"},{"key":"e_1_3_2_1_15_1","first-page":"560","volume-title":"RANDOM","author":"Fountoulakis N.","year":"2010","unstructured":"N. Fountoulakis and K. Panagiotou . Rumor spreading on random regular graphs and expanders . In RANDOM , pp. 560 -- 573 , 2010 . N. Fountoulakis and K. Panagiotou. Rumor spreading on random regular graphs and expanders. In RANDOM, pp. 560--573, 2010."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095246"},{"key":"e_1_3_2_1_17_1","first-page":"57","volume-title":"STACS","author":"Giakkoupis G.","year":"2011","unstructured":"G. Giakkoupis . Tight bounds for rumor spreading in graphs of a given conductance . In STACS , pp. 57 -- 68 , 2011 . G. Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In STACS, pp. 57--68, 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634133"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095245"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399003892"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_23_1","first-page":"424","volume-title":"ISAAC","author":"Panagiotou K.","year":"2013","unstructured":"K. Panagiotou and L. Speidel . Asynchronous rumor spreading on random graphs . In ISAAC , pp. 424 -- 434 , 2013 . K. Panagiotou and L. Speidel. Asynchronous rumor spreading on random graphs. In ISAAC, pp. 424--434, 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1712671.1712676"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133073"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1659232.1659238"}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933117","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":26,"alternative-id":["10.1145\/2933057.2933117","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933117","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}