{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T00:23:03Z","timestamp":1775175783348,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"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":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["27613"],"award-info":[{"award-number":["27613"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087817","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"335-344","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Ignore or Comply?"],"prefix":"10.1145","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Clementi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Roma Tor Vergata, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Mallmann-Trenn","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Natale","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Reversible markov chains and random walks on graphs","author":"Aldous D.","year":"2002","unstructured":"D. Aldous and J. Fill . Reversible markov chains and random walks on graphs , 2002 . Unpublished . http:\/\/www.stat.berkeley.edu\/aldous\/RWG\/book.html. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs, 2002. Unpublished. http:\/\/www.stat.berkeley.edu\/aldous\/RWG\/book.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612677"},{"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.1137\/1.9781611974331.ch46"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP)","author":"Berenbrink Petra","year":"2016","unstructured":"Petra Berenbrink , Tom Friedetzky , George Giakkoupis , and Peter Kling . Efficient plurality consensus, or: The benefits of cleaning up from time to time . In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP) , 2016 . to appear. Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling. Efficient plurality consensus, or: The benefits of cleaning up from time to time. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016. to appear."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990627"},{"key":"e_1_3_2_1_7_1","volume-title":"ICALP","author":"Berenbrink Petra","year":"2016","unstructured":"Petra Berenbrink , George Giakkoupis , Anne-Marie Kermarrec , and Frederik Mallmann-Trenn . Bounds on the voter model in dynamic networks . In ICALP , 2016 . Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, and Frederik Mallmann-Trenn. Bounds on the voter model in dynamic networks. In ICALP, 2016."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860684.1860700"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/120900368"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_37"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48653-5_17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989516"},{"key":"e_1_3_2_1_14_1","first-page":"630","volume-title":"Algorithms and Techniques (APPROX\/RANDOM 2014","volume":"28","author":"D\u00edaz Josep","year":"2014","unstructured":"Josep D\u00edaz , Leslie Ann Goldberg , David Richerby , and Maria Serna . Absorption Time of the Moran Process. In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques (APPROX\/RANDOM 2014 ), volume 28 , pages 630 -- 642 , 2014 . Josep D\u00edaz, Leslie Ann Goldberg, David Richerby, and Maria Serna. Absorption Time of the Moran Process. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014), volume 28, pages 630--642, 2014."},{"key":"e_1_3_2_1_15_1","volume-title":"Efficient k-party voting with two choices. CoRR, abs\/1602.04667","author":"Elsasser Robert","year":"2016","unstructured":"Robert Elsasser , Tom Friedetzky , Dominik Kaaser , Frederik Mallmann-Trenn , and Horst Trinker . Efficient k-party voting with two choices. CoRR, abs\/1602.04667 , 2016 . Robert Elsasser, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, and Horst Trinker. Efficient k-party voting with two choices. CoRR, abs\/1602.04667, 2016."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.2002.1066"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933097"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3088"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892324"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03204"},{"key":"e_1_3_2_1_22_1","volume-title":"Stochastic interacting systems: contact, voter and exclusion processes","author":"Liggett Thomas M","year":"2099","unstructured":"Thomas M Liggett . Stochastic interacting systems: contact, voter and exclusion processes . Springer , 2099 . Thomas M Liggett. Stochastic interacting systems: contact, voter and exclusion processes. Springer, 2099."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_54"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68276-1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep22506"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344007"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","location":"Washington DC USA","acronym":"PODC '17","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087817","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087817"}},"subtitle":["On Breaking Symmetry in Consensus"],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":29,"alternative-id":["10.1145\/3087801.3087817","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087817","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"}}]}}