{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:00:54Z","timestamp":1764133254658,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349912"},{"type":"electronic","value":"9783030349929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34992-9_26","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:02:48Z","timestamp":1573754568000},"page":"323-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Logarithmic Expected-Time Leader Election in Population Protocol Model"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Sudo","sequence":"first","affiliation":[]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[]},{"given":"Taisuke","family":"Izumi","sequence":"additional","affiliation":[]},{"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"issue":"4","key":"26_CR1","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."},{"key":"26_CR2","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). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_38"},{"key":"26_CR3","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, pp. 2560\u20132579. SIAM (2017)","DOI":"10.1137\/1.9781611974782.169"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gelashvili, R.: Space-optimal majority in population protocols. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2221\u20132239. SIAM (2018)","DOI":"10.1137\/1.9781611975031.144"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Staehowiak, G.: Fast space optimal leader election in population protocols. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2653\u20132667. SIAM (2018)","DOI":"10.1137\/1.9781611975031.169"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Stachowiak, G., Uzna\u0144ski, P.: Almost logarithmic-time space optimal leader election in population protocols. arXiv preprint arXiv: 1802.06867 (2018)","DOI":"10.1145\/3323165.3323178"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-03232-6_11","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"O Michail","year":"2018","unstructured":"Michail, O., Spirakis, P.G., Theofilatos, M.: Simple and fast approximate counting and leader election in populations. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 154\u2013169. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_11"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00446-016-0281-z","volume":"31","author":"D Doty","year":"2018","unstructured":"Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. Distrib. Comput. 31(4), 257\u2013271 (2018)","journal-title":"Distrib. Comput."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Sudo, Y., Masuzawa, T.: Leader election requires logarithmic time in population protocols. arXiv preprint arXiv:1906.11121 (2019)","DOI":"10.1142\/S012962642050005X"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2012.01.007","volume":"444","author":"Y Sudo","year":"2012","unstructured":"Sudo, Y., Nakamura, J., Yamauchi, Y., Ooshita, F., Kakugawa, H., Masuzawa, T.: Loosely-stabilizing leader election in a population protocol model. Theor. Comput. Sci. 444, 100\u2013112 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR11","unstructured":"Sudo, Y., Ooshita, F., Kakugawa, H., Masuzawa, T., Datta, A.K., Larmore, L.L.: Loosely-stabilizing leader election with polylogarithmic convergence time. In: 22nd International Conference on Principles of Distributed Systems, OPODIS 2018, pp. 30:1\u201330:16 (2018)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Bilke, A., Cooper, C., Els\u00e4sser, R., Radzik, T.: Brief announcement: population protocols for leader election and exact majority with $$o(log^2 n)$$ states and $$o(log^2 n)$$ convergence time. In: Proceedings of the 38th ACM Symposium on Principles of Distributed Computing, pp. 451\u2013453. Springer (2017)","DOI":"10.1145\/3087801.3087858"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/3289137.3289150","volume":"49","author":"D Alistarh","year":"2018","unstructured":"Alistarh, D., Gelashvili, R.: Recent algorithmic advances in population protocols. ACM SIGACT News 49(3), 63\u201373 (2018)","journal-title":"ACM SIGACT News"},{"issue":"126","key":"26_CR14","first-page":"1","volume":"3","author":"R Els\u00e4sser","year":"2018","unstructured":"Els\u00e4sser, R., Radzik, T.: Recent results in population protocols for exact majority and leaderelection. Bull. EATCS 3(126), 1\u201334 (2018)","journal-title":"Bull. EATCS"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","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."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Sudo, Y., Ooshita, F., Izumi, T., Kakugawa, H., Masuzawa, T.: Logarithmic expected-time leader election in population protocol model. arXiv preprint arXiv:1812.11309 (2018)","DOI":"10.1145\/3293611.3331585"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34992-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T06:51:48Z","timestamp":1612335108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34992-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349912","9783030349929"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34992-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2019.lip6.fr\/symp\/sss2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}