{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:20:14Z","timestamp":1743135614420,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031099922"},{"type":"electronic","value":"9783031099939"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09993-9_10","type":"book-chapter","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:12:42Z","timestamp":1656101562000},"page":"174-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Election in\u00a0Fully Anonymous Shared Memory Systems: Tight Space Bounds and\u00a0Algorithms"],"prefix":"10.1007","author":[{"given":"Damien","family":"Imbs","sequence":"first","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aigner M. and Ziegler G., Proofs from THE BOOK (4th edition). Springer, 274 pages, ISBN 978-3-642-00856-6 (2010)","DOI":"10.1007\/978-3-642-00856-6_1"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Aghazadeh Z., Imbs D., Raynal M., Taubenfeld G., and Woelfel Ph., Optimal memory-anonymous symmetric deadlock-free mutual exclusion. Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC\u201919), ACM Press, 10 pages (2019)","DOI":"10.1145\/3293611.3331594"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Angluin D., Local and global properties in networks of processes. Proc. 12th Symposium on Theory of Computing (STOC\u201980), ACM Press, pp. 82\u201393, (1980)","DOI":"10.1145\/800141.804655"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H Attiya","year":"2002","unstructured":"Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared-memory systems. Information and Computation 173(2), 162\u2013183 (2002)","journal-title":"Information and Computation"},{"key":"10_CR5","unstructured":"Attiya H. and Welch J.L., Distributed computing: fundamentals, simulations and advanced topics, (2nd Edition), Wiley-Interscience, 414 pages, 2ISBN 0-471-45324-2 (2004)"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00446-017-0301-7","volume":"31","author":"Z Bouzid","year":"2018","unstructured":"Bouzid, Z., Raynal, M., Sutra, P.: Anonymous obstruction-free $$(n, k)$$-set agreement with $$(n-k+1)$$ atomic read\/write registers. Distributed Computing 31(2), 99\u2013117 (2018)","journal-title":"Distributed Computing"},{"issue":"1","key":"10_CR7","first-page":"1","volume":"13","author":"EW Dijkstra","year":"1980","unstructured":"Dijkstra, E.W.: Some beautiful arguments using mathematical induction. Algorithmica 13(1), 1\u20138 (1980)","journal-title":"Algorithmica"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/s00453-011-9611-5","volume":"65","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Ilcinkas, D., Pelc, A., Santoro, N.: Computing without communicating: ring exploration by asynchronous oblivious robots. Algorithmica 65(3), 562\u2013583 (2013)","journal-title":"Algorithmica"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Godard E., Imbs D., Raynal M., and Taubenfeld G., From Bezout identity to space-optimal leader election in anonymous memory systems. Proc. 39th ACM Symposium on Principles of Distributed Computing (PODC\u201920), ACM press, pp. 41\u201350 (2020)","DOI":"10.1145\/3382734.3405727"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-007-0042-0","volume":"20","author":"R Guerraoui","year":"2007","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computations. Distributed Computing 20, 165\u2013177 (2007)","journal-title":"Distributed Computing"},{"key":"10_CR11","unstructured":"Harel D. and Feldman Y., Algorithmics, the spirit of computing. Springer, 572 pages (2012)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR13","unstructured":"Imbs, D., Raynal, M., Taubefeld, G.: Election in fully anonymous shared memory systems: tight space bounds and algorithms. ArXiv:2203.02988v1, 17 pages (2022)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed computing: principles, algorithms and systems. Cambridge University Press, 736 pages (2008)","DOI":"10.1017\/CBO9780511805318"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, Part I: basic formalism. Distrib. Comput. 1(2), 77\u201385 (1986)","journal-title":"Distrib. Comput."},{"issue":"546","key":"10_CR16","first-page":"1","volume":"7","author":"S Navlakha","year":"2011","unstructured":"Navlakha, S., Bar-Joseph, Z.: Algorithms in nature: the convergence of systems biology and computational thinking. Molecular Syst. Biol. 7(546), 1\u201311 (2011)","journal-title":"Molecular Syst. Biol."},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/2678280","volume":"58","author":"S Navlakha","year":"2015","unstructured":"Navlakha, S., Bar-Joseph, Z.: Distributed information processing in biological and computational systems. Commun. ACM 58(1), 94\u2013102 (2015)","journal-title":"Commun. ACM"},{"issue":"9","key":"10_CR18","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/947955.1083808","volume":"17","author":"A Perlis","year":"1982","unstructured":"Perlis, A.: Epigrams on programming. ACM SIGPLAN Notices 17(9), 7\u201313 (1982)","journal-title":"ACM SIGPLAN Notices"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-030-79527-6_9","volume-title":"Structural Information and Communication Complexity","author":"S Rashid","year":"2021","unstructured":"Rashid, S., Taubenfeld, G., Bar-Joseph, Z.: The epigenetic consensus problem. In: Jurdzi\u0144ski, T., Schmid, S. (eds.) SIROCCO 2021. LNCS, vol. 12810, pp. 146\u2013163. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79527-6_9"},{"key":"10_CR20","unstructured":"Raynal, M.: Concurrent programming: algorithms, principles and foundations. Springer, 515 p., ISBN 978-3-642-32026-2 (2013)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Distributed Algorithms for Message-Passing Systems, 534 p. Springer (2013). ISBN 978-3-642-38122-5 (2013)","DOI":"10.1007\/978-3-642-38123-2_1"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Raynal, M., Taubenfeld, G.: Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. 158 (2020)","DOI":"10.1016\/j.ipl.2020.105938"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-030-67087-0_20","volume-title":"Networked Systems","author":"Michel Raynal","year":"2021","unstructured":"Raynal, Michel, Taubenfeld, Gadi: Fully anonymous consensus and set agreement algorithms. In: Georgiou, Chryssis, Majumdar, Rupak (eds.) NETYS 2020. LNCS, vol. 12129, pp. 314\u2013328. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_20"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Styer, E., Peterson, G.L.: Tight bounds for shared memory symmetric mutual exclusion problems. In: Proceedings of 8th ACM Symposium on Principles of Distributed Computing (PODC\u201989), pp. 177\u2013191. ACM Press (1989)","DOI":"10.1145\/72981.72993"},{"key":"10_CR25","unstructured":"Taubenfeld, G.: Synchronization algorithms and concurrent programming, 423 p., Pearson Education\/Prentice Hall, ISBN 0-131-97259-6 (2006)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Coordination without prior agreement. In: Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC 2017), pp. 325\u2013334. ACM Press (2017)","DOI":"10.1145\/3087801.3087807"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09993-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:14:31Z","timestamp":1656101671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09993-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031099922","9783031099939"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09993-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2022.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}