{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T19:00:18Z","timestamp":1774292418550,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642240997","type":"print"},{"value":"9783642241000","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24100-0_42","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T02:20:40Z","timestamp":1318990840000},"page":"447-459","source":"Crossref","is-referenced-by-count":17,"title":["Synchronous Rendezvous for Location-Aware Agents"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Collins","sequence":"first","affiliation":[]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","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 Journal on Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM Journal on Control and Optimization"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1017\/S0021900200016983","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"},{"issue":"5","key":"42_CR3","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1287\/opre.50.5.772.363","volume":"50","author":"S. Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous Search: A Personal Perspective. Operations Research\u00a050(5), 772\u2013795 (2002)","journal-title":"Operations Research"},{"key":"42_CR4","volume-title":"The Theory of Search Games and Rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symposium on Computational Geometry, pp. 365\u2013373 (1998)","DOI":"10.1145\/276884.276925"},{"key":"42_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"},{"issue":"5","key":"42_CR7","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H. Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation\u00a015(5), 818\u2013828 (1999)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-15763-9_28","volume-title":"Distributed Computing","author":"E. Bampas","year":"2010","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"key":"42_CR9","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 player\u2019s 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":"42_CR10","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, 722\u2013731 (2001)","journal-title":"Naval Research Logistics"},{"key":"42_CR11","volume-title":"Extremal Graph Theory","author":"B. Bollobas","year":"1978","unstructured":"Bollobas, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"issue":"6","key":"42_CR12","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. SIAM Journal on Computing\u00a034(6), 1516\u20131528 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14162-1_42","volume-title":"Automata, Languages and Programming","author":"A. Collins","year":"2010","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner (Asynchronous rendezvous with location information). In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 502\u2013514. Springer, Heidelberg (2010)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs. In: Proc. 29th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010), pp. 450\u2013459 (2010)","DOI":"10.1145\/1835698.1835801"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to Meet Asynchronously (Almost) Everywhere. In: Proc. 21st ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"42_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":"42_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":"42_CR18","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/S089548010444167X","volume":"20","author":"F. Dragano","year":"2006","unstructured":"Dragano, F., Yano, C., Lomonosov, I.: Collective tree spanners of graphs. SIAM Journal on Discrete Mathematics\u00a020, 240\u2013260 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"5","key":"42_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., G\u0105sieniec, 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_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. 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2008), pp. 223\u2013232 (2008)","DOI":"10.1145\/1400751.1400782"},{"key":"#cr-split#-42_CR21.1","unstructured":"5. Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proc. 6th ACM Symposium on Discrete Algorithms (SODA 1995), pp. 577-585 (1995)"},{"key":"#cr-split#-42_CR21.2","doi-asserted-by":"crossref","unstructured":"6. Also in J. of Algorithms??46, 1-20 (2003)","DOI":"10.1016\/S0196-6774(02)00292-4"},{"key":"42_CR22","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"},{"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. Theoretical Computer Science\u00a0399, 141\u2013156 (2008)","journal-title":"Theoretical Computer 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. 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2004), pp. 310\u2013319 (2004)","DOI":"10.1145\/1011767.1011813"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Lectures on Distributed Computing Theory. Morgan and Claypool Publishers (2010)","DOI":"10.2200\/S00278ED1V01Y201004DCT001"},{"key":"42_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11780823_1","volume-title":"Structural Information and Communication Complexity","author":"E. Kranakis","year":"2006","unstructured":"Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: A survey. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 1\u20139. Springer, Heidelberg (2006)"},{"issue":"1","key":"42_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R. Olfati-Saber","year":"2007","unstructured":"Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and Cooperation in Networked Multi-Agent Systems. Proc. of IEEE\u00a095(1), 215\u2013233 (2007)","journal-title":"Proc. of IEEE"},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Transactions on Autonomous and Adaptive Systems\u00a04(1) (2009)","DOI":"10.1145\/1462187.1462196"},{"issue":"4","key":"42_CR29","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I. Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM Journal on Computing\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR30","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)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24100-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T22:48:13Z","timestamp":1560811693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24100-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240997","9783642241000"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24100-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}