{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:58Z","timestamp":1750306078715,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education (MOE) Singapore","award":["MOE2014-T2-1-157"],"award-info":[{"award-number":["MOE2014-T2-1-157"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087846","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"255-257","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Seth","family":"Gilbert","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suman","family":"Sourav","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1255378.1255381"},{"volume-title":"Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance (STOC '12). ACM","author":"Censor-Hillel K.","key":"e_1_3_2_1_2_1","unstructured":"K. Censor-Hillel , B. Haeupler , J. Kelner , and P. Maymounkov . Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance (STOC '12). ACM , NY , USA , 961--970. x978--1--4503--1245--5 K. Censor-Hillel, B. Haeupler, J. Kelner, and P. Maymounkov.Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance (STOC '12). ACM, NY, USA, 961--970. x978--1--4503--1245--5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"K. Censor-Hillel and H. Shachnai. 2011.Fast Information Spreading in Graphs with Large Weak Conductance (SODA '11). SIAM 440--448.  K. Censor-Hillel and H. Shachnai. 2011.Fast Information Spreading in Graphs with Large Weak Conductance (SODA '11). SIAM 440--448.","DOI":"10.1137\/1.9781611973082.35"},{"key":"e_1_3_2_1_4_1","unstructured":"F. Chierichetti S. Lattanzi and A. Panconesi. 2010a.Almost Tight Bounds for Rumour Spreading with Conductance (STOC '10). ACM NY USA 399--408. x978--1--4503-0050--6  F. Chierichetti S. Lattanzi and A. Panconesi. 2010a.Almost Tight Bounds for Rumour Spreading with Conductance (STOC '10). ACM NY USA 399--408. x978--1--4503-0050--6"},{"key":"e_1_3_2_1_5_1","unstructured":"F. Chierichetti S. Lattanzi and A. Panconesi. 2010b.Rumour Spreading and Graph Conductance (SODA '10). SIAM PA USA 1657--1663. x978-0--898716--98--6  F. Chierichetti S. Lattanzi and A. Panconesi. 2010b.Rumour Spreading and Graph Conductance (SODA '10). SIAM PA USA 1657--1663. x978-0--898716--98--6"},{"key":"#cr-split#-e_1_3_2_1_6_1.1","doi-asserted-by":"crossref","unstructured":"A. Demers D. Greene C. Hauser W. Irish J. Larson S. Shenker H. Sturgis D. Swinehart and D. Terry. 1987.Epidemic Algorithms for Replicated Database Maintenance (PODC '87). ACM 1--12. x0--89791--239-X https:\/\/doi.org\/10.1145\/41840.41841 10.1145\/41840.41841","DOI":"10.1145\/41840.41841"},{"key":"#cr-split#-e_1_3_2_1_6_1.2","doi-asserted-by":"crossref","unstructured":"A. Demers D. Greene C. Hauser W. Irish J. Larson S. Shenker H. Sturgis D. Swinehart and D. Terry. 1987.Epidemic Algorithms for Replicated Database Maintenance (PODC '87). ACM 1--12. x0--89791--239-X https:\/\/doi.org\/10.1145\/41840.41841","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010406"},{"key":"e_1_3_2_1_8_1","unstructured":"G. Giakkoupis. 2011.Tight bounds for rumor spreading in graphs of a given conductance (STACS '11). 57--68.  G. Giakkoupis. 2011.Tight bounds for rumor spreading in graphs of a given conductance (STACS '11). 57--68."},{"key":"e_1_3_2_1_9_1","unstructured":"S. Gilbert P. Robinson and S. Sourav. 2016.Gossiping with Latencies. CoRR abs\/1611.06343 (2016). http:\/\/arxiv.org\/abs\/1611.06343  S. Gilbert P. Robinson and S. Sourav. 2016.Gossiping with Latencies. CoRR abs\/1611.06343 (2016). http:\/\/arxiv.org\/abs\/1611.06343"},{"key":"e_1_3_2_1_10_1","volume-title":"Fast and Deterministic Gossip and Rumor Spreading (SODA '13)","author":"Haeupler B.","year":"1972","unstructured":"B. Haeupler . 2013.Simple , Fast and Deterministic Gossip and Rumor Spreading (SODA '13) . SIAM , 705--716. x978--1--61 1972 --51--1 B. Haeupler. 2013.Simple, Fast and Deterministic Gossip and Rumor Spreading (SODA '13). SIAM, 705--716. x978--1--611972--51--1"},{"key":"e_1_3_2_1_11_1","unstructured":"M. Jerrum and A. Sinclair.Conductance and the Rapid Mixing Property for Markov Chains: The Approximation of Permanent Resolved (STOC '88). x0--89791--264-0  M. Jerrum and A. Sinclair.Conductance and the Rapid Mixing Property for Markov Chains: The Approximation of Permanent Resolved (STOC '88). x0--89791--264-0"},{"key":"e_1_3_2_1_12_1","unstructured":"R. Karp C. Schindelhauer S. Shenker and B. Vocking. 2000.Randomized rumor spreading (FOCS '00). 565--574.  R. Karp C. Schindelhauer S. Shenker and B. Vocking. 2000.Randomized rumor spreading (FOCS '00). 565--574."},{"key":"e_1_3_2_1_13_1","unstructured":"D. Kempe J. Kleinberg and A. Demers. 2001.Spatial Gossip and Resource Location Protocols (STOC '01). ACM NY USA 163--172. x1--58113--349--9  D. Kempe J. Kleinberg and A. Demers. 2001.Spatial Gossip and Resource Location Protocols (STOC '01). ACM NY USA 163--172. x1--58113--349--9"},{"key":"#cr-split#-e_1_3_2_1_14_1.1","doi-asserted-by":"crossref","unstructured":"D. Mosk-Aoyama and D. Shah. 2006.Computing Separable Functions via Gossip (PODC '06). ACM NY USA 113--122. x1--59593--384-0 https:\/\/doi.org\/10.1145\/1146381.1146401 10.1145\/1146381.1146401","DOI":"10.1145\/1146381.1146401"},{"key":"#cr-split#-e_1_3_2_1_14_1.2","doi-asserted-by":"crossref","unstructured":"D. Mosk-Aoyama and D. Shah. 2006.Computing Separable Functions via Gossip (PODC '06). ACM NY USA 113--122. x1--59593--384-0 https:\/\/doi.org\/10.1145\/1146381.1146401","DOI":"10.1145\/1146381.1146401"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"C. Newport.Radio Network Lower Bounds Made Easy (DISC '14). 258--272.  C. Newport.Radio Network Lower Bounds Made Easy (DISC '14). 258--272.","DOI":"10.1007\/978-3-662-45174-8_18"}],"event":{"name":"PODC '17: 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":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087846","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:07Z","timestamp":1750217407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087846"}},"subtitle":["Gossiping with Latencies"],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":17,"alternative-id":["10.1145\/3087801.3087846","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087846","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}