{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T13:48:35Z","timestamp":1758980915278,"version":"3.41.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T00:00:00Z","timestamp":1524614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["NSERC discovery grant 8136 \u2013 2013"],"award-info":[{"award-number":["NSERC discovery grant 8136 \u2013 2013"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00453-018-0444-3","type":"journal-article","created":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T12:44:32Z","timestamp":1524660272000},"page":"238-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Impact of Knowledge on Election Time in Anonymous Networks"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9593-7802","authenticated-orcid":false,"given":"Yoann","family":"Dieudonn\u00e9","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":[[2018,4,25]]},"reference":[{"key":"444_CR1","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 547\u2013556"},{"key":"444_CR2","volume-title":"Data Structures and Algorithms","author":"AV Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Boston (1983)"},{"key":"444_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":"444_CR4","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. J. Algorithms 12, 204\u2013238 (1991)","journal-title":"J. Algorithms"},{"key":"444_CR5","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. J. ACM 35, 845\u2013875 (1988)","journal-title":"J. ACM"},{"key":"444_CR6","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":"444_CR7","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":"444_CR8","unstructured":"Burns, J.E.: A formal model for message passing systems. Tech. Report TR-91, Computer Science Department, Indiana University, Bloomington (1980)"},{"key":"444_CR9","doi-asserted-by":"crossref","unstructured":"Casteigts, A., M\u00e9tivier, Y., Robson, J., Zemmari, A.: Deterministic leader election in O(D + log n) time with messages of size O(1). In: Proceedings of the 30th International Symposium on Distributed Computing (DISC 2016), pp. 16\u201328","DOI":"10.1007\/978-3-662-53426-7_2"},{"key":"444_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jpdc.2011.10.004","volume":"72","author":"D Dereniowski","year":"2012","unstructured":"Dereniowski, D., Pelc, A.: Drawing maps with advice. J. Parallel Distrib. Comput. 72, 132\u2013143 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"444_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00446-013-0196-x","volume":"27","author":"D Dereniowski","year":"2014","unstructured":"Dereniowski, D., Pelc, A.: Leader election for anonymous asynchronous agents in arbitrary networks. Distrib. Comput. 27, 21\u201338 (2014)","journal-title":"Distrib. Comput."},{"key":"444_CR12","doi-asserted-by":"publisher","first-page":"926939","DOI":"10.1109\/TPDS.2007.70792","volume":"19","author":"A Derhab","year":"2008","unstructured":"Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans. Parallel Distrib. Syst. 19, 926939 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"444_CR13","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. Fundam. Inform. 59, 333\u2013347 (2004)","journal-title":"Fundam. Inform."},{"key":"444_CR14","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Rosen, A.: Online computation with advice. Theor. Comput. Sci. 412, 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"444_CR15","doi-asserted-by":"publisher","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":"444_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00446-008-0076-y","volume":"21","author":"P Fraigniaud","year":"2009","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distrib. Comput. 21, 395\u2013403 (2009)","journal-title":"Distrib. Comput."},{"key":"444_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jcss.2009.07.002","volume":"76","author":"P Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci. 76, 222\u2013232 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"444_CR18","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ic.2008.07.005","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput. 206, 1276\u20131287 (2008)","journal-title":"Inf. Comput."},{"key":"444_CR19","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/s00224-010-9280-9","volume":"47","author":"P Fraigniaud","year":"2010","unstructured":"Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. Theory Comput. Syst. 47, 920\u2013933 (2010)","journal-title":"Theory Comput. Syst."},{"key":"444_CR20","doi-asserted-by":"publisher","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":"444_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-014-0237-0","volume":"28","author":"E Fusco","year":"2015","unstructured":"Fusco, E., Pelc, A.: Knowledge, level of symmetry, and time of leader election. Distrib. Comput. 28, 221\u2013232 (2015)","journal-title":"Distrib. Comput."},{"key":"444_CR22","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00453-009-9361-9","volume":"60","author":"E Fusco","year":"2011","unstructured":"Fusco, E., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60, 719\u2013734 (2011)","journal-title":"Algorithmica"},{"key":"444_CR23","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ic.2016.01.005","volume":"247","author":"E Fusco","year":"2016","unstructured":"Fusco, E., Pelc, A., Petreschi, R.: Topology recognition with advice. Inf. Comput. 247, 254\u2013265 (2016)","journal-title":"Inf. Comput."},{"key":"444_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53, 85\u2013112 (2004)","journal-title":"J. Algorithms"},{"key":"444_CR25","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/3039870","volume":"13","author":"C Glacet","year":"2017","unstructured":"Glacet, C., Miller, A., Pelc, A.: Time vs. information tradeoffs for leader election in anonymous trees. ACM Trans. Algorithms 13, 31:1\u201331:41 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"444_CR26","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":"444_CR27","doi-asserted-by":"publisher","first-page":"1907","DOI":"10.1109\/TPDS.2013.232","volume":"25","author":"J Hendrickx","year":"2014","unstructured":"Hendrickx, J.: Views in a graph: to which depth must equality be checked? IEEE Trans. Parallel Distrib. Syst. 25, 1907\u20131912 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"444_CR28","doi-asserted-by":"publisher","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":"444_CR29","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1016\/j.tcs.2010.01.004","volume":"411","author":"D Ilcinkas","year":"2012","unstructured":"Ilcinkas, D., Kowalski, D., Pelc, A.: Fast radio broadcasting with advice. Theor. Comput. Sci. 411, 1544\u20131557 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"444_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-013-0184-1","volume":"26","author":"R Ingram","year":"2013","unstructured":"Ingram, R., Radeva, T., Shields, P., Viqar, S., Walter, J.E., Welch, J.L.: A leader election algorithm for dynamic networks with causal clocks. Distrib. Comput. 26, 75\u201397 (2013)","journal-title":"Distrib. Comput."},{"key":"444_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\/571831.571833"},{"key":"444_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539703433912","volume":"34","author":"M Katz","year":"2004","unstructured":"Katz, M., Katz, N., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34, 23\u201340 (2004)","journal-title":"SIAM J. Comput."},{"key":"444_CR33","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22, 215\u2013233 (2010)","journal-title":"Distrib. Comput."},{"key":"444_CR34","doi-asserted-by":"publisher","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":"444_CR35","unstructured":"Le Lann, G.: Distributed systems\u2014towards a formal approach. In: Proceedings of the IFIP Congress, North Holland, pp. 155\u2013160 (1977)"},{"key":"444_CR36","volume-title":"Distributed Algorithms","author":"NL Lynch","year":"1996","unstructured":"Lynch, N.L.: Distributed Algorithms. Morgan Kaufmann Publ. Inc., San Francisco (1996)"},{"key":"444_CR37","doi-asserted-by":"crossref","unstructured":"Miller, A., Pelc, A.: Election vs. selection: two ways of finding the largest node in a graph. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), pp. 377\u2013386","DOI":"10.1145\/2935764.2935772"},{"key":"444_CR38","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 Trans. Parallel Distrib. Syst. 13, 516\u2013526 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"444_CR39","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.tcs.2008.08.020","volume":"410","author":"N Nisse","year":"2009","unstructured":"Nisse, N., Soguet, D.: Graph searching with advice. Theor. Comput. Sci. 410, 1307\u20131318 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"444_CR40","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"},{"key":"444_CR41","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0743-7315(90)90074-Y","volume":"8","author":"D Peleg","year":"1990","unstructured":"Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8, 96\u201399 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"444_CR42","doi-asserted-by":"publisher","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":"444_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52, 1\u201324 (2005)","journal-title":"J. ACM"},{"key":"444_CR44","doi-asserted-by":"publisher","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":"444_CR45","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, vol. 392, pp. 303\u2013314","DOI":"10.1007\/3-540-51687-5_52"},{"key":"444_CR46","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\u2014characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0444-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0444-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0444-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T22:54:06Z","timestamp":1751583246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0444-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,25]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["444"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0444-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,4,25]]},"assertion":[{"value":"30 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}