{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T06:02:44Z","timestamp":1699423364452},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,9]],"date-time":"2011-04-09T00:00:00Z","timestamp":1302307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00446-011-0131-y","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T10:07:35Z","timestamp":1302257255000},"page":"65-78","source":"Crossref","is-referenced-by-count":14,"title":["How much memory is needed for leader election"],"prefix":"10.1007","volume":"24","author":[{"given":"Emanuele G.","family":"Fusco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"131_CR1","doi-asserted-by":"crossref","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. J. ACM 35, 845\u2013875 (1988)","journal-title":"J. ACM"},{"key":"131_CR2","doi-asserted-by":"crossref","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. J. Algorithms 12, 204\u2013238 (1991)","journal-title":"J. Algorithms"},{"key":"131_CR3","unstructured":"Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: Proceedings of the 4th Israel Symposium on Theory of Computing and Systems (ISTCS), pp. 16\u201326 (1996)"},{"key":"131_CR4","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 181\u2013188 (1999)","DOI":"10.1145\/301308.301355"},{"key":"131_CR5","unstructured":"Burns, J.E.: A Formal Model for Message Passing Systems, Technical Report TR-91. Computer Science Department, Indiana University, Bloomington, September 1980"},{"key":"131_CR6","doi-asserted-by":"crossref","unstructured":"Chalopin, J.: Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem SOFSEM: Theory and Practice of Computer Science 82\u201391 (2005)","DOI":"10.1007\/978-3-540-30577-4_11"},{"key":"131_CR7","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Mazurkiewicz, A.W., M\u00e9tivier, Y.: Labelled (Hyper)graphs, negotiations and the naming problem. In: Proceedings of the 4th International Conference on Graph Transformations (ICGT), pp. 54\u201368 (2008)","DOI":"10.1007\/978-3-540-87405-8_5"},{"key":"131_CR8","doi-asserted-by":"crossref","unstructured":"Chalopin, J., M\u00e9tivier, Y.: Election and local computations on edges. In: Proceedings of the Foundations of Software Science and Computation Structures (FoSSaCS), pp. 90\u2013104 (2004)","DOI":"10.1007\/978-3-540-24727-2_8"},{"key":"131_CR9","doi-asserted-by":"crossref","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. 9, 636\u2013652 (1980)","journal-title":"SIAM J. Comput."},{"key":"131_CR10","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. In: Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pp. 450\u2013459 (2010)","DOI":"10.1145\/1835698.1835801"},{"key":"131_CR11","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 145, 95\u2013109 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"131_CR12","first-page":"333","volume":"59","author":"S. Dobrev","year":"2004","unstructured":"Dobrev S., Pelc A.: Leader election in rings with nonunique labels. Fundam. Inf. 59, 333\u2013347 (2004)","journal-title":"Fundam. Inf."},{"issue":"2","key":"131_CR13","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.jpdc.2003.11.007","volume":"64","author":"P. Flocchini","year":"2004","unstructured":"Flocchini P., Kranakis E., Krizanc D., Luccio F.L., Santoro N.: Sorting and election in anonymous asynchronous rings. J. Parallel Distrib. Comput. 64(2), 254\u2013265 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"key":"131_CR14","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 757\u2013772 (2001)","DOI":"10.1007\/3-540-48224-5_62"},{"key":"131_CR15","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 65\u201375 (2002)","DOI":"10.1007\/3-540-45841-7_4"},{"key":"131_CR16","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D.: Digraphs exploration with little memory. In: Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS), pp. 246\u2013257 (2004)","DOI":"10.1007\/978-3-540-24749-4_22"},{"key":"131_CR17","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Proceedings of the 22nd International Symposium on Distributed Computing (DISC), pp. 242\u2013256 (2008)","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"131_CR18","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proceedings of the 22nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 224\u2013232 (2010)","DOI":"10.1145\/1810479.1810524"},{"key":"131_CR19","doi-asserted-by":"crossref","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. J. ACM 34, 98\u2013115 (1987)","journal-title":"J. ACM"},{"key":"131_CR20","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: Proceedings of the 6th ACS\/IEEE International Conference on Computer Systems and Applications (AICCSA), pp. 473\u2013480 (2008)","DOI":"10.1109\/AICCSA.2008.4493575"},{"key":"131_CR21","doi-asserted-by":"crossref","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. Commun. ACM 23, 627\u2013628 (1980)","journal-title":"Commun. ACM"},{"key":"131_CR22","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201357 (2002)","DOI":"10.1145\/571825.571833"},{"key":"131_CR23","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M. Koucky\u0300","year":"2002","unstructured":"Koucky\u0300 M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"131_CR24","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 5556, pp. 521\u2013533 (2009)","DOI":"10.1007\/978-3-642-02930-1_43"},{"key":"131_CR25","unstructured":"Kranakis, E.: Symmetry and 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":"131_CR26","doi-asserted-by":"crossref","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. Inf. Comput. 114, 214\u2013236 (1994)","journal-title":"Inf. Comput."},{"key":"131_CR27","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with Limited Memory. In: Proceedings of the 8th Latin American Theoretical Informatics (LATIN), pp. 605\u2013616 (2008)","DOI":"10.1007\/978-3-540-78773-0_52"},{"key":"131_CR28","unstructured":"Le Lann, G.: Distributed systems\u2014towards a formal approach. In: Proceedings of the IFIP Congress. North Holland, pp. 155\u2013160 (1977)"},{"key":"131_CR29","doi-asserted-by":"crossref","unstructured":"Lindell, S.: A logspace algorithm for tree canonization. In: Proceedings of the 24th ACM Symposium on Theory of Computing (STOC), pp. 400\u2013404 (1992)","DOI":"10.1145\/129712.129750"},{"key":"131_CR30","doi-asserted-by":"crossref","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 Trans. Parallel Distrib. Syst. 13, 516\u2013526 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"131_CR31","doi-asserted-by":"crossref","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\u22121 implies isomorphism to all depths. Discrete Appl. Math. 56(1), 61\u201374 (1995)","journal-title":"Discrete Appl. Math."},{"key":"131_CR32","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"G.L. Peterson","year":"1982","unstructured":"Peterson G.L.: An O(n log n) unidirectional distributed algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4, 758\u2013762 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"131_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O. Reingold","year":"2008","unstructured":"Reingold O.: Undirected connectivity in log-space. J. ACM 55, 1\u201324 (2008)","journal-title":"J. ACM"},{"key":"131_CR34","doi-asserted-by":"crossref","unstructured":"Sakamoto, N.: Comparison of initial conditions for distributed algorithms on anonymous networks. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC), pp. 173\u2013179 (1999)","DOI":"10.1145\/301308.301352"},{"key":"131_CR35","doi-asserted-by":"crossref","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. Comput. 15, 468\u2013477 (1986)","journal-title":"SIAM J. Comput."},{"key":"131_CR36","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks. In: Proceedings of the 7th ACM Symposium on Principles of Distributed Computing (PODC), pp. 117\u2013130 (1988)","DOI":"10.1145\/62546.62568"},{"key":"131_CR37","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Electing a leader when procesor identity numbers are not distinct. In: Proceedings of the 3rd Workshop on Distributed Algorithms, LNCS vol. 392, Springer-Verlag (WDAG), pp. 303\u2013314 (1989)","DOI":"10.1007\/3-540-51687-5_52"},{"key":"131_CR38","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: Part I\u2014characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0131-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0131-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0131-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T21:06:31Z","timestamp":1560114391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0131-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,9]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0131-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,9]]}}}