{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:34Z","timestamp":1763468194778},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_72","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"871-882","source":"Crossref","is-referenced-by-count":30,"title":["Determining Majority in Networks with Local Interactions and Very Small Local Memory"],"prefix":"10.1007","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[]},{"given":"Sotiris E.","family":"Nikoletseas","sequence":"additional","affiliation":[]},{"given":"Christoforos L.","family":"Raptopoulos","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"72_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018, 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"issue":"2","key":"72_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distributed Computing\u00a021(2), 87\u2013102 (2008)","journal-title":"Distributed Computing"},{"key":"72_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Garbinato, B., Miranda, H., Rodrigues, L. (eds.) Middleware for Network Eccentric and Mobile Applications, pp. 97\u2013120. Springer (2009)","DOI":"10.1007\/978-3-540-89707-1_5"},{"key":"72_CR4","doi-asserted-by":"crossref","unstructured":"Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks. In: Condon, A., Harel, D., Kok, J.N., Salomaa, A., Winfree, E. (eds.) Algor. Bioprocesses. Nat. Comp. Series, pp. 543\u2013584. Springer (2009)","DOI":"10.1007\/978-3-540-88869-7_27"},{"issue":"6","key":"72_CR5","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1017\/S0963548306007644","volume":"15","author":"G. Marco De","year":"2006","unstructured":"De Marco, G., Pelc, A.: Randomized algorithms for determining the majority on graphs. Combinatorics, Probability and Computing\u00a015(6), 823\u2013834 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"345","key":"72_CR6","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1080\/01621459.1974.10480137","volume":"69","author":"M.H. DeGroot","year":"1974","unstructured":"DeGroot, M.H.: Reaching a consensus. Journal of the American Statistical Association\u00a069(345), 118\u2013121 (1974)","journal-title":"Journal of the American Statistical Association"},{"key":"72_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11945529_28","volume-title":"Principles of Distributed Systems","author":"M. Fischer","year":"2006","unstructured":"Fischer, M., Jiang, H.: Self-stabilizing leader election in networks of finite-state anonymous agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 395\u2013409. Springer, Heidelberg (2006)"},{"key":"72_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1214\/aop\/1176996306","volume":"3","author":"R.A. Holley","year":"1975","unstructured":"Holley, R.A., Liggett, T.M.: Ergodic theorems for weakly interacting infinite systems and the voter model. The Annals of Probability\u00a03, 643\u2013663 (1975)","journal-title":"The Annals of Probability"},{"key":"72_CR9","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Extremal Combinatorics with Applications to Computer Science. Springer (2011)","DOI":"10.1007\/978-3-642-17364-6"},{"key":"72_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/978-3-540-92185-1_70","volume-title":"Internet and Network Economics","author":"M. Kearns","year":"2008","unstructured":"Kearns, M., Tan, J.: Biased voting and the democratic primary problem. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 639\u2013652. Springer, Heidelberg (2008)"},{"key":"72_CR11","unstructured":"Kurtz, T.G.: Approximation of Population Processes. Society for Industrial and Applied Mathematics (1987)"},{"issue":"3","key":"72_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"72_CR13","doi-asserted-by":"crossref","unstructured":"Liggett, T.M.: Interacting Particle Systems. Springer (2004)","DOI":"10.1007\/b138374"},{"key":"72_CR14","unstructured":"Mizrachi, A.: Majority vote and monopolies in social networks. Master\u2019s thesis, Department of Communication Systems Engineering, Faculty of Engineering, Ben-Gurion University of the Negev (2013)"},{"issue":"1","key":"72_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/S0305004100033193","volume":"54","author":"P.A.P. Moran","year":"1958","unstructured":"Moran, P.A.P.: Random processes in genetics. Mathematical Proceedings of the Cambridge Philosophical Society\u00a054(1), 60\u201371 (1958)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"3","key":"72_CR16","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/s10458-013-9230-4","volume":"28","author":"E. Mossel","year":"2014","unstructured":"Mossel, E., Neeman, J., Tamuz, O.: Majority dynamics and aggregation of information in social networks. Autonomous Agents and Multi-Agent Systems\u00a028(3), 408\u2013429 (2014)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"72_CR17","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"F.P. Preparata","year":"1967","unstructured":"Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Trans. on Electr. Computers\u00a016, 848\u2013854 (1967)","journal-title":"IEEE Trans. on Electr. Computers"},{"issue":"4","key":"72_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01275672","volume":"11","author":"M. Saks","year":"1991","unstructured":"Saks, M., Werman, M.: On computing majority by comparisons. Combinatorica\u00a011(4), 383\u2013387 (1991)","journal-title":"Combinatorica"}],"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-43948-7_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:06:40Z","timestamp":1558908400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}