{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:33Z","timestamp":1763468193522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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":[[2014,7,15]]},"DOI":"10.1145\/2611462.2611489","type":"proceedings-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T12:20:56Z","timestamp":1405426856000},"page":"176-185","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimal gossip with direct addressing"],"prefix":"10.1145","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214064"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133071"},{"key":"e_1_3_2_1_4_1","first-page":"57","volume-title":"28th International Symposium on Theoretical Aspects of Computer Science (STACS)","author":"Giakkoupis G.","year":"2011","unstructured":"G. Giakkoupis . Tight bounds for rumor spreading in graphs of a given conductance . In 28th International Symposium on Theoretical Aspects of Computer Science (STACS) , pages 57 -- 68 , Dagstuhl, Germany , 2011 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. G. Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 57--68, Dagstuhl, Germany, 2011. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095245"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627868"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312031"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1084-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"}],"event":{"name":"PODC '14: 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":"Paris France","acronym":"PODC '14"},"container-title":["Proceedings of the 2014 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2611462.2611489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:05Z","timestamp":1750229765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":12,"alternative-id":["10.1145\/2611462.2611489","10.1145\/2611462"],"URL":"https:\/\/doi.org\/10.1145\/2611462.2611489","relation":{},"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"2014-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}