{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T21:36:56Z","timestamp":1790458616915,"version":"4.1.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T00:00:00Z","timestamp":1467590400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00446-016-0277-8","type":"journal-article","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T10:55:37Z","timestamp":1467629737000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Determining majority in networks with local interactions and very small local memory"],"prefix":"10.1007","volume":"30","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sotiris E.","family":"Nikoletseas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoforos L.","family":"Raptopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,4]]},"reference":[{"key":"277_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gelashvili, R., Vojnovi\u0107, M.: Fast and exact majority in population protocols. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 47\u201356 (2009)","DOI":"10.1145\/2767386.2767429"},{"key":"277_CR2","doi-asserted-by":"crossref","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. Distrib. Comput. 18, 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"277_CR3","first-page":"183","volume":"21","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21(2), 183\u2013199 (2007)","journal-title":"Distrib. Comput."},{"issue":"2","key":"277_CR4","doi-asserted-by":"crossref","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. Distrib. Comput. 21(2), 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"277_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-89707-1_5","volume-title":"Middleware for Network Eccentric and Mobile Applications","author":"J Aspnes","year":"2009","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-Verlag, Berlin (2009)"},{"key":"277_CR6","doi-asserted-by":"crossref","unstructured":"B\u00e9n\u00e9zit, F., Thiran, P., Vetterli, M.: Interval consensus: from quantized gossip to voting. In: Proceedings of the International Conference on Acoustics, Speech and Signal Processing (ICASP), pp. 3361\u20133364 (2009)","DOI":"10.1109\/ICASSP.2009.4960420"},{"key":"277_CR7","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/978-3-540-88869-7_27","volume-title":"Algorithmic Bioprocesses, Natural Computing Series","author":"M Cook","year":"2009","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.) Algorithmic Bioprocesses, Natural Computing Series, pp. 543\u2013584. Springer, Berlin Heidelberg (2009)"},{"key":"277_CR8","doi-asserted-by":"crossref","unstructured":"De Marco, G., Pelc, A.: Randomized algorithms for determining the majority on graphs. Comb. Probab. Comput. 15(6), 823\u2013834 (2006)","DOI":"10.1017\/S0963548306007644"},{"issue":"345","key":"277_CR9","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1080\/01621459.1974.10480137","volume":"69","author":"MH DeGroot","year":"1974","unstructured":"DeGroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118\u2013121 (1974)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"277_CR10","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/110823018","volume":"50","author":"M Draief","year":"2012","unstructured":"Draief, M., Vojnovi\u0107, M.: Convergence speed of binary interval consensus. SIAM J. Control Optim. 50(3), 1087\u20131109 (2012)","journal-title":"SIAM J. Control Optim."},{"key":"277_CR11","doi-asserted-by":"crossref","unstructured":"Fischer, M., Jiang, H.: Self-stabilizing leader election in networks of finite-state anonymous agents. In: Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS) (2006)","DOI":"10.1007\/11945529_28"},{"key":"277_CR12","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1214\/aop\/1176996306","volume":"3","author":"RA Holley","year":"1975","unstructured":"Holley, R.A., Liggett, T.M.: Ergodic theorems for weakly interacting infinite systems and the voter model. Ann. Probab. 3, 643\u2013663 (1975)","journal-title":"Ann. Probab."},{"key":"277_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17364-6","volume-title":"Extremal Combinatorics with Applications to Computer Science","author":"S Jukna","year":"2011","unstructured":"Jukna, S.: Extremal Combinatorics with Applications to Computer Science. Springer-Verlag, Berlin (2011)"},{"key":"277_CR14","doi-asserted-by":"crossref","unstructured":"Kearns, M., Tan, J.: Biased voting and the democratic primary problem. In: Proceedings of the 4th International Workshop on Internet and Network Economics (WINE), pp. 639\u2013652 (2008)","DOI":"10.1007\/978-3-540-92185-1_70"},{"key":"277_CR15","doi-asserted-by":"publisher","unstructured":"Kurtz, T.G.: Approximation of population processes. In: CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (1981). doi: 10.1137\/1.9781611970333","DOI":"10.1137\/1.9781611970333"},{"issue":"3","key":"277_CR16","doi-asserted-by":"crossref","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. Progr. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"277_CR17","volume-title":"Interacting Particle Systems","author":"TM Liggett","year":"2004","unstructured":"Liggett, T.M.: Interacting Particle Systems. Springer-Verlag, Berlin (2004)"},{"key":"277_CR18","doi-asserted-by":"crossref","unstructured":"Merzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. In: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming, vol.\u00a01, pp. 871\u2013882 (2014)","DOI":"10.1007\/978-3-662-43948-7_72"},{"key":"277_CR19","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":"277_CR20","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1017\/S0305004100033193","volume":"54","author":"PAP Moran","year":"1958","unstructured":"Moran, P.A.P.: Random processes in genetics. Math. Proc. Camb. Philos. Soc. 54(1), 60\u201371 (1958)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"3","key":"277_CR21","doi-asserted-by":"crossref","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. Auton. Agents Multi-Agent Syst. 28(3), 408\u2013429 (2014)","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"277_CR22","volume-title":"Markov Chains","author":"J Norris","year":"1998","unstructured":"Norris, J.: Markov Chains. Cambridge University Press, Cambridge (1998)"},{"key":"277_CR23","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvjghw98","volume-title":"Evolutionary Dynamics: Exploring the Equations of Life","author":"MA Nowak","year":"2006","unstructured":"Nowak, M.A.: Evolutionary Dynamics: Exploring the Equations of Life. Belknap Press, Cambridge (2006)"},{"key":"277_CR24","doi-asserted-by":"crossref","unstructured":"Perron, E., Vasudevan, D., Vojnovi\u0107, M.: Using three states for binary consensus on complete graphs. In: Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 2527\u20132535 (2009)","DOI":"10.1109\/INFCOM.2009.5062181"},{"key":"277_CR25","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","volume":"16","author":"FP Preparata","year":"1967","unstructured":"Preparata, F.P., Metze, G., Chien, R.T.: On the connection assignment problem of diagnosable systems. IEEE Trans. Electron. Comput. 16, 848\u2013854 (1967)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"277_CR26","volume-title":"Stochastic Processes","author":"SR Ross","year":"1995","unstructured":"Ross, S.R.: Stochastic Processes. Wiley, Hoboken (1995)"},{"issue":"4","key":"277_CR27","doi-asserted-by":"crossref","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 11(4), 383\u2013387 (1991)","journal-title":"Combinatorica"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0277-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0277-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0277-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0277-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:46:19Z","timestamp":1748994379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0277-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,4]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["277"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0277-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,4]]}}}