{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T11:52:11Z","timestamp":1759665131664,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council Discovery Project","award":["DP170102794"],"award-info":[{"award-number":["DP170102794"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405720","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"263-272","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks"],"prefix":"10.1145","author":[{"given":"Ali","family":"Pourmiri","sequence":"first","affiliation":[{"name":"Macquarie University, Sydney, Australia"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[{"name":"Macquarie University, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767416"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20752"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582757"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400773"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2006.874516"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3173043"},{"key":"e_1_3_2_1_7_1","first-page":"325","volume-title":"Sophia Antipolis","author":"Clementi Andrea E. F.","year":"2013","unstructured":"Andrea E. F. Clementi , Pierluigi Crescenzi , Carola Doerr , Pierre Fraigniaud , Marco Isopi , Alessandro Panconesi , Francesco Pasquale , and Riccardo Silvestri . Rumor spreading in random evolving graphs. In Algorithms - ESA 2013 - 21st Annual European Symposium , Sophia Antipolis , France , September 2-4, 2013 . Proceedings, pages 325 -- 336 , 2013. Andrea E. F. Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, and Riccardo Silvestri. Rumor spreading in random evolving graphs. In Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 325--336, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.33"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332439"},{"key":"e_1_3_2_1_10_1","volume-title":"An introduction to the theory of point processes","author":"Daley D. J.","year":"2003","unstructured":"D. J. Daley and D. Vere-Jones . An introduction to the theory of point processes . Vol. I . Probability and its Applications (New York). Springer-Verlag , New York, second edition, 2003 . Elementary theory and methods. D. J. Daley and D. Vere-Jones. An introduction to the theory of point processes. Vol. I. Probability and its Applications (New York). Springer-Verlag, New York, second edition, 2003. Elementary theory and methods."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993640"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010406"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15369-3_42"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933117"},{"key":"e_1_3_2_1_16_1","first-page":"495","volume-title":"41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II","author":"Giakkoupis George","year":"2014","unstructured":"George Giakkoupis , Thomas Sauerwald , and Alexandre Stauffer . Randomized rumor spreading in dynamic graphs. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II , pages 495 -- 507 , 2014 . George Giakkoupis, Thomas Sauerwald, and Alexandre Stauffer. Randomized rumor spreading in dynamic graphs. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, pages 495--507, 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_18_1","first-page":"565","volume-title":"Berthold V\u00f6cking. Randomized Rumor Spreading. In Proc. 41st Symp. Foundations of Computer Science (FOCS)","author":"Karp Richard M.","year":"2000","unstructured":"Richard M. Karp , Christian Schindelhauer , Scott Shenker , and Berthold V\u00f6cking. Randomized Rumor Spreading. In Proc. 41st Symp. Foundations of Computer Science (FOCS) , pages 565 -- 574 , 2000 . Richard M. Karp, Christian Schindelhauer, Scott Shenker, and Berthold V\u00f6cking. Randomized Rumor Spreading. In Proc. 41st Symp. Foundations of Computer Science (FOCS), pages 565--574, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.128"},{"key":"e_1_3_2_1_20_1","first-page":"424","volume-title":"ISAAC 2013, Hong Kong, China, December 16-18, 2013","author":"Panagiotou Konstantinos","year":"2013","unstructured":"Konstantinos Panagiotou and Leo Speidel . Asynchronous rumor spreading on random graphs. In Algorithms and Computation - 24th International Symposium , ISAAC 2013, Hong Kong, China, December 16-18, 2013 , Proceedings , pages 424 -- 434 , 2013 . Konstantinos Panagiotou and Leo Speidel. Asynchronous rumor spreading on random graphs. In Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings, pages 424--434, 2013."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993882"},{"key":"e_1_3_2_1_22_1","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"1","volume-title":"46th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Sauerwald Thomas","year":"2019","unstructured":"Thomas Sauerwald and Luca Zanetti . Random Walks on Dynamic Graphs: Mixing Times , Hitting Times, and Return Probabilities. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019 ), volume 132 of Leibniz International Proceedings in Informatics (LIPIcs) , pages 93: 1 -- 93 :15, Dagstuhl, Germany , 2019. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik . Thomas Sauerwald and Luca Zanetti. Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), volume 132 of Leibniz International Proceedings in Informatics (LIPIcs), pages 93:1--93:15, Dagstuhl, Germany, 2019. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."}],"event":{"name":"PODC '20: 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":"Virtual Event Italy","acronym":"PODC '20"},"container-title":["Proceedings of the 39th Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:50Z","timestamp":1750197770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":22,"alternative-id":["10.1145\/3382734.3405720","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405720","relation":{},"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2020-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}