{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:23:56Z","timestamp":1725870236960},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319483139"},{"type":"electronic","value":"9783319483146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48314-6_1","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T15:01:04Z","timestamp":1478185264000},"page":"3-18","source":"Crossref","is-referenced-by-count":1,"title":["How Many Cooks Spoil the Soup?"],"prefix":"10.1007","author":[{"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":[[2016,11,4]]},"reference":[{"issue":"4","key":"1_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)"},{"issue":"4","key":"1_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(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"4","key":"1_CR3","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":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-662-47666-6_38","volume-title":"Automata, Languages, and Programming","author":"D Alistarh","year":"2015","unstructured":"Alistarh, D., Gelashvili, R.: Polylogarithmic-time leader election in population protocols. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 479\u2013491. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47666-6_38"},{"key":"1_CR5","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":"1_CR6","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, Heidelberg (2009)"},{"key":"1_CR7","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-Interscience, Hoboken (2004)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-662-45174-8_2","volume-title":"Distributed Computing","author":"H-L Chen","year":"2014","unstructured":"Chen, H.-L., Cummings, R., Doty, D., Soloveichik, D.: Speed faults in computation by chemical reaction networks. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 16\u201330. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45174-8_2"},{"issue":"4","key":"1_CR9","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":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-662-47672-7_32","volume-title":"Automata, Languages, and Programming","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Ga\u0327sieniec, L., Kosowski, A., Kranakis, E., Spirakis, P.G., Uzna\u0144ski, P.: On convergence and threshold properties of discrete Lotka-Volterra population protocols. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 393\u2013405. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47672-7_32"},{"issue":"46","key":"1_CR11","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. Theoret. Comput. Sci. 412(46), 6469\u20136483 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.-M., Ruppert, E., Tran-The, H.: 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":"1_CR13","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":"1_CR14","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"},{"issue":"3","key":"1_CR15","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":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-662-45174-8_15","volume-title":"Distributed Computing","author":"K-T F\u00f6rster","year":"2014","unstructured":"F\u00f6rster, K.-T., Seidel, J., Wattenhofer, R.: Deterministic leader election in multi-hop beeping networks. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 212\u2013226. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45174-8_15"},{"key":"1_CR17","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":"1_CR18","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":"1_CR19","unstructured":"Kranakis, E.: Symmetry, 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":"1_CR20","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":"1_CR21","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. Theoret. Comput. Sci. 412(22), 2434\u20132450 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR22","doi-asserted-by":"crossref","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 (2011)","DOI":"10.2200\/S00328ED1V01Y201101DCT006"},{"issue":"2","key":"1_CR23","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."},{"issue":"3","key":"1_CR24","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":"1_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000). SIAM monographs on discrete mathematics and applications"},{"key":"1_CR26","unstructured":"Skeen, D.: A quorum-based commit protocol. Technical report, Cornell University (1982)"},{"issue":"2","key":"1_CR27","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":"1_CR28","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":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48314-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T07:43:04Z","timestamp":1568533384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48314-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483139","9783319483146"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48314-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}