{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:48Z","timestamp":1759638348060,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_14","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"168-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistically Faulty Searching on a Half-Line"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Calum","family":"MacRury","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"key":"14_CR1","unstructured":"Ahlswede, R., Wegener, I.: Search problems. Wiley-Interscience (1987)"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164\u20131188 (2000)","journal-title":"SIAM J. Comput."},{"key":"14_CR3","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. Springer, Berlin (2003)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Alpern, S., Fokkink, R., Gasieniec, L., Lindelauf, R., Subrahmanian, V. (eds.): Search Theory: A Game Theoretic Perspective, pp. 223\u2013230. Springer NY, New York (2013)","DOI":"10.1007\/978-1-4614-6825-7"},{"key":"14_CR5","unstructured":"Angelopoulos, S.: Further connections between contract-scheduling and ray-searching problems. In: 0001, Q.Y., Wooldridge, M.J. (eds.) Proceedings of the 24th International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 1516\u20131522. AAAI Press (2015)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2019.01.039","volume":"260","author":"S Angelopoulos","year":"2019","unstructured":"Angelopoulos, S., D\u00fcrr, C., Lidbetter, T.: The expanding search ratio of a graph. Discrete Appl. Math. 260, 51\u201365 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza Yates","year":"1993","unstructured":"Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Israel J. Math. 2(4), 221\u2013228 (1964)","journal-title":"Israel J. Math."},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search. SIAM Rev. 5(3), 274\u2013274 (1963)","journal-title":"SIAM Rev."},{"key":"14_CR10","unstructured":"Bonato, A., Georgiou, K., MacRury, C., Pralat, P.: Probabilistically faulty searching on a half-line (2020). arXiv e-prints p. 2002.07797"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.08.023","volume":"703","author":"P Bose","year":"2017","unstructured":"Bose, P., De Carufel, J.L.: A general framework for searching on a line. Theor. Comput. Sci. 703, 1\u201317 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2014.12.007","volume":"569","author":"P Bose","year":"2015","unstructured":"Bose, P., De Carufel, J.L., Durocher, S.: Searching on a line: a complete characterization of the optimal solution. Theor. Comput. Sci. 569, 24\u201342 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Brandt, S., Foerster, K.T., Richner, B., Wattenhofer, R.: Wireless evacuation on m rays with k searchers. In: Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity, SIROCCO, pp. 140\u2013157 (2017)","DOI":"10.1007\/978-3-319-72050-0_9"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-57586-5_10","volume-title":"Algorithms and Complexity","author":"S Brandt","year":"2017","unstructured":"Brandt, S., Laufenberg, F., Lv, Y., Stolz, D., Wattenhofer, R.: Collaboration without communication: evacuating two robots from a disk. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 104\u2013115. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_10"},{"key":"14_CR15","unstructured":"Brandt, S., Uitto, J., Wattenhofer, R.: A tight lower bound for semi-synchronous collaborative grid exploration. In: Proceedings of the 32nd International Symposium on Distributed Computing, DISC, pp. 13:1\u201313:17 (2018)"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/TRO.2004.839232","volume":"21","author":"W Burgard","year":"2005","unstructured":"Burgard, W., Moors, M., Stachniss, C., Schneider, F.E.: Coordinated multi-robot exploration. IEEE Trans. Robot. 21(3), 376\u2013386 (2005)","journal-title":"IEEE Trans. Robot."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-14094-6_5","volume-title":"Algorithms for Sensor Systems","author":"H Chuangpishit","year":"2019","unstructured":"Chuangpishit, H., Georgiou, K., Sharma, P.: Average case - worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model. In: Gilbert, S., Hughes, D., Krishnamachari, B. (eds.) ALGOSENSORS 2018. LNCS, vol. 11410, pp. 62\u201382. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14094-6_5"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Cohen, L., Emek, Y., Louidor, O., Uitto, J.: Exploring an infinite space with finite memory scouts. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 207\u2013224. SIAM (2017)","DOI":"10.1137\/1.9781611974782.14"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., et al.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_9"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-030-01325-7_32","volume-title":"Structural Information and Communication Complexity","author":"J Czyzowicz","year":"2018","unstructured":"Czyzowicz, J., et al.: Priority Evacuation from a Disk Using Mobile Robots. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 392\u2013407. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_32"},{"key":"14_CR21","first-page":"335","volume":"11340","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and Evacuation. Distrib. Comput. Mob. Entities Curr. Res. Moving Comput. 11340, 335\u2013370 (2019)","journal-title":"Distrib. Comput. Mob. Entities Curr. Res. Moving Comput."},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-319-57586-5_36","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Linear search with terrain-dependent speeds. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 430\u2013441. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_36"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-19662-6_13","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Wireless autonomous robot evacuation from equilateral triangles and squares. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 181\u2013194. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19662-6_13"},{"key":"14_CR24","unstructured":"Czyzowicz, J., et al.: Energy consumption of group search ona line. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, ICALP. LIPIcs, vol. 132, pp. 1\u201315 (2019)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities; Current Research in Moving and Computing, pp. 335\u2013370. Springer (2019)","DOI":"10.1007\/978-3-030-11072-7_14"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theor. Comput. Sci. 361(2), 342\u2013355 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Feinerman, O., Korman, A., Lotker, Z., Sereni, J.S.: Collaborative search on the plane without communication. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, pp. 77\u201386 (2012)","DOI":"10.1145\/2332432.2332444"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3304111","volume":"66","author":"P Fraigniaud","year":"2019","unstructured":"Fraigniaud, P., Korman, A., Rodeh, Y.: Parallel Bayesian search with no coordination. J. ACM (JACM) 66(3), 1\u201328 (2019)","journal-title":"J. ACM (JACM)"},{"key":"14_CR29","volume-title":"Search Games","author":"S Gal","year":"1980","unstructured":"Gal, S.: Search Games. Academic Press, New York (1980)"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Gal, S.: Search Games. Wiley Encyclopedia for Operations Research and Management Science (2011)","DOI":"10.1002\/9780470400531.eorms0912"},{"key":"14_CR31","unstructured":"Georgiou, K., Karakostas, G., Kranakis, E.: Search-and-fetch with 2 robots on a disk: Wireless and face-to-face communication models. Discrete Math. Theor. Comput. Sci. 21(3) (2019)"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-34405-4_11","volume-title":"Algorithms for Sensor Systems","author":"K Georgiou","year":"2019","unstructured":"Georgiou, K., Kranakis, E., Leonardos, N., Pagourtzis, A., Papaioannou, I.: Optimal circle search despite the presence of faulty robots. In: Dressler, F., Scheideler, C. (eds.) ALGOSENSORS 2019. LNCS, vol. 11931, pp. 192\u2013205. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34405-4_11"},{"issue":"11","key":"14_CR33","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"109","author":"A Je\u017c","year":"2009","unstructured":"Je\u017c, A., \u0141opusza\u0144ski, J.: On the two-dimensional cow search problem. Inf. Process. Lett. 109(11), 543\u2013547 (2009)","journal-title":"Inf. Process. Lett."},{"key":"14_CR34","doi-asserted-by":"publisher","DOI":"10.1201\/b18604","volume-title":"Search and Foraging: Individual Motion and Swarmdynamics","author":"E Kagan","year":"2015","unstructured":"Kagan, E., Ben-Gal, I.: Search and Foraging: Individual Motion and Swarmdynamics. CRC Press, Boca Raton (2015)"},{"issue":"1","key":"14_CR35","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"MY Kao","year":"1996","unstructured":"Kao, M.Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63\u201379 (1996)","journal-title":"Inf. Comput."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C., Yannakakis, M.: Searching a fixed graph. In: Proc. of the 23rd International Colloquium on Automata, Languages, and Programming, ICALP, pp. 280\u2013289. Springer (1996)","DOI":"10.1007\/3-540-61440-0_135"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Lamprou, I., Martin, R., Schewe, S.: Fast two-robot disk evacuation with wireless communication. In: DISC, pp. 1\u201315 (2016)","DOI":"10.1007\/978-3-662-53426-7_1"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Pattanayak, D., Ramesh, H., Mandal, P., Schmid, S.: Evacuating two robots from two unknown exits on the perimeter of a disk with wireless communication. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN, pp. 20:1\u201320:4 (2018)","DOI":"10.1145\/3154273.3154313"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected st-connectivity in log-space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC, pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"},{"key":"14_CR40","volume-title":"Evolution and Optimum Seeking: The Sixth Generation","author":"HPP Schwefel","year":"1993","unstructured":"Schwefel, H.P.P.: Evolution and Optimum Seeking: The Sixth Generation. John Wiley & Sons Inc., Hoboken (1993)"},{"key":"14_CR41","volume-title":"Theory of Optimal Search","author":"L Stone","year":"1975","unstructured":"Stone, L.: Theory of Optimal Search. Academic Press, New York (1975)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T06:53:14Z","timestamp":1618555994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_14"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","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 (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - 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 (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}