{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T18:33:36Z","timestamp":1790188416189,"version":"4.1.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030110710","type":"print"},{"value":"9783030110727","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11072-7_17","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T08:03:00Z","timestamp":1547280180000},"page":"423-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Deterministic Rendezvous Algorithms"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pelc","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"17_CR1","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. Oper. Res. 50, 772\u2013795 (2002)","journal-title":"Oper. Res."},{"key":"17_CR2","series-title":"International Series in Operations Research and Management Science","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. International Series in Operations Research and Management Science. Kluwer Academic Publishers, Norwell (2003)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2013.01.022","volume":"478","author":"D Baba","year":"2013","unstructured":"Baba, D., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Linear time and space gathering of anonymous mobile agents in asynchronous trees. Theor. Comput. Sci. 478, 118\u2013126 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR4","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. 6343, pp. 297\u2013311. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_28"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00446-016-0276-9","volume":"29","author":"S Bouchard","year":"2016","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Ducourthial, B.: Byzantine gathering in networks. Distrib. Comput. 29, 435\u2013457 (2016)","journal-title":"Distrib. Comput."},{"key":"17_CR6","unstructured":"Bouchard, S., Bournat, M., Dieudonn\u00e9, Y., Dubois, S., Petit, F.: Asynchronous approach in the plane: a deterministic polynomial algorithm. In: Proceedings of 31st International Symposium on Distributed Computing (DISC 2017), pp. 8:1\u20138:16 (2017)"},{"key":"17_CR7","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Lamani, A.: Byzantine gathering in polynomial time. In: Proceedings of 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pp. 147:1\u2013147:15 (2018)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2018.01.003","volume":"133","author":"S Bouchard","year":"2018","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Pelc, A., Petit, F.: Deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133, 39\u201343 (2018)","journal-title":"Inf. Process. Lett."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00446-015-0259-2","volume":"29","author":"J Chalopin","year":"2016","unstructured":"Chalopin, J., Dieudonn\u00e9, Y., Labourel, A., Pelc, A.: Rendezvous in networks in spite of delay faults. Distrib. Comput. 29, 187\u2013205 (2016)","journal-title":"Distrib. Comput."},{"key":"17_CR10","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. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 502\u2013514. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_42"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15763-9_15","volume-title":"Distributed Computing","author":"A Cornejo","year":"2010","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 148\u2013162. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_15"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Time vs. space trade-offs for rendezvous in trees. Distrib. Comput. 27, 95\u2013109 (2014)","DOI":"10.1007\/s00446-013-0201-4"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00224-011-9379-7","volume":"52","author":"J Czyzowicz","year":"2013","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains. Theory Comput. Syst. 52, 179\u2013199 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2344422.2344427","volume":"8","author":"Jurek Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, 37:1\u201337:14 (2012)","journal-title":"ACM Transactions on Algorithms"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-09620-9_23","volume-title":"Structural Information and Communication Complexity","author":"S Das","year":"2014","unstructured":"Das, S., Dereniowski, D., Kosowski, A., Uzna\u0144ski, P.: Rendezvous of distance-aware mobile agents in unknown graphs. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 295\u2013310. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09620-9_23"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G De Marco","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoret. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR18","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 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/s00453-015-9982-0","volume":"74","author":"Y Dieudonn\u00e9","year":"2016","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. Algorithmica 74, 908\u2013946 (2016)","journal-title":"Algorithmica"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-014-0216-5","volume":"28","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Deterministic polynomial approach in the plane. Distrib. Comput. 28, 111\u2013129 (2015)","journal-title":"Distrib. Comput."},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2013.12.023","volume":"524","author":"Y Dieudonn\u00e9","year":"2014","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Price of asynchrony in mobile agents computing. Theoret. Comput. Sci. 524, 59\u201367 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11, 1:1\u20131:28 (2014)","DOI":"10.1145\/2629656"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/130931990","volume":"44","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44, 844\u2013867 (2015)","journal-title":"SIAM J. Comput."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1142\/S012905411750006X","volume":"28","author":"S Elouasbi","year":"2017","unstructured":"Elouasbi, S., Pelc, A.: Deterministic rendezvous with detection using beeps. Int. J. Found. Comput. Sci. 28, 77\u201397 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.3233\/FI-2018-1684","volume":"160","author":"S Elouasbi","year":"2018","unstructured":"Elouasbi, S., Pelc, A.: Deterministic meeting of sniffing agents in the plane. Fundam. Informaticae 160, 281\u2013301 (2018)","journal-title":"Fundam. Informaticae"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-31104-8_25","volume-title":"Structural Information and Communication Complexity","author":"S Elouasbi","year":"2012","unstructured":"Elouasbi, S., Pelc, A.: Time of anonymous rendezvous in trees: determinism vs. randomization. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 291\u2013302. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31104-8_25"},{"issue":"2","key":"17_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2438645.2438649","volume":"9","author":"Pierre Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9, 17:1\u201317:24 (2013)","journal-title":"ACM Transactions on Algorithms"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-25873-2_29","volume-title":"Principles of Distributed Systems","author":"S Guilbault","year":"2011","unstructured":"Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 421\u2013434. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_29"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/S0022-0000(02)00023-5","volume":"65","author":"M Kouck\u1ef3","year":"2002","unstructured":"Kouck\u1ef3, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717\u2013726 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR30","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. Theoret. Comput. Sci. 399, 141\u2013156 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00278ED1V01Y201004DCT001","volume":"1","author":"Evangelos Kranakis","year":"2010","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Morgan and Claypool Publishers, San Rafael (2010)","journal-title":"Synthesis Lectures on Distributed Computing Theory"},{"key":"17_CR32","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. 4056, pp. 1\u20139. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780823_1"},{"key":"17_CR33","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00446-015-0253-8","volume":"29","author":"A Miller","year":"2016","unstructured":"Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. Distrib. Comput. 29, 51\u201364 (2016)","journal-title":"Distrib. Comput."},{"key":"17_CR34","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.tcs.2015.09.025","volume":"608","author":"A Miller","year":"2015","unstructured":"Miller, A., Pelc, A.: Fast rendezvous with advice. Theoret. Comput. Sci. 608, 190\u2013198 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-69084-1_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"F Ooshita","year":"2017","unstructured":"Ooshita, F., Datta, A.K., Masuzawa, T.: Self-stabilizing rendezvous of synchronous mobile agents in graphs. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 18\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_2"},{"key":"17_CR36","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"key":"17_CR37","unstructured":"Pelc, A.: Deterministic gathering with crash faults, CoRR abs\/1704.08880 (2017)"},{"key":"17_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1\u201324 (2008)","journal-title":"J. ACM"},{"key":"17_CR39","volume-title":"The Strategy of Conflict","author":"T Schelling","year":"1960","unstructured":"Schelling, T.: The Strategy of Conflict. Oxford University Press, Oxford (1960)"},{"key":"17_CR40","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\u00a0line. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 497\u2013508. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95891-8_45"},{"key":"17_CR41","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2601068","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. ACM Trans. Algorithms 10, 12:1\u201312:15 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR42","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. 7, 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing by Mobile Entities"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11072-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:26:58Z","timestamp":1710250018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11072-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030110710","9783030110727"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11072-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}