{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:26Z","timestamp":1725507026088},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_52","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T08:38:35Z","timestamp":1207211915000},"page":"605-616","source":"Crossref","is-referenced-by-count":19,"title":["Randomized Rendez-Vous with Limited Memory"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Kranakis","sequence":"first","affiliation":[]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_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 of Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM Journal of Control and Optimization"},{"key":"52_CR2","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, Norwell, Massachusetts (2003)"},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0406029","volume":"6","author":"D. Coppersmith","year":"1993","unstructured":"Coppersmith, D., Tetali, P., Winkler, P.: Collisions among random walks on a graph. SIAM Journal of Discrete Mathematics\u00a06, 363\u2013374 (1993)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"52_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-540-39658-1_19","volume-title":"Algorithms - ESA 2003","author":"A. Dessmark","year":"2003","unstructured":"Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic rendezvous in graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 184\u2013195. Springer, Heidelberg (2003)"},{"key":"52_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-27860-3_6","volume-title":"Principles of Distributed Systems","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Multiple agents rendezvous in a ring in spite of a black hole. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol.\u00a03144, pp. 34\u201346. Springer, Heidelberg (2004)"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-27796-5_15","volume-title":"Structural Information and Communication Complexity","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F., Santoro, N., Sawchuk, C.: Mobile agent rendezvous when tokens fail. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 161\u2013172. Springer, Heidelberg (2004)"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/978-3-540-24698-5_62","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple mobile agent rendezvous in the ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 599\u2013608. Springer, Heidelberg (2004)"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11611257_26","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"L. Gasieniec","year":"2006","unstructured":"Gasieniec, L., Kranakis, E., Krizanc, D., Zhang, X.: Optimal memory rendezvous of anonymous mobile agents in a uni-directional ring. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 282\u2013292. Springer, Heidelberg (2006)"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11780823_5","volume-title":"Structural Information and Communication Complexity","author":"D. Kowalski","year":"2006","unstructured":"Kowalski, D., Malinowski, A.: How to meet in an anonymous network. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 44\u201358. Springer, Heidelberg (2006)"},{"key":"52_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1007\/978-3-540-30551-4_56","volume-title":"Algorithms and Computation","author":"D. Kowalski","year":"2004","unstructured":"Kowalski, D., Pelc, A.: Polynomial deterministic rendezvous in arbitrary graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 644\u2013656. Springer, Heidelberg (2004)"},{"key":"52_CR11","unstructured":"Kranakis, E., Krizanc, D.: An algorithmic theory of mobile agents. In: Symposium on Trustworthy Global Computing (2006)"},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/11682462_60","volume-title":"LATIN 2006: Theoretical Informatics","author":"E. Kranakis","year":"2006","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: Mobile agent rendezvous in a synchronous torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 653\u2013664. Springer, Heidelberg (2006)"},{"key":"52_CR13","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., Rajasbaum, S.: Mobile agent rendezvous: A survey. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 1\u20139. Springer, Heidelberg (2006)"},{"key":"52_CR14","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous search problem in the ring. In: Proc. International Conference on Distributed Computing Systems (ICDCS), pp. 592\u2013599 (2003)"},{"key":"52_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11549345_24","volume-title":"Mathematical Foundations of Computer Science 2005","author":"G. Marco De","year":"2005","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vacaro, U.: Asynchronous deterministic rendezvous in graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 271\u2013282. Springer, Heidelberg (2005)"},{"key":"52_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"52_CR17","volume-title":"Probability Models for Computer Science","author":"S.M. Ross","year":"2002","unstructured":"Ross, S.M.: Probability Models for Computer Science. Harcourt Academic Press, London (2002)"},{"key":"52_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1011219024159","volume":"11","author":"N. Roy","year":"2001","unstructured":"Roy, N., Dudek, G.: Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations. Autonomous Robots\u00a011, 117\u2013136 (2001)","journal-title":"Autonomous Robots"},{"key":"52_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/0470072644","volume-title":"Design and Analysis of Distributed Algorithms","author":"N. Santoro","year":"2006","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, Hoboken (2006)"},{"key":"52_CR20","unstructured":"Sawchuk, C.: Mobile Agent Rendezvous in the Ring. PhD thesis, Carleton University, School of Computer Science, Ottawa, Canada (2004)"},{"key":"52_CR21","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 of Computing\u00a028, 1347\u20131363 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"52_CR22","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","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:45Z","timestamp":1619522505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_52","relation":{},"subject":[]}}