{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T09:52:02Z","timestamp":1724752322753},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,9]],"date-time":"2011-12-09T00:00:00Z","timestamp":1323388800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00224-011-9379-7","type":"journal-article","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T04:50:11Z","timestamp":1323319811000},"page":"179-199","source":"Crossref","is-referenced-by-count":8,"title":["Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains"],"prefix":"10.1007","volume":"52","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,9]]},"reference":[{"key":"9379_CR1","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33, 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"9379_CR2","series-title":"Int. Series in Operations Research and Management Science","volume-title":"The Theory of Search Games and Rendezvous","author":"S. Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Int. Series in Operations Research and Management Science, vol.\u00a055. Kluwer Academic, Norwell (2002)"},{"key":"9379_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"J. Alpern","year":"1999","unstructured":"Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. Appl. Probab. 36, 223\u2013231 (1999)","journal-title":"J. Appl. Probab."},{"key":"9379_CR4","doi-asserted-by":"crossref","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. Oper. Res. 49, 107\u2013118 (2001)","journal-title":"Oper. Res."},{"key":"9379_CR5","doi-asserted-by":"crossref","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. Control Optim. 36, 1880\u20131889 (1998)","journal-title":"SIAM J. Control Optim."},{"key":"9379_CR6","series-title":"LNCS","first-page":"87","volume-title":"Proc. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009)","author":"D. Bilo","year":"2009","unstructured":"Bilo, D., Disser, Y., Mihalak, M., Suri, S., Vicari, E., Widmayer, P.: Reconstructing visibility graphs with simple robots. In: Proc. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009). LNCS, vol. 5869, pp. 87\u201399 (2009)"},{"key":"9379_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP 2003)","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP 2003). LNCS, vol. 2719, pp. 1181\u20131196 (2003)"},{"key":"9379_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-642-13284-1_7","volume-title":"Proc. 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010)","author":"J. Czyzowicz","year":"2010","unstructured":"Czyzowicz, J., Ilcinkas, D., Labourel, A., Pelc, A.: Asynchronous deterministic rendezvous in bounded terrains. In: Proc. 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010). LNCS, vol. 6058, pp. 72\u201385 (2010)"},{"key":"9379_CR9","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/1.9781611973075.3","volume-title":"Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)","author":"J. Czyzowicz","year":"2010","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)"},{"key":"9379_CR10","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 355, 315\u2013326 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9379_CR11","doi-asserted-by":"crossref","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":"9379_CR12","series-title":"LNCS","first-page":"247","volume-title":"Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (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: Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001). LNCS, vol. 2010, pp. 247\u2013258 (2001)"},{"key":"9379_CR13","series-title":"LNCS","first-page":"242","volume-title":"Proc. 22nd International Symposium on Distributed Computing (DISC 2008)","author":"P. Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Proc. 22nd International Symposium on Distributed Computing (DISC 2008). LNCS, vol. 5218, pp. 242\u2013256 (2008)"},{"key":"9379_CR14","doi-asserted-by":"crossref","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. Oper. Res. 47, 974\u2013976 (1999)","journal-title":"Oper. Res."},{"key":"9379_CR15","series-title":"LNCS","first-page":"446","volume-title":"Proc. 12th International Conference on Principles of Distributed Systems (OPODIS 2008)","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: Proc. 12th International Conference on Principles of Distributed Systems (OPODIS 2008). LNCS, vol. 5401, pp. 446\u2013462 (2008)"},{"key":"9379_CR16","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 390, 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9379_CR17","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 399, 141\u2013156 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9379_CR18","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/ICDCS.2003.1203510","volume-title":"Proc. 23rd International Conference on Distributed Computing Systems (ICDCS 2003)","author":"E. Kranakis","year":"2003","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)"},{"key":"9379_CR19","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 384, 222\u2013231 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9379_CR20","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-540-95891-8_45","volume-title":"Proc. 35th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009)","author":"G. Stachowiak","year":"2009","unstructured":"Stachowiak, G.: Asynchronous Deterministic Rendezvous on the Line. In: Proc. 35th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009). LNCS, vol. 5404, pp.\u00a0497\u2013508 (2009)"},{"key":"9379_CR21","first-page":"599","volume-title":"Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)","author":"A. Ta-Shma","year":"2007","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.\u00a0599\u2013608 (2007)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9379-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9379-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9379-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:23Z","timestamp":1558698863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9379-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,9]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9379"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9379-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,9]]}}}