{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:01Z","timestamp":1759637941557,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC of Canada"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933102","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"405-414","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Search on a Line with Faulty Robots"],"prefix":"10.1145","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[{"name":"Universite d'Outaouais, Gatineau, PQ, Canada"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[{"name":"Wesleyan University, Middletown, CT, USA"}]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, PQ, Canada"}]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, PQ, Canada"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645221"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732428X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0067-x"},{"key":"e_1_3_2_1_4_1","volume-title":"The theory of search games and rendezvous","author":"Alpern S.","year":"2002","unstructured":"S. Alpern and S. Gal . The theory of search games and rendezvous , volume 55 . Kluwer Academic Publishers , 2002 . S. Alpern and S. Gal. The theory of search games and rendezvous, volume 55. Kluwer Academic Publishers, 2002."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1054"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00003-R"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759737"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02798690"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1005070"},{"key":"e_1_3_2_1_10_1","first-page":"205","volume-title":"LNCS","volume":"8125","author":"Bose P.","year":"2013","unstructured":"P. Bose , J.-L. De Carufel , and S. Durocher . Revisiting the problem of searching on a line. In Algorithms--ESA 2013 , LNCS , volume 8125 , pages 205 -- 216 . Springer , 2013 . P. Bose, J.-L. De Carufel, and S. Durocher. Revisiting the problem of searching on a line. In Algorithms--ESA 2013, LNCS, volume 8125, pages 205--216. Springer, 2013."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.006"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.839232"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-642-22450-8_27","volume-title":"Ad-hoc, mobile, and wireless networks, LNCS","author":"Casteigts A.","year":"2011","unstructured":"A. Casteigts , P. Flocchini , W. Quattrociocchi , and N. Santoro . Time-varying graphs and dynamic networks . In Ad-hoc, mobile, and wireless networks, LNCS , volume 6811 , pages 346 -- 359 . Springer , 2011 . A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro. Time-varying graphs and dynamic networks. In Ad-hoc, mobile, and wireless networks, LNCS, volume 6811, pages 346--359. Springer, 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46078-8_14"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446475"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/060665257"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48971-0_30"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.018"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185382"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629656"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332444"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.07.018"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800080108"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799348670"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800140411"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/100797916"},{"key":"e_1_3_2_1_29_1","first-page":"8","volume-title":"Proceedings of SODA","author":"Kleinberg J.","year":"1994","unstructured":"J. Kleinberg . On-line search in a simple polygon . In Proceedings of SODA , pages 8 -- 15 . SIAM, 1994 . J. Kleinberg. On-line search in a simple polygon. In Proceedings of SODA, pages 8--15. SIAM, 1994."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806760"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_32_1","volume-title":"Morgan Kaufmann","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed algorithms . Morgan Kaufmann , 1996 . N. A. Lynch. Distributed algorithms. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/646243.681445"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00030-4"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_24"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067435"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/280765.280773"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2010.08.026"}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":39,"alternative-id":["10.1145\/2933057.2933102","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933102","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}