{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:41:28Z","timestamp":1778496088782,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157622","type":"print"},{"value":"9783642157639","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_28","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"297-311","source":"Crossref","is-referenced-by-count":51,"title":["Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Ilcinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Malkhi, D.: LLS: a locality aware location service for mobile ad hoc networks. In: Proc. DIALM-POMC 2004, pp. 75\u201384 (2004)","DOI":"10.1145\/1022630.1022643"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"28_CR3","series-title":"Int. Series in Operations research and Management Science","volume-title":"The theory of search games and rendezvous","author":"S. Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science, vol.\u00a055. Kluwer Academic Publisher, Dordrecht (2002)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"J. Alpern","year":"1999","unstructured":"Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability\u00a036, 223\u2013231 (1999)","journal-title":"Journal of Applied Probability"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","volume":"49","author":"E. Anderson","year":"2001","unstructured":"Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research\u00a049, 107\u2013118 (2001)","journal-title":"Operations Research"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1137\/S0363012996314130","volume":"36","author":"V. Baston","year":"1998","unstructured":"Baston, V., Gal, S.: Rendezvous on the line when the players\u2019 initial distance is given by an unknown probability distribution. SIAM J. on Control and Optimization\u00a036, 1880\u20131889 (1998)","journal-title":"SIAM J. on Control and Optimization"},{"key":"28_CR8","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 Res. Log.\u00a048, 722\u2013731 (2001)","journal-title":"Naval Res. Log."},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks\u00a07(6), 609\u2013616 (2001)","journal-title":"Wireless Networks"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-04128-0_11","volume-title":"Algorithms - ESA 2009","author":"K. Buchin","year":"2009","unstructured":"Buchin, K.: Constructing Delaunay Triangulations along Space-Filling Curves. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 119\u2013130. Springer, Heidelberg (2009)"},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1383369.1383373","volume":"4","author":"R. Cohen","year":"2008","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms\u00a04(4), 1\u201318 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner: Asynchronous rendezvous with location information. In: Proc. of ICALP 2010 (2010)","DOI":"10.1007\/978-3-642-14162-1_42"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Automata, Languages and Programming","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-11476-2_14","volume-title":"Structural Information and Communication Complexity","author":"J. Czyzowicz","year":"2010","unstructured":"Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lignos, I., Martin, R.A., Sadakane, K., Sung, W.-K.: More Efficient Periodic Traversal in Anonymous Undirected Graphs. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 167\u2013181. Springer, Heidelberg (2010)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. of SODA 2010, pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"28_CR16","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0355, 315\u2013326 (2006)","journal-title":"Theoretical Computer Science"},{"key":"28_CR17","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., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11429647_12","volume-title":"Structural Information and Communication Complexity","author":"S. Dobrev","year":"2005","unstructured":"Dobrev, S., Jansson, J., Sadakane, K., Sung, W.-K.: Finding short right-hand-on-the-wall walks in graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 127\u2013139. Springer, Heidelberg (2005)"},{"issue":"5","key":"28_CR19","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00446-008-0075-z","volume":"21","author":"Y. Emek","year":"2009","unstructured":"Emek, Y., Gasieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C.: Broadcasting in UDG radio networks with unknown topology. Distributed Computing\u00a021(5), 331\u2013351 (2009)","journal-title":"Distributed Computing"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Emek, Y., Kantor, E., Peleg, D.: On the effect of the deployment setting on broadcasting in Euclidean radio networks. In: Proc. PODC 2008, pp. 223\u2013232 (2008)","DOI":"10.1145\/1400751.1400782"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-44693-1_22","volume-title":"STACS 2001","author":"P. Flocchini","year":"2001","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 247\u2013258. Springer, Heidelberg (2001)"},{"issue":"2-3","key":"28_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1287\/opre.47.6.974","volume":"47","author":"S. Gal","year":"1999","unstructured":"Gal, S.: Rendezvous search on the line. Operations Research\u00a047, 974\u2013976 (1999)","journal-title":"Operations Research"},{"issue":"5","key":"28_CR24","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.jcss.2007.09.004","volume":"74","author":"L. Gasieniec","year":"2008","unstructured":"Gasieniec, L., Klasing, R., Martin, R.A., Navarra, A., Zhang, X.: Fast periodic graph exploration with constant memory. J. on Computer Systems and Sciences\u00a074(5), 808\u2013822 (2008)","journal-title":"J. on Computer Systems and Sciences"},{"issue":"5","key":"28_CR25","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/83.499920","volume":"5","author":"C. Gotsman","year":"1996","unstructured":"Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing\u00a05(5), 794\u2013797 (1996)","journal-title":"IEEE Transactions on Image Processing"},{"issue":"1-3","key":"28_CR26","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.03.035","volume":"401","author":"D. Ilcinkas","year":"2008","unstructured":"Ilcinkas, D.: Setting Port Numbers for Fast Graph Exploration. Theor. Comput. Sci.\u00a0401(1-3), 236\u2013242 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proc. PODC\u201990, pp. 119\u2013131 (1990)","DOI":"10.1145\/93385.93409"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-92221-6_28","volume-title":"Principles of Distributed Systems","author":"R. Klasing","year":"2008","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of asynchronous oblivious robots on a ring. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 446\u2013462. Springer, Heidelberg (2008)"},{"key":"28_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R. Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science\u00a0390, 27\u201339 (2008)","journal-title":"Theoretical Computer Science"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-03816-7_43","volume-title":"Mathematical Foundations of Computer Science 2009","author":"A. Kosowski","year":"2009","unstructured":"Kosowski, A., Navarra, A.: Graph Decomposition for Improving Memoryless Periodic Exploration. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 501\u2013512. Springer, Heidelberg (2009)"},{"key":"28_CR31","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2008.02.010","volume":"399","author":"D. Kowalski","year":"2008","unstructured":"Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theoretical Computer Science\u00a0399, 141\u2013156 (2008)","journal-title":"Theoretical Computer Science"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Kozma, G., Lotker, Z., Sharir, M., Stupp, G.: Geometrically aware communication in random wireless networks. In: Proc. PODC 2004, pp. 310\u2013319 (2004)","DOI":"10.1145\/1011767.1011813"},{"key":"28_CR33","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: theory and practice. In: Proc. PODC 2003, pp. 63\u201372 (2003)","DOI":"10.1145\/872035.872044"},{"key":"28_CR35","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1137\/S036301299427816X","volume":"34","author":"W. Lim","year":"1996","unstructured":"Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. on Control and Optimization\u00a034, 1650\u20131665 (1996)","journal-title":"SIAM J. on Control and Optimization"},{"issue":"1","key":"28_CR36","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"14","author":"B. Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. IEEE Transactions on Knowledge Data Engineering\u00a014(1), 124\u2013141 (2001)","journal-title":"IEEE Transactions on Knowledge Data Engineering"},{"key":"28_CR37","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","volume":"384","author":"G. Prencipe","year":"2007","unstructured":"Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science\u00a0384, 222\u2013231 (2007)","journal-title":"Theoretical Computer Science"},{"key":"28_CR38","volume-title":"The strategy of conflict","author":"T. Schelling","year":"1960","unstructured":"Schelling, T.: The strategy of conflict. Oxford University Press, Oxford (1960)"},{"key":"28_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-95891-8_45","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"G. Stachowiak","year":"2009","unstructured":"Stachowiak, G.: Asynchronous Deterministic Rendezvous on the Line. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 497\u2013508. Springer, Heidelberg (2009)"},{"key":"28_CR40","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608 (2007)"},{"key":"28_CR41","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1057\/jors.1992.89","volume":"43","author":"L. Thomas","year":"1992","unstructured":"Thomas, L.: Finding your kids when they are lost. Journal on Operational Res. Soc.\u00a043, 637\u2013639 (1992)","journal-title":"Journal on Operational Res. Soc."},{"key":"28_CR42","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/978-3-540-71701-0_112","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Xu","year":"2007","unstructured":"Xu, B., Chen, D.Z.: Density-Based Data Clustering Algorithms for Lower Dimensions Using Space-Filling Curves. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04426, pp. 997\u20131005. Springer, Heidelberg (2007)"},{"key":"28_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:46Z","timestamp":1606185586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}