{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:34:38Z","timestamp":1740461678832,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_25","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"251-266","source":"Crossref","is-referenced-by-count":1,"title":["How Much Memory Is Needed for Leader Election"],"prefix":"10.1007","author":[{"given":"Emanuele G.","family":"Fusco","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM\u00a035, 845\u2013875 (1988)","journal-title":"Journal of the ACM"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0196-6774(91)90002-G","volume":"12","author":"H. Attiya","year":"1991","unstructured":"Attiya, H., Snir, M.: Better Computing on the Anonymous Ring. Journal of Algorithms\u00a012, 204\u2013238 (1991)","journal-title":"Journal of Algorithms"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing, pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"25_CR4","unstructured":"Burns, J.E.: A formal model for message passing systems, Tech. Report TR-91, Computer Science Department, Indiana University, Bloomington (September 1980)"},{"key":"25_CR5","unstructured":"Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: Proc. 4th Israel Symposium on Theory of Computing and Systems ISTCS, pp. 16\u201326 (1996)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1137\/0209048","volume":"9","author":"S.A. Cook","year":"1980","unstructured":"Cook, S.A., Rackoff, C.: Space Lower Bounds for Maze Threadability on Restricted Machines. SIAM J. Comput.\u00a09, 636\u2013652 (1980)","journal-title":"SIAM J. Comput."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs, Proc. 29th ACM Symp. on Principles of Distributed Comp. PODC 2010 (2010)","DOI":"10.1145\/1835698.1835801"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(94)00178-L","volume":"145","author":"K. Diks","year":"1995","unstructured":"Diks, K., Kranakis, E., Malinowski, A., Pelc, A.: Anonymous wireless rings. Theoretical Computer Science\u00a0145, 95\u2013109 (1995)","journal-title":"Theoretical Computer Science"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FUN-2004-59402","volume":"59","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Pelc, A.: Leader election in rings with nonunique labels. Fundamenta Informaticae\u00a059, 333\u2013347 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N.: Sorting Multisets in Anonymous Rings. In: Proc. of the IEEE International Parallel and Distributed Processing Symposium IPDPS, Cancun, Mexico, pp. 275\u2013280 (2000)","DOI":"10.1109\/IPDPS.2000.845996"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in Trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-45841-7_4","volume-title":"STACS 2002","author":"P. Fraigniaud","year":"2002","unstructured":"Fraigniaud, P., Gavoille, C.: A Space Lower Bound for Routing in Trees. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 65\u201375. Springer, Heidelberg (2002)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-24749-4_22","volume-title":"STACS 2004","author":"P. Fraigniaud","year":"2004","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraphs Exploration with Little Memory. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 246\u2013257. Springer, Heidelberg (2004)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-87779-0_17","volume-title":"Distributed Computing","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 242\u2013256. Springer, Heidelberg (2008)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proc. 22nd Ann. ACM Symposium on Parallel Algorithms and Architectures, SPAA 2010 (2010)","DOI":"10.1145\/1810479.1810524"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G.N. Fredrickson","year":"1987","unstructured":"Fredrickson, G.N., Lynch, N.A.: Electing a leader in a synchronous ring. Journal of the ACM\u00a034, 98\u2013115 (1987)","journal-title":"Journal of the ACM"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Haddar, M.A., Kacem, A.H., M\u00e9tivier, Y., Mosbah, M., Jmaiel, M.: Electing a leader in the local computation model using mobile agents. In: Proc. 6th ACS\/IEEE International Conference on Computer Systems and Applications AICCSA 2008, pp. 473\u2013480 (2008)","DOI":"10.1109\/AICCSA.2008.4493575"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"D.S. Hirschberg","year":"1980","unstructured":"Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema-finding in circular configurations of processes. Communications of the ACM\u00a023, 627\u2013628 (1980)","journal-title":"Communications of the ACM"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in\u00a0radio networks. In: Proc., 21st ACM Symp. on Principles of Distr. Comp. (PODC 2002), pp. 51\u201357 (2002)","DOI":"10.1145\/571831.571833"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M. Kouck\u1ef3","year":"2002","unstructured":"Kouck\u1ef3, M.: Universal Traversal Sequences with Backtracking. J. Comput. Syst. Sci.\u00a065, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-642-02930-1_43","volume-title":"Automata, Languages and Programming","author":"D. Kowalski","year":"2009","unstructured":"Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 521\u2013533. Springer, Heidelberg (2009)"},{"key":"25_CR22","unstructured":"Kranakis, E.: Symmetry and Computability in Anonymous Networks: A Brief Survey. In: Proc. 3rd Int. Conf. on Structural Information and Communication Complexity, pp. 1\u201316 (1997)"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean Functions on Anonymous Networks. Information and Computation\u00a0114, 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-78773-0_52","volume-title":"LATIN 2008: Theoretical Informatics","author":"E. Kranakis","year":"2008","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with Limited Memory. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 605\u2013616. Springer, Heidelberg (2008)"},{"key":"25_CR25","first-page":"155","volume-title":"Information processing\u201977","author":"G. LeLann","year":"1977","unstructured":"LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing\u201977, pp. 155\u2013160. North Holland, Amsterdam (1977)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Lindell, S.: A logspace algorithm for tree canonization. In: Proc. 24th ACM Symposium on Theory of Computing (STOC 1992), pp. 400\u2013404 (1992)","DOI":"10.1145\/129712.129750"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TPDS.2002.1003864","volume":"13","author":"K. Nakano","year":"2002","unstructured":"Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Transactions on Parallel Distributed Systems\u00a013, 516\u2013526 (2002)","journal-title":"IEEE Transactions on Parallel Distributed Systems"},{"issue":"1","key":"25_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(93)E0133-J","volume":"56","author":"N. Norris","year":"1995","unstructured":"Norris, N.: Universal Covers of Graphs: Isomorphism to Depth N\u2009\u2212\u20091 Implies Isomorphism to All Depths. Discrete Applied Mathematics\u00a056(1), 61\u201374 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR29","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"Peterson, G.L.: An O(n logn) unidirectional distributed algorithm for the circular extrema problem. ACM Transactions on Programming Languages and Systems\u00a04, 758\u2013762 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"25_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O. Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. Journal of the ACM\u00a055, 1\u201324 (2008)","journal-title":"Journal of the ACM"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks. In: Proc. 18th ACM Symp. on Principles of Distributed Computing (PODC 1999), pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"D.E. Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. on Computing\u00a015, 468\u2013477 (1986)","journal-title":"SIAM J. on Computing"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. In: Proc. 7th ACM Symp. on Principles of Distributed Computing (PODC 1988), pp. 117\u2013130 (1988)","DOI":"10.1145\/62546.62568"},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-51687-5_52","volume-title":"Distributed Algorithms","author":"M. Yamashita","year":"1989","unstructured":"Yamashita, M., Kameda, T.: Electing a leader when procesor identity numbers are not distinct. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol.\u00a0392, pp. 303\u2013314. Springer, Heidelberg (1989)"},{"key":"25_CR35","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems\u00a07, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T23:54:45Z","timestamp":1740441285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}