{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:23:50Z","timestamp":1774599830984,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439500","type":"print"},{"value":"9783662439517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_37","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"435-446","source":"Crossref","is-referenced-by-count":29,"title":["The Power of Two Choices in Distributed Voting"],"prefix":"10.1007","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Abdullah, M., Draief, M.: Consensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs (2013), http:\/\/www.arXiv.org"},{"key":"37_CR2","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs, http:\/\/stat-www.berkeley.edu\/pub\/users\/aldous\/RWG\/book.html"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"N. Alon","year":"1989","unstructured":"Alon, N., Chung, F.R.K.: Explicit construction of linear sized tolerant networks. Discrete Math.\u00a072, 15\u201319 (1989)","journal-title":"Discrete Math."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A., Natale, E., Pasquale, F., Silvestri, R., Trevisan, L.: Simple Dynamics for Majority Consensus (2013), http:\/\/www.arXiv.org","DOI":"10.1145\/2612669.2612677"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-30555-2_4","volume-title":"Distributed Computing and Internet Technology","author":"S. Brahma","year":"2004","unstructured":"Brahma, S., Macharla, S., Pal, S.P., Singh, S.K.: Fair Leader Election by Randomized Voting. In: Ghosh, R.K., Mohanty, H. (eds.) ICDCIT 2004. LNCS, vol.\u00a03347, pp. 22\u201331. Springer, Heidelberg (2004)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Cooper, C., Els\u00e4sser, R., Ono, H., Radzik, T.: Coalescing Random Walks and Voting on Graphs. In: PODC 2012, pp. 47\u201356 (2012)","DOI":"10.1145\/2332432.2332440"},{"issue":"4","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1137\/120900368","volume":"27","author":"C. Cooper","year":"2013","unstructured":"Cooper, C., Els\u00e4sser, R., Ono, H., Radzik, T.: Coalescing Random Walks and Voting on Connected Graphs. SIAM J. on Discrete Math.\u00a027(4), 1748\u20131758 (2013)","journal-title":"SIAM J. on Discrete Math."},{"issue":"4","key":"37_CR8","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1137\/080729542","volume":"23","author":"C. Cooper","year":"2009","unstructured":"Cooper, C., Frieze, A., Radzik, B.: Multiple Random Walks in Random Regular Graphs. SIAM J. on Discrete Math.\u00a023(4), 1738\u20131761 (2009)","journal-title":"SIAM J. on Discrete Math."},{"key":"37_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1017\/S0963548301005090","volume":"11","author":"C. Cooper","year":"2002","unstructured":"Cooper, C., Frieze, A., Reed, B.: Random regular graphs of non-constant degree: connectivity and Hamilton cycles. Combinatorics Prob. & Comp.\u00a011, 249\u2013262 (2002)","journal-title":"Combinatorics Prob. & Comp."},{"key":"37_CR10","unstructured":"Cruise, J., Ganesh, A.: Probabilistic consensus via polling and majority rules. arXiv:1311.4805"},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X. Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.: On the Complexity of Cooperative Solution Concepts. Mathematics of Operations Research\u00a019(2), 257\u2013266 (1994)","journal-title":"Mathematics of Operations Research"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, L.A., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing Consensus with the Power of Two Choices. In: SPAA 2011, pp. 149\u2013158 (2011)","DOI":"10.1145\/1989493.1989516"},{"issue":"1","key":"37_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0305004100060989","volume":"94","author":"P. Donnelly","year":"1983","unstructured":"Donnelly, P., Welsh, D.: Finite particle systems and infection models. Math. Proc. Camb. Phil. Soc.\u00a094(1), 167\u2013182 (1983)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-642-15369-3_42","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N. Fountoulakis","year":"2010","unstructured":"Fountoulakis, N., Panagiotou, K.: Rumor Spreading on Random Regular Graphs and Expanders. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010. LNCS, vol.\u00a06302, pp. 560\u2013573. Springer, Heidelberg (2010)"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0095-8956(92)90070-E","volume":"54","author":"A. Frieze","year":"1992","unstructured":"Frieze, A., \u0141uczak, T.: On the independence and chromatik numbers of random graphs. J. Combinatorial Theory, Ser. B\u00a054, 123\u2013132 (1992)","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Friedman, J.: A proof of Alon\u2019s second eigenvalue conjecture. In: STOC 2003, pp. 720\u2013724 (2003)","DOI":"10.1145\/780642.780646"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Gifford, D.: Weighted Voting for Replicated Data. In: SOSP 1979, pp. 150\u2013162 (1979)","DOI":"10.1145\/800215.806583"},{"issue":"2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.2001.3088","volume":"171","author":"Y. Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Information & Computation\u00a0171(2), 248\u2013268 (2001)","journal-title":"Information & Computation"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Jerrum, M., Sinclair, A.: Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved. In: STOC 1988, pp. 235\u2013244 (1988)","DOI":"10.1145\/62212.62234"},{"key":"37_CR20","unstructured":"Johnson, B.: Design and Analysis of Fault Tolerant Digital Systems. Addison-Wesley (1989)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Mossel, E., Neeman, J., Tamuz, O.: Majority Dynamics and Aggregation of Information in Social Networks, arXiv:1207.0893 (2012)","DOI":"10.1007\/s10458-013-9230-4"},{"key":"37_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-48686-0_33","volume-title":"Computing and Combinatorics","author":"T. Nakata","year":"1999","unstructured":"Nakata, T., Imahayashi, H., Yamashita, M.: Probabilistic local majority voting for the agreement problem on finite graphs. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 330\u2013338. Springer, Heidelberg (1999)"},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1090\/S0002-9947-2011-05523-6","volume":"364","author":"R.I. Oliviera","year":"2012","unstructured":"Oliviera, R.I.: On the Coalescence Time of Reversible Random Walks. Trans. Amer. Math. Soc.\u00a0364, 2109\u20132128 (2012)","journal-title":"Trans. Amer. Math. Soc."},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Wormald, N.C.: Models of random regular graphs. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics, pp. 239\u2013298","DOI":"10.1017\/CBO9780511721335.010"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T17:46:38Z","timestamp":1649353598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}