{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:12Z","timestamp":1760202732724,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087591","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"325-327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Gokarna","family":"Sharma","sequence":"first","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]},{"given":"Supratik","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"volume-title":"MIT Press","year":"2005","author":"Choset H.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00440ED1V01Y201208DCT010"},{"volume-title":"CCCG","year":"2014","author":"Luna G. A. D.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","first-page":"268","volume-title":"CCCG","author":"Sharma G.","year":"2015"}],"event":{"name":"SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087591","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087591"}},"subtitle":["Complete Visibility for Oblivious Robots in Linear Time"],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":4,"alternative-id":["10.1145\/3087556.3087591","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087591","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}