{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T16:12:57Z","timestamp":1792599177488,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176524","type":"print"},{"value":"9783642176531","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_10","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T00:50:47Z","timestamp":1291596647000},"page":"119-134","source":"Crossref","is-referenced-by-count":36,"title":["Constructing a Map of an Anonymous Graph: Applications of Universal Sequences"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S. Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing\u00a029(4), 1164\u20131188 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1142\/S0129054110007349","volume":"21","author":"E. Ando","year":"2010","unstructured":"Ando, E., Ono, H., Sadakane, K., Yamashita, M.: The space complexity of leader election in anonymous networks. International Journal of Foundations of Computer Science\u00a021(3), 427\u2013440 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: 12th Symposium on Theory of Computing (STOC 1980), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00224-005-1223-5","volume":"40","author":"L. Barri\u00e8re","year":"2007","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory of Computing Systems\u00a040(2), 143\u2013162 (2007)","journal-title":"Theory of Computing Systems"},{"issue":"8","key":"10_CR6","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1002\/nav.1044","volume":"48","author":"V. Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Research Logistics\u00a048(8), 722\u2013731 (2001)","journal-title":"Naval Research Logistics"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bender, M., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. In: 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 269\u2013278 (1998)","DOI":"10.1145\/276698.276759"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), pp. 132\u2013142 (1978)","DOI":"10.1109\/SFCS.1978.30"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45414-4_3","volume-title":"Distributed Computing","author":"P. Boldi","year":"2001","unstructured":"Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 33\u201347. Springer, Heidelberg (2001)"},{"key":"10_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: 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010), pp. 450\u2013459 (2010)","DOI":"10.1145\/1835698.1835801"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. Journal of Graph Theory\u00a032(3), 265\u2013297 (1999)","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A. Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046(1), 69\u201396 (2006)","journal-title":"Algorithmica"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/70.105395","volume":"7","author":"G. Dudek","year":"1991","unstructured":"Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: Robotic exploration as graph construction. Transactions on Robotics and Automation\u00a07(6), 859\u2013865 (1991)","journal-title":"Transactions on Robotics and Automation"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"10_CR16","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":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-642-15763-9_25","volume-title":"DISC 2010","author":"E.G. Fusco","year":"2010","unstructured":"Fusco, E.G., Pelc, A.: How much memory is needed for leader election. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 251\u2013266. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M. Kouck\u00fd","year":"2002","unstructured":"Kouck\u00fd, M.: Universal traversal sequences with backtracking. Journal of Computer and System Sciences\u00a065(4), 717\u2013726 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"issue":"1","key":"10_CR20","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\u20131 implies isomorphism to all depths. Discrete Applied Mathematics\u00a056(1), 61\u201374 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. Journal of Algorithms\u00a033(2), 281\u2013295 (1999)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1002\/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N","volume":"36","author":"P. Panaite","year":"2000","unstructured":"Panaite, P., Pelc, A.: Impact of topographic information on graph exploration efficiency. Networks\u00a036(2), 96\u2013103 (2000)","journal-title":"Networks"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. Journal of the ACM\u00a055(4) (2008)","DOI":"10.1145\/1391289.1391291"},{"key":"10_CR24","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608 (2007)"},{"issue":"1","key":"10_CR25","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 Transactions on Parallel and Distributed Systems\u00a07(1), 69\u201389 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X. Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent rendezvous: A dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 610\u2013621. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T08:34:07Z","timestamp":1740731647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}