{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:02Z","timestamp":1750307402124,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1810479.1810505","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"134-143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["On the bit communication complexity of randomized rumor spreading"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Giakkoupis","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400773"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_5_1","first-page":"773","volume-title":"Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Doerr B.","year":"2008","unstructured":"B. Doerr , T. Friedrich , and T. Sauerwald . Quasirandom rumor spreading . In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 773 -- 781 , 2008 . B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 773--781, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_31"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199809)13:2%3C99::AID-RSA1%3E3.0.CO;2-M"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_26"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148135"},{"key":"e_1_3_2_1_10_1","first-page":"218","volume-title":"Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Els\u00e4sser R.","year":"2008","unstructured":"R. Els\u00e4sser and T. Sauerwald . The power of memory in randomized broadcasting . In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 218 -- 227 , 2008 . R. Els\u00e4sser and T. Sauerwald. The power of memory in randomized broadcasting. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 218--227, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010406"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"e_1_3_2_1_15_1","first-page":"125","volume-title":"Combinatorial Network Theory","author":"Hromkovic J.","year":"1995","unstructured":"J. Hromkovic , R. Klasing , B. Monien , and R. Piene . Dissemination of information in interconnection networks (broadcasting & gossiping) . In Combinatorial Network Theory , pages 125 -- 212 . Springer , 1995 . J. Hromkovic, R. Klasing, B. Monien, and R. Piene. Dissemination of information in interconnection networks (broadcasting & gossiping). In Combinatorial Network Theory, pages 125--212. Springer, 1995."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"},{"key":"e_1_3_2_1_18_1","volume-title":"Introduction to Coding Theory","author":"van Lint J. H.","year":"1998","unstructured":"J. H. van Lint . Introduction to Coding Theory . Springer Verlag , 3 rd edition, 1998 . J. H. van Lint. Introduction to Coding Theory. Springer Verlag, 3rd edition, 1998.","edition":"3"}],"event":{"name":"SPAA 10: 22nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Thira Santorini Greece","acronym":"SPAA 10"},"container-title":["Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810479.1810505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:24Z","timestamp":1750246764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810479.1810505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":18,"alternative-id":["10.1145\/1810479.1810505","10.1145\/1810479"],"URL":"https:\/\/doi.org\/10.1145\/1810479.1810505","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}