{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T09:16:37Z","timestamp":1791191797469,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_1","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T02:20:40Z","timestamp":1318990840000},"page":"1-15","source":"Crossref","is-referenced-by-count":5,"title":["DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pelc","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"1_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. Operations Research\u00a050, 772\u2013795 (2002)","journal-title":"Operations Research"},{"key":"1_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 Acad. Publ., Dordrecht (2003)"},{"key":"1_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":"1_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., Gasieniec, 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":"1_CR5","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":"1_CR6","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":"1_CR7","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Time vs. space trade-offs for rendezvous in trees (submitted)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. In: Proc. 21st ACM-SIAM Symp. on Discrete Algorithms (SODA 2010), pp. 22\u201330 (2010)","DOI":"10.1137\/1.9781611973075.3"},{"key":"1_CR9","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":"1_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":"1_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<165::AID-NET1>3.0.CO;2-I","volume":"32","author":"P. Flocchini","year":"1998","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definition, properties and classes. Networks\u00a032, 165\u2013180 (1998)","journal-title":"Networks"},{"key":"1_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":"1_CR13","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. In: Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 224\u2013232 (2010)","DOI":"10.1145\/1810479.1810524"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees, arXiv:1102.0467v1 [cs.DC]","DOI":"10.1145\/2438645.2438649"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-13284-1_9","volume-title":"Structural Information and Communication Complexity","author":"T. Izumi","year":"2010","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile robots gathering algorithm with local weak multiplicity in rings. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 101\u2013113. Springer, Heidelberg (2010)"},{"key":"1_CR16","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":"1_CR17","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":"1_CR18","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":"1_CR19","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring. Morgan and Claypool Publishers (2010)","DOI":"10.2200\/S00278ED1V01Y201004DCT001"},{"key":"1_CR20","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)"},{"key":"1_CR21","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 Line. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 497\u2013508. Springer, Heidelberg (2009)"},{"key":"1_CR22","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":"1_CR23","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."}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T22:47:49Z","timestamp":1560811669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24100-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240997","9783642241000"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24100-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}