{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:27:08Z","timestamp":1747866428166,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_23","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"520-535","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Overcoming Probabilistic Faults in\u00a0Disoriented Linear Search"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Georgiou","sequence":"first","affiliation":[]},{"given":"Nikos","family":"Giachoudis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8959-4428","authenticated-orcid":false,"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"23_CR1","volume-title":"Search Problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede, R., Wegener, I.: Search Problems. Wiley, Hoboken (1987)"},{"key":"23_CR2","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Springer, Cham (2006)"},{"issue":"2","key":"23_CR3","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":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","volume":"5","author":"R Baeza-Yates","year":"1995","unstructured":"Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. 5(3), 143\u2013154 (1995)","journal-title":"Comput. Geom."},{"issue":"8","key":"23_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 Res. Logistics (NRL) 48(8), 722\u2013731 (2001)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"4","key":"23_CR6","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":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02760028","volume":"3","author":"A Beck","year":"1965","unstructured":"Beck, A.: More on the linear search problem. Israel J. Math. 3(2), 61\u201370 (1965)","journal-title":"Israel J. Math."},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck, A., Newman, D.: Yet more on the linear search problem. Israel J. Math. 8(4), 419\u2013429 (1970)","journal-title":"Israel J. Math."},{"issue":"3","key":"23_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":"23_CR10","doi-asserted-by":"crossref","unstructured":"Bonato, A., Georgiou, K., MacRury, C., Pra\u0142at, P.: Algorithms for $$p$$-faulty search on a half-line. Algorithmica (2022)","DOI":"10.1007\/s00453-022-01075-y"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-46078-8_14","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Group search on the line. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Group search and evacuation. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, Lecture Notes in Computer Science(), vol. 11340, pp. 335\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_14","DOI":"10.1007\/978-3-030-11072-7_14"},{"key":"23_CR13","unstructured":"Czyzowicz, J., et al. : Search on a line by byzantine robots. Int. J. Found. Comput. Sci., 1\u201319 (2021)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Killick, R., Kranakis, E., Stachowiak, G.: Search and evacuation with a near majority of faulty agents. In: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA 2021), pp. 217\u2013227. SIAM (2021)","DOI":"10.1137\/1.9781611976830.20"},{"issue":"6","key":"23_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00446-017-0296-0","volume":"32","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. Distrib. Comput. 32(6), 493\u2013504 (2019)","journal-title":"Distrib. Comput."},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"E Demaine","year":"2006","unstructured":"Demaine, E., Fekete, S., Gal, S.: Online searching with turn cost. Theoret. Comput. Sci. 361(2), 342\u2013355 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Giachoudis, N., Kranakis, E.: Overcoming probabilistic faults in disoriented linear search. CoRR, abs\/2303.15608 (2023)","DOI":"10.1007\/978-3-031-32733-9_23"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.10.013","volume":"939","author":"K Georgiou","year":"2023","unstructured":"Georgiou, K., Lucier, J.: Weighted group search on a line & implications to the priority evacuation problem. Theoret. Comput. Sci. 939, 1\u201317 (2023)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M-Y 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."},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.2307\/3212585","volume":"11","author":"BJ McCabe","year":"1974","unstructured":"McCabe, B.J.: Searching for a one-dimensional random walker. J. Appl. Probab. 11(1), 86\u201393 (1974)","journal-title":"J. Appl. Probab."},{"key":"23_CR21","volume-title":"Theory of optimal search","author":"DL Stone","year":"1975","unstructured":"Stone, D.L.: Theory of optimal search. Academic Press, Cambridge (1975). Incorporated"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-41672-0_9","volume-title":"Complexity and Approximation","author":"X Sun","year":"2020","unstructured":"Sun, X., Sun, Y., Zhang, J.: Better upper bounds for searching on a line with byzantine robots. In: Du, D.-Z., Wang, J. (eds.) Complexity and Approximation. LNCS, vol. 12000, pp. 151\u2013171. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41672-0_9"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T23:15:31Z","timestamp":1702509331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"48","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":"26","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":"54% - 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","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":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}