{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:34Z","timestamp":1763468074424,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214064","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"961-970","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Global computation in a poorly connected world"],"prefix":"10.1145","author":[{"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Jonathan","family":"Kelner","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Petar","family":"Maymounkov","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536432"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133071"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806745"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873736"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400788"},{"key":"e_1_3_2_2_7_1","volume-title":"Asymptotically optimal randomized rumor spreading. CoRR, abs\/1011.1868","author":"Doerr B.","year":"2010","unstructured":"B. Doerr and M. Fouz . Asymptotically optimal randomized rumor spreading. CoRR, abs\/1011.1868 , 2010 . B. Doerr and M. Fouz. Asymptotically optimal randomized rumor spreading. CoRR, abs\/1011.1868, 2010."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993640"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347167"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_31"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.04.002"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/09075768X"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810505"},{"key":"e_1_3_2_2_14_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_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133072"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380796"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652161"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579141"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9271-x"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109666"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01364272"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146401"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_2_26_1","volume-title":"Graph spanners. Journal of graph theory, 13(1):99--116","author":"Peleg D.","year":"1989","unstructured":"D. Peleg and A. Schaffer . Graph spanners. Journal of graph theory, 13(1):99--116 , 1989 . D. Peleg and A. Schaffer. Graph spanners. Journal of graph theory, 13(1):99--116, 1989."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644022"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0091-7"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133073"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835760"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for random generation and counting: a Markov chain approach","author":"Sinclair A.","year":"1993","unstructured":"A. Sinclair . Algorithms for random generation and counting: a Markov chain approach . Birkhauser Verlag , Basel, Switzerland , Switzerland, 1993 . A. Sinclair. Algorithms for random generation and counting: a Markov chain approach. Birkhauser Verlag, Basel, Switzerland, Switzerland, 1993."},{"key":"e_1_3_2_2_32_1","volume-title":"Spectral sparsification of graphs. CoRR, abs\/0808.4134","author":"Spielman D. A.","year":"2008","unstructured":"D. A. Spielman and S.-H. Teng . Spectral sparsification of graphs. CoRR, abs\/0808.4134 , 2008 . D. A. Spielman and S.-H. Teng. Spectral sparsification of graphs. CoRR, abs\/0808.4134, 2008."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214064","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:56Z","timestamp":1750238456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214064"}},"subtitle":["fast rumor spreading with no dependence on conductance"],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":32,"alternative-id":["10.1145\/2213977.2214064","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214064","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}