{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:11Z","timestamp":1783576871850,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258725","type":"print"},{"value":"9783642258732","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-25873-2_29","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T10:16:34Z","timestamp":1323339394000},"page":"421-434","source":"Crossref","is-referenced-by-count":19,"title":["Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Guilbault","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_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 J. on Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S. Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics\u00a049, 256\u2013274 (2002)","journal-title":"Naval Reaserch Logistics"},{"key":"29_CR3","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science, vol.\u00a055. Kluwer Academic Publishers (2002)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1017\/S0021900200028011","volume":"28","author":"E. Anderson","year":"1990","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability\u00a028, 839\u2013851 (1990)","journal-title":"Journal of Applied Probability"},{"key":"29_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":"29_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":"29_CR7","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":"29_CR8","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":"29_CR9","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":"29_CR10","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Doyle, P., Raghavan, P., Snir, M.: Random walks on weighted graphs, and applications to on-line algorithms. In: Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC 1990), pp. 369\u2013378 (1990)","DOI":"10.1145\/100216.100266"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"29_CR12","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":"29_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., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"29_CR14","unstructured":"Feller, W.: An introduction to probability theory and its applications. Wiley (1968)"},{"key":"29_CR15","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":"29_CR16","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":"29_CR17","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":"29_CR18","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":"29_CR19","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":"29_CR20","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":"29_CR21","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"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Pelc, A.: DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 1\u201315. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_1"},{"key":"29_CR23","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":"29_CR24","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":"29_CR25","doi-asserted-by":"publisher","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":"29_CR26","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 Distrib. Syst.\u00a07, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"29_CR27","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T01:51:48Z","timestamp":1555811508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}