{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:15:45Z","timestamp":1743653745599,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_25","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"291-302","source":"Crossref","is-referenced-by-count":4,"title":["Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization"],"prefix":"10.1007","author":[{"given":"Samir","family":"Elouasbi","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science. Kluwer Academic Publisher (2002)"},{"key":"25_CR2","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":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-13284-1_8","volume-title":"Structural Information and Communication Complexity","author":"D. Baba","year":"2010","unstructured":"Baba, D., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 86\u2013100. Springer, Heidelberg (2010)"},{"key":"25_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.\u00a06343, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"key":"25_CR5","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 Reaserch Logistics\u00a048, 722\u2013731 (2001)","journal-title":"Naval Reaserch Logistics"},{"key":"25_CR6","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":"25_CR7","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 Symposium on Principles of Distributed Computing (PODC 2010), pp. 450\u2013459 (2010)","DOI":"10.1145\/1835698.1835801"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. 21st Ann. ACM Symp. on Discr. Algorithms (SODA 2010), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local O(n2) gathering algorithm. In: Proc. 22nd Ann. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 217\u2013223 (2010)","DOI":"10.1145\/1810479.1810523"},{"key":"25_CR10","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":"25_CR11","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":"25_CR12","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":"25_CR13","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ArXiv: 1102.0467v1 (2011)","DOI":"10.1145\/1810479.1810524"},{"key":"25_CR14","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":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-78773-0_52","volume-title":"LATIN 2008: Theoretical Informatics","author":"E. Kranakis","year":"2008","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with Limited Memory. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 605\u2013616. Springer, Heidelberg (2008)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd Int. Conf. on Distr. Computing Systems (ICDCS 2003), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"25_CR17","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599\u2013608 (2007)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. 18th Annual IEEE Conference on Foundations of Computer Science (FOCS 1977), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"},{"key":"25_CR19","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","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T14:48:50Z","timestamp":1743605330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}