{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:26Z","timestamp":1740109286415,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T00:00:00Z","timestamp":1509062400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"EU IP FET-Proactive","award":["17532"],"award-info":[{"award-number":["17532"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00446-017-0317-z","type":"journal-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T09:58:04Z","timestamp":1509098284000},"page":"455-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How many cooks spoil the soup?"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6234-3960","authenticated-orcid":false,"given":"Othon","family":"Michail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,27]]},"reference":[{"issue":"4","key":"317_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM (JACM) 40(4), 873\u2013890 (1993)","journal-title":"J. ACM (JACM)"},{"key":"317_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: 23rd annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 290\u2013299. ACM (2004)","DOI":"10.1145\/1011767.1011810"},{"issue":"4","key":"317_CR3","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(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"3","key":"317_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21(3), 183\u2013199 (2008)","journal-title":"Distrib. Comput."},{"issue":"4","key":"317_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007)","journal-title":"Distrib. Comput."},{"key":"317_CR6","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gelashvili, R.: Polylogarithmic-time leader election in population protocols. In: 42nd International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 9135, pp. 479\u2013491. Springer (2015)","DOI":"10.1007\/978-3-662-47666-6_38"},{"key":"317_CR7","unstructured":"Amaxilatis, D., Logaras, M., Michail, O., Spirakis, P.G.: NETCS: A new simulator of population protocols and network constructors. arXiv preprint arXiv:1508.06731 (2015)"},{"key":"317_CR8","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC), pp. 82\u201393. ACM (1980)","DOI":"10.1145\/800141.804655"},{"key":"317_CR9","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 (2009)","DOI":"10.1007\/978-3-540-89707-1_5"},{"key":"317_CR10","doi-asserted-by":"crossref","unstructured":"Aspnes, J.: Clocked population protocols. In: 36th ACM Symposium on Principles of Distributed Computing (PODC), pp. 431\u2013440. ACM (2017)","DOI":"10.1145\/3087801.3087836"},{"key":"317_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, vol. 19. Wiley, Hoboken (2004)"},{"key":"317_CR12","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Cummings, R., Doty, D., Soloveichik, D.: Speed faults in computation by chemical reaction networks. In: Proceedings of the 28th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 8784, pp. 16\u201330 (2014) (also in Distributed Computing)","DOI":"10.1007\/978-3-662-45174-8_2"},{"issue":"4","key":"317_CR13","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s11047-013-9393-6","volume":"13","author":"H-L Chen","year":"2014","unstructured":"Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. Nat. Comput. 13(4), 517\u2013534 (2014)","journal-title":"Nat. Comput."},{"key":"317_CR14","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Spirakis, P.G., Uzna\u0144ski, P.: On convergence and threshold properties of discrete Lotka\u2013Volterra population protocols. In: 42nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 393\u2013405. Springer (2015)","DOI":"10.1007\/978-3-662-47672-7_32"},{"issue":"46","key":"317_CR15","doi-asserted-by":"crossref","first-page":"6469","DOI":"10.1016\/j.tcs.2011.07.001","volume":"412","author":"I Chatzigiannakis","year":"2011","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating machines that use restricted space. Theor. Comput. Sci. 412(46), 6469\u20136483 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"317_CR16","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.-M., Ruppert, E., Tran, H.: The Byzantine agreement with homonyms. In: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC), pp. 21\u201330. ACM (2011)","DOI":"10.1145\/1993806.1993810"},{"issue":"2","key":"317_CR17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11047-014-9435-8","volume":"14","author":"D Doty","year":"2015","unstructured":"Doty, D., Hajiaghayi, M.: Leaderless deterministic chemical reaction networks. Nat. Comput. 14(2), 213\u2013223 (2015)","journal-title":"Nat. Comput."},{"key":"317_CR18","doi-asserted-by":"crossref","unstructured":"Doty, D.: Timing in chemical reaction networks. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 772\u2013784 (2014)","DOI":"10.1137\/1.9781611973402.57"},{"key":"317_CR19","doi-asserted-by":"crossref","unstructured":"Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. In: Proceedings of the 29th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 9363, pp. 602\u2013616. Springer (2015)","DOI":"10.1007\/978-3-662-48653-5_40"},{"issue":"3","key":"317_CR20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<165::AID-NET1>3.0.CO;2-I","volume":"32","author":"P Flocchini","year":"1998","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definitions, properties, and classes. Networks 32(3), 165\u2013180 (1998)","journal-title":"Networks"},{"key":"317_CR21","doi-asserted-by":"crossref","unstructured":"F\u00f6rster, K.-T., Seidel, J., Wattenhofer, R.: Deterministic leader election in multi-hop beeping networks. In: Proceedings of the 28th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 8784, pp. 212\u2013226. Springer (2014)","DOI":"10.1007\/978-3-662-45174-8_15"},{"key":"317_CR22","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Near optimal leader election in multi-hop rast eddio networks. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 748\u2013766. SIAM (2013)","DOI":"10.1137\/1.9781611973105.54"},{"key":"317_CR23","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Ruppert, E.: Names trump malice: tiny mobile agents can tolerate byzantine failures. In: 36th International Colloquium on Automata, Languages and Programming (ICALP), LNCS, vol. 5556, pp. 484\u2013495. Springer (2009)","DOI":"10.1007\/978-3-642-02930-1_40"},{"key":"317_CR24","doi-asserted-by":"crossref","unstructured":"Johnson, R.E., Schneider, F.B.: Symmetry and similarity in distributed systems. In: Proceedings of the 4th annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 13\u201322. ACM (1985)","DOI":"10.1145\/323596.323598"},{"key":"317_CR25","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM symposium on Theory of computing (STOC), pp. 513\u2013522. ACM (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"317_CR26","unstructured":"Kranakis, E.: Symmetry and computability in anonymous networks: a brief survey. In: Proceedings of the 3rd International Conference on Structural Information and Communication Complexity, pp. 1\u201316 (1997)"},{"key":"317_CR27","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms, 1st edn. Morgan Kaufmann, Burlington (1996)","edition":"1"},{"issue":"22","key":"317_CR28","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1016\/j.tcs.2011.02.003","volume":"412","author":"O Michail","year":"2011","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theor. Comput. Sci. 412(22), 2434\u20132450 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"317_CR29","volume-title":"Synthesis Lectures on Distributed Computing Theory","author":"O Michail","year":"2011","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: New models for population protocols. In: Lynch, N.A. (ed.) Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool, Williston (2011)"},{"key":"317_CR30","doi-asserted-by":"publisher","unstructured":"Michail, O.: Terminating distributed construction of shapes and patterns in a fair solution of automata. Distrib. Comput. 1\u201323 (2017). https:\/\/doi.org\/10.1007\/s00446-017-0309-z","DOI":"10.1007\/s00446-017-0309-z"},{"issue":"2","key":"317_CR31","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1006\/inco.2001.3054","volume":"170","author":"D Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M.K., Wool, A., Wright, R.N.: Probabilistic quorum systems. Inf. Comput. 170(2), 184\u2013206 (2001)","journal-title":"Inf. Comput."},{"key":"317_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2015.02.005","volume":"81","author":"O Michail","year":"2015","unstructured":"Michail, O., Spirakis, P.G.: Terminating population protocols via some minimal global knowledge assumptions. J. Parallel Distrib. Comput. 81, 1\u201310 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"key":"317_CR33","doi-asserted-by":"crossref","unstructured":"Michail, O., Spirakis, P.G.: How many cooks spoil the soup? In: Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 3\u201318. Springer (2016)","DOI":"10.1007\/978-3-319-48314-6_1"},{"issue":"3","key":"317_CR34","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00446-015-0257-4","volume":"29","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Simple and efficient local codes for distributed stable network construction. Distrib. Comput. 29(3), 207\u2013237 (2016)","journal-title":"Distrib. Comput."},{"key":"317_CR35","unstructured":"Michail, O., Spirakis, P.G.: Elements of the Theory of Dynamic Networks. Commun. ACM (2017). https:\/\/livrepository.liverpool.ac.uk\/3006836\/ (to appear)"},{"key":"317_CR36","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"2","key":"317_CR37","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/inco.1995.1169","volume":"123","author":"D Peleg","year":"1995","unstructured":"Peleg, D., Wool, A.: The availability of quorum systems. Inf. Comput. 123(2), 210\u2013223 (1995)","journal-title":"Inf. Comput."},{"issue":"4","key":"317_CR38","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Nat. Comput. 7(4), 615\u2013633 (2008)","journal-title":"Nat. Comput."},{"key":"317_CR39","unstructured":"Skeen, D.: A quorum-based commit protocol. Technical report, Cornell University (1982)"},{"key":"317_CR40","unstructured":"George, W., Sparks, J.: The Writings of George Washington. American Stationers\u2019 Company, Boston (1840)"},{"issue":"2","key":"317_CR41","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/2431211.2431223","volume":"45","author":"J Suomela","year":"2013","unstructured":"Suomela, J.: Survey of local algorithms. ACM Comput. Surv. (CSUR) 45(2), 24 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"317_CR42","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. I. Characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-017-0317-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0317-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0317-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T03:42:31Z","timestamp":1570246951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-017-0317-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,27]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["317"],"URL":"https:\/\/doi.org\/10.1007\/s00446-017-0317-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2017,10,27]]}}}