{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:09Z","timestamp":1740109269238,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N019504\/1"],"award-info":[{"award-number":["EP\/N019504\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"crossref","award":["200020-162884","200021-175977"],"award-info":[{"award-number":["200020-162884","200021-175977"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00446-019-00358-y","type":"journal-article","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T08:02:46Z","timestamp":1564646566000},"page":"229-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds for searching robots, some faulty"],"prefix":"10.1007","volume":"34","author":[{"given":"Andrey","family":"Kupavskii","sequence":"first","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"issue":"N4","key":"358_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0963548311000125","volume":"20","author":"N Alon","year":"2011","unstructured":"Alon, N., Avin, C., Kouck, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(N4), 481\u2013502 (2011)","journal-title":"Comb. Probab. Comput."},{"key":"358_CR2","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2006","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Springer, Berlin (2006)"},{"unstructured":"Azar, Y., Broder, A.Z., Manasse, M.S.: On-line choice of on-line algorithms. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 432\u2013440 (1993)","key":"358_CR3"},{"key":"358_CR4","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-19487-8_20","volume-title":"SWAT 88. LNCS","author":"R Baeza-Yates","year":"1988","unstructured":"Baeza-Yates, R., Culberson, J., Rawlins, G.: Searching with uncertainty extended abstract. In: Karlsson, R., Lingas, A. (eds.) SWAT 88. LNCS, vol. 318, pp. 176\u2013189. Springer, Berlin (1988)"},{"issue":"2","key":"358_CR5","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":"N4","key":"358_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(N4), 221\u2013228 (1964)","journal-title":"Israel J. Math."},{"issue":"N2","key":"358_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(N2), 61\u201370 (1965)","journal-title":"Israel J. Math."},{"issue":"N4","key":"358_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck, A., Newman, D.J.: Yet more on the linear search problem. Israel J. Math. 8(N4), 419\u2013429 (1970)","journal-title":"Israel J. Math."},{"key":"358_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9904-1956-10026-8","volume":"62","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Minimization problem. Bull. Am. Math. Soc. 62, 270 (1956)","journal-title":"Bull. Am. Math. Soc."},{"issue":"N3","key":"358_CR10","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(N3), 274 (1963)","journal-title":"SIAM Rev."},{"key":"358_CR11","first-page":"1211","volume":"I","author":"DS Bernstein","year":"2003","unstructured":"Bernstein, D.S., Finkelstein, L., Zilberstein, S.: Contract algorithms and robots on rays: unifying two scheduling problems. IJCA I, 1211\u20131217 (2003)","journal-title":"IJCA"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S., Revisiting the problem of searching on a line. In: Algorithms\u2014ESA. LNCS, vol. 8125, pp. 205\u2013216. Springer (2013)","key":"358_CR12","DOI":"10.1007\/978-3-642-40450-4_18"},{"unstructured":"Czyzowitz, J., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Search on a line by Byzantine robots. In: Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC), pp. 27:1\u201327:12 (2016)","key":"358_CR13"},{"doi-asserted-by":"crossref","unstructured":"Czyzowitz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. In: Proceedings of the PODC\u201916, pp. 405\u2013414 (2016)","key":"358_CR14","DOI":"10.1145\/2933057.2933102"},{"issue":"N2","key":"358_CR15","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(N2), 342\u2013355 (2006)","journal-title":"Theor. Comput. Sci."},{"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, ACM, pp. 77\u201386 (2012)","key":"358_CR16","DOI":"10.1145\/2332432.2332444"},{"unstructured":"Fiat, A., Rabani, Y., Ravid, Y.: Competitive k-server algorithms. In: Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, pp. 454\u2013463 (1990)","key":"358_CR17"},{"issue":"N4","key":"358_CR18","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/1007106","volume":"7","author":"W Franck","year":"1965","unstructured":"Franck, W.: An optimal search problem. SIAM Rev. 7(N4), 503\u2013512 (1965)","journal-title":"SIAM Rev."},{"key":"358_CR19","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800040409","volume":"4","author":"JR Isbell","year":"1957","unstructured":"Isbell, J.R.: An optimal search pattern. Naval Res. Logist. Q. 4, 357\u2013359 (1957)","journal-title":"Naval Res. Logist. Q."},{"issue":"N1","key":"358_CR20","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0959","volume":"29","author":"MY Kao","year":"1998","unstructured":"Kao, M.Y., Ma, Y., Sipser, M., Yin, Y.: Optimal constructions of hybrid algorithms. J. Algorithms 29(N1), 142\u2013164 (1998)","journal-title":"J. Algorithms"},{"issue":"N1","key":"358_CR21","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(N1), 63\u201379 (1996)","journal-title":"Inf. Comput."},{"unstructured":"Polycarpouy, M.M., Yang, Y., Passinoz, K.M.: A cooperative search framework for distributed agents. In: Intelligent Control, pp. 1\u20136 (2001)","key":"358_CR22"},{"doi-asserted-by":"crossref","unstructured":"Schuierer, S.: A lower bound for randomized searching on m rays. In: Computer Science in Perspective, pp. 264\u2013277. LNCS, vol. 2598 (2003)","key":"358_CR23","DOI":"10.1007\/3-540-36477-3_20"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-019-00358-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-019-00358-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-019-00358-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T05:04:39Z","timestamp":1626843879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-019-00358-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s00446-019-00358-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2019,8,1]]},"assertion":[{"value":"18 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}