{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:39Z","timestamp":1763468199570,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"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":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612677","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"247-256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Simple dynamics for plurality consensus"],"prefix":"10.1145","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[{"name":"\"Sapienza\" Universit\u00e0 di Roma, Rome, Italy"}]},{"given":"Andrea","family":"Clementi","sequence":"additional","affiliation":[{"name":"Universit\u00e0, Rome, Italy"}]},{"given":"Emanuele","family":"Natale","sequence":"additional","affiliation":[{"name":"\"Sapienza\" Universit\u00e0 di Roma, Rome, Italy"}]},{"given":"Francesco","family":"Pasquale","sequence":"additional","affiliation":[{"name":"\"Sapienza\" Universit\u00e0 di Roma, Rome, Italy"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[{"name":"\"Sapienza\" Universit\u00e0 di Roma, Rome, Italy"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Majority consensus on random graphs of a given degree sequence. arXiv:1209.5025","author":"Abdullah M. A.","year":"2012","unstructured":"M. A. Abdullah and M. Draief . Majority consensus on random graphs of a given degree sequence. arXiv:1209.5025 , 2012 . M. A. Abdullah and M. Draief. Majority consensus on random graphs of a given degree sequence. arXiv:1209.5025, 2012."},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","first-page":"20","volume-title":"Proc. of 21st DISC","author":"Angluin D.","year":"2007","unstructured":"D. Angluin , J. Aspnes , and D. Eisenstat . A simple population protocol for fast robust approximate majority . In Proc. of 21st DISC , volume 4731 of LNCS , pages 20 -- 32 . Springer , 2007 . D. Angluin, J. Aspnes, and D. Eisenstat. A simple population protocol for fast robust approximate majority. In Proc. of 21st DISC, volume 4731 of LNCS, pages 20--32. Springer, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4594-3_28"},{"key":"e_1_3_2_1_4_1","volume-title":"Simple dynamics for plurality consensus. arXiv:1310.2858","author":"Becchetti L.","year":"2013","unstructured":"L. Becchetti , A. Clementi , E. Natale , F. Pasquale , R. Silvestri , and L. Trevisan . Simple dynamics for plurality consensus. arXiv:1310.2858 , 2013 . L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri, and L. Trevisan. Simple dynamics for plurality consensus. arXiv:1310.2858, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960420"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03578-9_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989516"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/110823018"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1568639"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_70"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.74.5148"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/058"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-013-9230-4"},{"key":"e_1_3_2_1_15_1","first-page":"214","volume-title":"Proc. of ICS","author":"Mossel E.","year":"2010","unstructured":"E. Mossel and G. Schoenebeck . Reaching consensus on socia networks . In Proc. of ICS , pages 214 -- 229 . Tsinghua University Press , 2010 . E. Mossel and G. Schoenebeck. Reaching consensus on socia networks. In Proc. of ICS, pages 214--229. Tsinghua University Press, 2010."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00055-X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062181"}],"event":{"name":"SPAA '14: 26th 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":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612677","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":17,"alternative-id":["10.1145\/2612669.2612677","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612677","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}