{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:59:01Z","timestamp":1725998341329},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030013240"},{"type":"electronic","value":"9783030013257"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01325-7_14","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T13:43:05Z","timestamp":1540906985000},"page":"121-133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Symmetric Rendezvous with Advice: How to Rendezvous in a Disk"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Georgiou","sequence":"first","affiliation":[]},{"given":"Jay","family":"Griffiths","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Yakubov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"14_CR1","unstructured":"Alpern, S.: Hide and seek games. Seminar (1976)"},{"issue":"3","key":"14_CR2","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 J. Control Optim. 33(3), 673\u2013711 (1995)","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"14_CR3","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(5), 772\u2013795 (2002)","journal-title":"Oper. Res."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-1-4614-6825-7_14","volume-title":"Ten Open Problems in Rendezvous Search","author":"S Alpern","year":"2013","unstructured":"Alpern, S.: Ten Open Problems in Rendezvous Search, pp. 223\u2013230. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7_14"},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1287\/opre.1050.0217","volume":"53","author":"S Alpern","year":"2005","unstructured":"Alpern, S., Baston, V.: Rendezvous on a planar lattice. Oper. Res. 53(6), 996\u20131006 (2005)","journal-title":"Oper. Res."},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ejor.2005.03.050","volume":"175","author":"S Alpern","year":"2006","unstructured":"Alpern, S., Baston, V.: A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. 175(2), 688\u2013706 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1137\/S0363012904443531","volume":"44","author":"S Alpern","year":"2006","unstructured":"Alpern, S., Baston, V.: Rendezvous in higher dimensions. SIAM J. Control Optim. 44(6), 2233\u20132252 (2006)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1137\/S0363012993260288","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern, S., Gal, S.: Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. 33(4), 1270\u20131276 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. In: International Series in Operations Research & Management Science, vol. 55. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/b100809","DOI":"10.1007\/b100809"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1002\/nav.10005","volume":"49","author":"Steve Alpern and Wei Shi Lim","year":"2002","unstructured":"Steve Alpern and Wei Shi Lim: Rendezvous of three agents on the line. Naval Res. Logist. (NRL) 49(3), 244\u2013255 (2002)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-33651-5_4","volume-title":"Distributed Computing","author":"J Anaya","year":"2012","unstructured":"Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vax\u00e8s, Y.: Collecting information by power-aware mobile agents. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 46\u201360. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_4"},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/3214827","volume":"27","author":"EJ Anderson","year":"1990","unstructured":"Anderson, E.J., Weber, R.R.: The rendezvous problem on discrete locations. J. Appl. Probab. 27(4), 839\u2013851 (1990)","journal-title":"J. Appl. Probab."},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/S0363012993260707","volume":"33","author":"EJ Anderson","year":"1995","unstructured":"Anderson, E.J., Essegaier, S.: Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. 33(6), 1637\u20131642 (1995)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00224-005-1223-5","volume":"40","author":"L Barri\u00e8re","year":"2007","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory Comput. Syst. 40(2), 143\u2013162 (2007)","journal-title":"Theory Comput. Syst."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/(SICI)1520-6750(199904)46:3<335::AID-NAV6>3.0.CO;2-Q","volume":"46","author":"VJ Baston","year":"1999","unstructured":"Baston, V.J.: Two rendezvous search problems on the line. Naval Res. Logist. 46, 335\u2013340 (1999)","journal-title":"Naval Res. Logist."},{"issue":"6","key":"14_CR16","doi-asserted-by":"publisher","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(6), 1880\u20131889 (1998)","journal-title":"SIAM J. Control Optim."},{"key":"14_CR17","unstructured":"Beveridge, A., Ozsoyeller, D., Isler, V.: Symmetric rendezvous on the line with an unknown initial distance. Technical report (2011)"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/opre.1030.0085","volume":"52","author":"EJ Chester","year":"2004","unstructured":"Chester, E.J., T\u00fct\u00fcnc\u00fc, R.H.: Rendezvous search on the labeled line. Oper. Res. 52(2), 330\u2013334 (2004)","journal-title":"Oper. Res."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-24100-0_42","volume-title":"Distributed Computing","author":"A Collins","year":"2011","unstructured":"Collins, A., Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Martin, R.: Synchronous rendezvous for location-aware agents. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 447\u2013459. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_42"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-02930-1_33","volume-title":"Automata, Languages and Programming","author":"C Cooper","year":"2009","unstructured":"Cooper, C., Frieze, A., Radzik, T.: Multiple random walks and interacting particle systems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 399\u2013410. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_33"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-77566-9_20","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"J Czyzowicz","year":"2008","unstructured":"Czyzowicz, J., Dobrev, S., Kranakis, E., Krizanc, D.: The power of tokens: rendezvous and symmetry detection for two mobile agents in\u00a0a ring. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 234\u2013246. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77566-9_20"},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/2344422.2344427","volume":"8","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37:1\u201337:14 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR23","unstructured":"Das, S.: Distributed computing with mobile agents: solving rendezvous and related problems. Ph.D. thesis, University of Ottawa, Canada (2007)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-77444-0_29","volume-title":"Distributed Computing and Networking","author":"S Das","year":"2007","unstructured":"Das, S.: Mobile agent rendezvous in a ring using faulty tokens. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 292\u2013297. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77444-0_29"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-28472-9_16","volume-title":"Algorithms for Sensor Systems","author":"S Das","year":"2015","unstructured":"Das, S., Luccio, F.L., Markou, E.: Mobile agents rendezvous in spite of a malicious agent. In: Bose, P., G\u0105sieniec, L.A., R\u00f6mer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 211\u2013224. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28472-9_16"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45249-9_1","volume-title":"Distributed Computing and Networking","author":"O Feinerman","year":"2014","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast Rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1\u201313. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45249-9_1"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 a ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 599\u2013608. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_62"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Griffiths, J., Yakubov, Y.: Symmetric rendezvous with advice: How to rendezvous in a disk. CoRR, abs\/1805.03351 (2018)","DOI":"10.1007\/978-3-030-01325-7_14"},{"issue":"3","key":"14_CR29","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1287\/opre.1070.0439","volume":"56","author":"Q Han","year":"2008","unstructured":"Han, Q., Donglei, D., Vera, J., Zuluaga, L.F.: Improved bounds for the symmetric rendezvous value on the line. Oper. Res. 56(3), 772\u2013782 (2008)","journal-title":"Oper. Res."},{"key":"14_CR30","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. 3887, pp. 653\u2013664. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_60"},{"issue":"1","key":"14_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. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2010)","journal-title":"Synthesis Lectures on Distributed Computing Theory"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Santoro, N., Sawchuk, C., Krizanc, D.: Mobile agent rendezvous in a ring. In: Distributed Computing Systems, pp. 592\u2013599. IEEE (2003)","DOI":"10.1007\/978-3-540-24698-5_62"},{"issue":"3","key":"14_CR33","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(3), 331\u2013347 (2012)","journal-title":"Networks"},{"issue":"2\u20133","key":"14_CR34","doi-asserted-by":"publisher","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(2\u20133), 222\u2013231 (2007)","journal-title":"Theor. Comput. Sci"},{"issue":"3","key":"14_CR35","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(3), 12:1\u201312:15 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"14_CR36","unstructured":"Patchrawat Patch Uthaisombut: Symmetric rendezvous search on the line using move patterns with different lengths. Working paper (2006)"}],"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-030-01325-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T18:28:01Z","timestamp":1572373681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01325-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030013240","9783030013257"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01325-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ma'ale HaHamisha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/sirocco2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1.97","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}