{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:48Z","timestamp":1750219788711,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"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":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594582","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"278-281","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Discrete Incremental Voting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5264-4401","authenticated-orcid":false,"given":"Colin","family":"Cooper","sequence":"first","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7776-5461","authenticated-orcid":false,"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1236-9756","authenticated-orcid":false,"given":"Takeharu","family":"Shiraga","sequence":"additional","affiliation":[{"name":"Chuo University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.07.026"},{"key":"e_1_3_2_1_2_1","volume-title":"Reversible Markov chains and random walks on graphs. (2002). Unfinished monograph (recompiled version","author":"Aldous David","year":"2014","unstructured":"David Aldous and James Allen Fill. 2002. Reversible Markov chains and random walks on graphs. (2002). Unfinished monograph (recompiled version, 2014)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.27"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612677"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch46"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics","author":"Berenbrink Petra","year":"2018","unstructured":"Petra Berenbrink, George Giakkoupis, and Peter Kling. 2018. Tight bounds for coalescing-branching random walks on regular graphs. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia, PA, 1715--1733."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30555-2_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332440"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_37"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 31st International Symposium on Distributed Computing (DISC)","volume":"91","author":"Cooper Colin","year":"2017","unstructured":"Colin Cooper, Tomasz Radzik, Nicol\u00e1s Rivera, and Takeharu Shiraga. 2017. Fast plurality consensus in regular expanders. In Proceedings of the 31st International Symposium on Distributed Computing (DISC), Vol. 91. Springer Berlin Heidelberg, Berlin, Heidelberg, 13:1--13:16."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989516"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212738"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3088"},{"volume-title":"Design and analysis of fault tolerant digital systems","author":"Johnson Barry","key":"e_1_3_2_1_15_1","unstructured":"Barry Johnson. 1989. Design and analysis of fault tolerant digital systems. Addison-Wesley, Boston, MA, USA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323207"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48686-0_33"},{"key":"e_1_3_2_1_18_1","volume-title":"meeting, coalescing and returning. In Proceedings of the 16th Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics","author":"Oliveira Roberto Imbuzeiro","year":"2019","unstructured":"Roberto Imbuzeiro Oliveira and Yuval Peres. 2019. Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. In Proceedings of the 16th Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, Philadelphia, PA, 119--126."},{"key":"e_1_3_2_1_19_1","volume-title":"Phase transitions of Best-of-Two and Best-of-Three on stochastic block models. Random Structures and algorithms 59, 1","author":"Shimizu Nobutaka","year":"2021","unstructured":"Nobutaka Shimizu and Takeharu Shiraga. 2021. Phase transitions of Best-of-Two and Best-of-Three on stochastic block models. Random Structures and algorithms 59, 1 (2021), 96--140."}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"PODC '23"},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594582","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":18,"alternative-id":["10.1145\/3583668.3594582","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594582","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}