{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:18Z","timestamp":1759637538942,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","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-14162-1_42","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"502-514","source":"Crossref","is-referenced-by-count":23,"title":["Tell Me Where I Am So I Can Meet You Sooner"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Collins","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":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_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":"42_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. Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. Control and Optimization"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"S. Alpern","year":"1999","unstructured":"Alpern, S., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. App. Probability\u00a036, 223\u2013231 (1999)","journal-title":"J. App. Probability"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Anderson, E., Lin, J., Morse, A.S.: The Multi-Agent Rendezvous Problem - The Asynchronous Case. In: 43rd IEEE Conf. on Decision and Control, pp. 1926\u20131931 (2004)","DOI":"10.1109\/CDC.2004.1430329"},{"key":"42_CR5","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":"42_CR6","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/S0363012993260707","volume":"33","author":"E. Anderson","year":"1995","unstructured":"Anderson, E., Essegaier, S.: Rendezvous search on the line with indistinguishable players. SIAM J. on Control and Optimization\u00a033, 1637\u20131642 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"42_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"},{"issue":"6","key":"42_CR8","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":"42_CR9","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)"},{"key":"42_CR10","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":"42_CR11","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Ilcinkas, D., Labourel, A., Pelc, A.: Asynchronous deterministic rendezvous in bounded terrains. In: SIROCCO (2010)","DOI":"10.1007\/978-3-642-13284-1_7"},{"key":"42_CR12","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":"42_CR13","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to Meet when you Forget: Log-space Rendezvous in Arbitrary Graphs. In: Proc. of 29th Ann. Symp. on Principles of Distributed Computing, PODC 2010 (to appear, 2010)"},{"key":"42_CR14","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. Th. Comp. Sc.\u00a0355, 315\u2013326 (2006)","journal-title":"Th. Comp. Sc."},{"key":"42_CR15","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"},{"issue":"5","key":"42_CR16","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":"42_CR17","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":"42_CR18","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)"},{"key":"42_CR19","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":"42_CR20","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":"2","key":"42_CR21","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TRO.2009.2013493","volume":"25","author":"A. Ganguli","year":"2009","unstructured":"Ganguli, A., Cort\u00e9s, J., Bullo, F.: Multirobot rendezvous with visibility sensors in nonconvex environments. IEEE Transactions on Robotics\u00a025(2), 340\u2013352 (2009)","journal-title":"IEEE Transactions on Robotics"},{"issue":"5","key":"42_CR22","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"},{"key":"42_CR23","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. Th. Comp. Science\u00a0399, 141\u2013156 (2008)","journal-title":"Th. Comp. Science"},{"key":"42_CR24","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":"42_CR25","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"},{"issue":"1","key":"42_CR26","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"},{"issue":"5","key":"42_CR27","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02187806","volume":"5","author":"M.S. Paterson","year":"1990","unstructured":"Paterson, M.S., Yao, F.F.: Efficient binary space partitions for hidden-surface removal and solid modeling. Discr. and Comp. Geom.\u00a05(5), 485\u2013503 (1990)","journal-title":"Discr. and Comp. Geom."},{"issue":"2","key":"42_CR28","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. Surveys\u00a016(2), 187\u2013260 (1984)","journal-title":"Surveys"},{"key":"42_CR29","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":"42_CR30","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 Trans. Parallel Dist. Syst.\u00a07, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Dist. Syst."},{"key":"42_CR31","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","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:26:28Z","timestamp":1740241588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_42"}},"subtitle":["(Asynchronous Rendezvous with Location Information)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}