{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:02Z","timestamp":1750306082748,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M005038\/1"],"award-info":[{"award-number":["EP\/M005038\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087564","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"305-312","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs"],"prefix":"10.1145","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s","family":"Rivera","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548311000125"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73059"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/080729542"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933119"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486197"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2817830"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_35"},{"key":"e_1_3_2_1_8_1","first-page":"313","volume-title":"Proceedings of the Twenty-eight Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '16","author":"Rajaraman R.","year":"2016","unstructured":". Mitzenmacher, R. Rajaraman , S. Roche . Better bounds for coalescing-branching random walks . In Proceedings of the Twenty-eight Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '16 , pages 313 -- 323 , 2016 .(see also http:\/\/arxiv.org\/abs\/1603.06109) . Mitzenmacher, R. Rajaraman, S. Roche. Better bounds for coalescing-branching random walks. In Proceedings of the Twenty-eight Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '16, pages 313--323, 2016.(see also http:\/\/arxiv.org\/abs\/1603.06109)"},{"key":"e_1_3_2_1_9_1","first-page":"121","volume-title":"March","volume":"7","author":"Spencer J.","year":"1987","unstructured":". Shamir and J. Spencer . Sharp concentration of the chromatic number on random graphs $G_n, p$. Combinatorica , March 1987 , Volume 7 , Issue 1 , pp 121 -- 129 . . Shamir and J. Spencer.Sharp concentration of the chromatic number on random graphs $G_n, p$. Combinatorica,March 1987, Volume 7, Issue 1, pp 121--129."}],"event":{"name":"SPAA '17: 29th 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","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:13Z","timestamp":1750217413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":9,"alternative-id":["10.1145\/3087556.3087564","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087564","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}