{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:20:42Z","timestamp":1759134042906,"version":"3.40.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T00:00:00Z","timestamp":1378166400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00446-013-0196-x","type":"journal-article","created":{"date-parts":[[2013,9,2]],"date-time":"2013-09-02T05:00:49Z","timestamp":1378098049000},"page":"21-38","source":"Crossref","is-referenced-by-count":18,"title":["Leader election for anonymous asynchronous agents in arbitrary networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Dariusz","family":"Dereniowski","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":[[2013,9,3]]},"reference":[{"key":"196_CR1","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science. Kluwer, Dordrecht (2003)"},{"key":"196_CR2","doi-asserted-by":"crossref","unstructured":"Ambuhl, C., Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7, paper 17 (2011)","DOI":"10.1145\/1921659.1921663"},{"key":"196_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC 1980), pp. 82\u201393","DOI":"10.1145\/800141.804655"},{"key":"196_CR4","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":"196_CR5","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":"196_CR6","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of the 24th International Symposium on Distributed Computing (DISC 2010), LNCS 6343, pp. 297\u2013311","DOI":"10.1007\/978-3-642-15763-9_28"},{"key":"196_CR7","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 1996), pp. 16\u201326"},{"key":"196_CR8","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 (PODC 1999), pp. 181\u2013188","DOI":"10.1145\/301308.301355"},{"key":"196_CR9","unstructured":"Burns, J.E.: A Formal Model for Message Passing Systems. Technical Report TR-91. Computer Science Department, Indiana University, Bloomington (1980)"},{"key":"196_CR10","doi-asserted-by":"crossref","unstructured":"Chalopin, J.: Local computations on closed unlabelled edges: the election problem and the naming problem. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2005), pp. 82\u201391","DOI":"10.1007\/978-3-540-30577-4_11"},{"key":"196_CR11","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Proceedings of the 14th International Conference on Principles of Distributed Systems (OPODIS 2010), pp. 119\u2013134","DOI":"10.1007\/978-3-642-17653-1_10"},{"key":"196_CR12","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 2008), pp. 54\u201368","DOI":"10.1007\/978-3-540-87405-8_5"},{"key":"196_CR13","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 2004), pp. 90\u2013104","DOI":"10.1007\/978-3-540-24727-2_8"},{"key":"196_CR14","doi-asserted-by":"crossref","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), pp. 1181\u20131196","DOI":"10.1007\/3-540-45061-0_90"},{"key":"196_CR15","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), pp. 502\u2013514","DOI":"10.1007\/978-3-642-14162-1_42"},{"key":"196_CR16","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Dobrev, S., Kranakis, E., Krizanc, D.: The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring. In: Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008), pp. 234\u2013246","DOI":"10.1007\/978-3-540-77566-9_20"},{"key":"196_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"key":"196_CR18","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, article 37 (2012)","DOI":"10.1145\/2344422.2344427"},{"key":"196_CR19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"196_CR20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"196_CR21","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 737\u2013747","DOI":"10.1137\/1.9781611973105.53"},{"key":"196_CR22","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings of the 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 92\u201399","DOI":"10.1145\/2484239.2484245"},{"key":"196_CR23","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":"196_CR24","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 59, 333\u2013347 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"196_CR25","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, 254\u2013265 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"key":"196_CR26","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"GN 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":"196_CR27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s00446-011-0131-y","volume":"24","author":"E Fusco","year":"2011","unstructured":"Fusco, E., Pelc, A.: How much memory is needed for leader election. Distrib. Comput. 24, 65\u201378 (2011)","journal-title":"Distrib. Comput."},{"key":"196_CR28","unstructured":"Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Proceedings of the 15th International Conference on Principles of Distributed Systems (OPODIS 2011), LNCS 7109, pp. 162\u2013173"},{"key":"196_CR29","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 2008), pp. 473\u2013480","DOI":"10.1109\/AICCSA.2008.4493575"},{"key":"196_CR30","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1145\/359024.359029","volume":"23","author":"DS 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":"196_CR31","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 2002), pp. 51\u201357","DOI":"10.1145\/571825.571833"},{"key":"196_CR32","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1016\/j.jcss.2013.04.003","volume":"79","author":"D Kowalski","year":"2013","unstructured":"Kowalski, D., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. J. Comput. Syst. Sci. 79, 1164\u20131180 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"196_CR33","doi-asserted-by":"crossref","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of asynchronous oblivious robots on a ring. In: Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS 2008), pp. 446\u2013462","DOI":"10.1007\/978-3-540-92221-6_28"},{"key":"196_CR34","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390, 27\u201339 (2008)"},{"key":"196_CR35","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":"196_CR36","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":"196_CR37","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599"},{"key":"196_CR38","unstructured":"Le Lann, G.: Distributed systems\u2014towards a formal approach. In: Proceedings of the IFIP Congress, pp. 155\u2013160. North Holland (1977)"},{"key":"196_CR39","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."},{"key":"196_CR40","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-1$$ N - 1 implies isomorphism to all depths. Discret. Appl. Math. 56, 61\u201374 (1995)","journal-title":"Discret. Appl. Math."},{"key":"196_CR41","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"196_CR42","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"GL Peterson","year":"1982","unstructured":"Peterson, G.L.: An $$O(n \\log n)$$ 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":"196_CR43","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 1999), pp. 173\u2013179","DOI":"10.1145\/301308.301352"},{"key":"196_CR44","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608"},{"key":"196_CR45","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"DE 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":"196_CR46","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 1988), pp. 117\u2013130","DOI":"10.1145\/62546.62568"},{"key":"196_CR47","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Kameda, T.: Electing a leader when processor identity numbers are not distinct. In: Proceedings of the 3rd Workshop on Distributed Algorithms (WDAG 1989), LNCS 392, pp. 303\u2013314","DOI":"10.1007\/3-540-51687-5_52"},{"key":"196_CR48","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\/article\/10.1007\/s00446-013-0196-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0196-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-013-0196-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T14:20:48Z","timestamp":1746022848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-013-0196-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,3]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["196"],"URL":"https:\/\/doi.org\/10.1007\/s00446-013-0196-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2013,9,3]]}}}