{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:15Z","timestamp":1759638615113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_28","type":"book-chapter","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T03:30:06Z","timestamp":1507260606000},"page":"384-398","source":"Crossref","is-referenced-by-count":8,"title":["Space-Optimal Proportion Consensus with\u00a0Population Protocols"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Eisenstat, D., Gelashvili, R., Rivest, R.L.: Time-space trade-offs in population protocols. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January, pp. 2560\u20132579 (2017)","DOI":"10.1137\/1.9781611974782.169"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gelashvili, R.: Space-Optimal Majority in Population Protocols. ArXiv e-prints arXiv:1704.04947 , April 2017","DOI":"10.1137\/1.9781611975031.144"},{"key":"28_CR3","first-page":"155","volume-title":"Lecture Notes in Computer Science","author":"Dan Alistarh","year":"2017","unstructured":"Alistarh, D., Dudek, B., Kosowski, A., Soloveichik, D., Uznanski, P.: Robust detection in leak-prone population protocols. arXiv arXiv:1706.09937 (2017)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gelashvili, R., Vojnovi\u0107, M.: Fast and exact majority in population protocols. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, New York, NY, USA, pp. 47\u201356 (2015)","DOI":"10.1145\/2767386.2767429"},{"issue":"4","key":"28_CR5","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. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Ruppert, E., Malkhi, D. (eds.) PODC, pp. 292\u2013299. ACM (2006)","DOI":"10.1145\/1146381.1146425"},{"issue":"2","key":"28_CR7","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. Distrib. Comput. 21(2), 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11776178_3","volume-title":"Distributed Computing in Sensor Systems","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 37\u201350. Springer, Heidelberg (2006). doi: 10.1007\/11776178_3"},{"key":"28_CR9","first-page":"98","volume":"93","author":"J Aspnes","year":"2007","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. Bull. Eur. Assoc. Theoret. Comput. Sci. 93, 98\u2013117 (2007)","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-03850-6_4","volume-title":"Principles of Distributed Systems","author":"J Beauquier","year":"2013","unstructured":"Beauquier, J., Blanchard, P., Burman, J.: Self-stabilizing leader election in population protocols over arbitrary communication graphs. In: Baldoni, R., Nisse, N., Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 38\u201352. Springer, Cham (2013). doi: 10.1007\/978-3-319-03850-6_4"},{"key":"28_CR11","unstructured":"Becchetti, L., Clementi, A., Natale, E., Pasquale, F., Raghavendra, P., Trevisan, L.: Friend or Foe? Population Protocols can perform Community Detection. ArXiv e-prints arXiv:1703.05045 , March 2017"},{"key":"28_CR12","unstructured":"Berenbrink, P., Friedetzky, T., Kling, P., Mallmann-Trenn, F., Wastell, C.: Plurality consensus in arbitrary graphs: lessons learned from load balancing. In: 24th Annual European Symposium on Algorithms (ESA 2016), pp. 10:1\u201310:18 (2016)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1038\/nnano.2013.189","volume":"8","author":"Y-J Chen","year":"2013","unstructured":"Chen, Y.-J., Dalchau, N., Srinivas, N., Phillips, A., Cardelli, L., Soloveichik, D., Seelig, G.: Programmable chemical controllers made from DNA. Nat. Nanotechnol. 8, 755\u2013762 (2013)","journal-title":"Nat. Nanotechnol."},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJSNM.2012.045103","volume":"1","author":"G Cordasco","year":"2012","unstructured":"Cordasco, G., Gargano, L.: Label propagation algorithm: a semi-synchronous approach. Int. J. Soc. Netw. Mining (IJSNM) 1(1), 3\u201326 (2012)","journal-title":"Int. J. Soc. Netw. Mining (IJSNM)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11776178_4","volume-title":"Distributed Computing in Sensor Systems","author":"C Delporte-Gallet","year":"2006","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: making population protocols fault-tolerant. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 51\u201366. Springer, Heidelberg (2006). doi: 10.1007\/11776178_4"},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/110823018","volume":"50","author":"M Draief","year":"2012","unstructured":"Draief, M., Vojnovi, M.: Convergence speed of binary interval consensus. SIAM J. Control Optim. 50(3), 1087\u20131109 (2012)","journal-title":"SIAM J. Control Optim."},{"key":"28_CR17","unstructured":"Gasieniec, L., Hamilton, D., Martin, R., Spirakis, P.G., Stachowiak, G.: Deterministic population protocols for exact majority and plurality. In: 20th International Conference on Principles of Distributed Systems (OPODIS 2016), vol. 70, pp. 14:1\u201314:14 (2017)"},{"key":"28_CR18","unstructured":"Gasieniec, L., Stachowiak, G.: Fast space optimal leader election in population protocols. arXiv e-prints arXiv:1704.07649"},{"key":"28_CR19","unstructured":"Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Stably computing order statistics with arithmetic population protocols. In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS, pp. 68:1\u201368:14 (2016)"},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-016-0277-8","volume":"30","author":"GB Mertzios","year":"2017","unstructured":"Mertzios, G.B., Nikoletseas, S.E., Raptopoulos, C.L., Spirakis, P.G.: Determining majority in networks with local interactions and very small local memory. Distrib. Comput. 30(1), 1\u201316 (2017)","journal-title":"Distrib. Comput."},{"issue":"6","key":"28_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00446-012-0173-9","volume":"25","author":"R Mizoguchi","year":"2012","unstructured":"Mizoguchi, R., Ono, H., Kijima, S., Yamashita, M.: On space complexity of self-stabilizing leader election in mediated population protocol. Distrib. Comput. 25(6), 451\u2013460 (2012)","journal-title":"Distrib. Comput."},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Mocquard, Y., Anceaume, E., Aspnes, J., Busnel, Y., Sericola, B.: Counting with population protocols. In: 2015 IEEE 14th International Symposium on Network Computing and Applications (NCA), pp. 35\u201342, September 2015","DOI":"10.1109\/NCA.2015.35"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Mocquard, Y., Anceaume, E., Sericola, B.: Optimal proportion computation with population protocols. In: 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), pp. 216\u2013223, October 2016","DOI":"10.1109\/NCA.2016.7778621"},{"key":"28_CR24","doi-asserted-by":"crossref","first-page":"2527","DOI":"10.1109\/INFCOM.2009.5062181","volume":"2009","author":"E Perron","year":"2009","unstructured":"Perron, E., Vasudevan, D., Vojnovic, M.: Using three states for binary consensus on complete graphs. IEEE INFOCOM 2009, 2527\u20132535 (2009)","journal-title":"IEEE INFOCOM"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T15:08:20Z","timestamp":1719500900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}