{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:21:04Z","timestamp":1777965664982,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Swedish Foundation for Strategic Research","award":["RIT10-0033"],"award-info":[{"award-number":["RIT10-0033"]}]},{"name":"EU","award":["611183"],"award-info":[{"award-number":["611183"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,4]]},"DOI":"10.1145\/3154273.3154307","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:57Z","timestamp":1515764997000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree"],"prefix":"10.1145","author":[{"given":"Bapi","family":"Chatterjee","sequence":"first","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Walulya","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"https:\/\/www.census.gov\/geo\/maps-data\/data\/tiger.html.  https:\/\/www.census.gov\/geo\/maps-data\/data\/tiger.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328920"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799366340"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837853.1693488"},{"key":"e_1_3_2_1_6_1","first-page":"31","volume-title":"Range Queries in Non-blocking k-ary Search Trees","author":"Brown T.","year":"2012","unstructured":"T. Brown and H. Avni . Range Queries in Non-blocking k-ary Search Trees , pages 31 -- 45 . Springer Berlin Heidelberg , 2012 . T. Brown and H. Avni. Range Queries in Non-blocking k-ary Search Trees, pages 31--45. Springer Berlin Heidelberg, 2012."},{"key":"e_1_3_2_1_7_1","unstructured":"B. Chatterjee. CKDTree. In https:\/\/tinyurl.com\/hl3oktt.  B. Chatterjee. CKDTree. In https:\/\/tinyurl.com\/hl3oktt."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3007748.3007771"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611500"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.55094"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835736"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312036"},{"issue":"5","key":"e_1_3_2_1_18_1","first-page":"1123","article-title":"Scalable multicore motion planning using lock-free concurrency. Robotics","volume":"30","author":"Ichnowski J.","year":"2014","unstructured":"J. Ichnowski and R. Alterovitz . Scalable multicore motion planning using lock-free concurrency. Robotics , IEEE Transactions on , 30 ( 5 ): 1123 -- 1136 , 2014 . J. Ichnowski and R. Alterovitz. Scalable multicore motion planning using lock-free concurrency. Robotics, IEEE Transactions on, 30(5):1123--1136, 2014.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_19_1","unstructured":"S. D. Levy. KDTree. In edu.wlu.cs.levy.CG.KDTree.  S. D. Levy. KDTree. In edu.wlu.cs.levy.CG.KDTree."},{"key":"e_1_3_2_1_20_1","volume-title":"New algorithms for efficient high-dimensional nonparametric classification. Journal of Machine Learning Research, 7(Jun):1135--1158","author":"Liu T.","year":"2006","unstructured":"T. Liu , A. W. Moore , and A. Gray . New algorithms for efficient high-dimensional nonparametric classification. Journal of Machine Learning Research, 7(Jun):1135--1158 , 2006 . T. Liu, A. W. Moore, and A. Gray. New algorithms for efficient high-dimensional nonparametric classification. Journal of Machine Learning Research, 7(Jun):1135--1158, 2006."},{"key":"e_1_3_2_1_21_1","volume-title":"Technical Report 209","author":"Moore A. W.","year":"1991","unstructured":"A. W. Moore . Efficient memory-based learning for robot control. Technical Report 209 , University of Cambridge , 1991 . A. W. Moore. Efficient memory-based learning for robot control. Technical Report 209, University of Cambridge, 1991."},{"key":"e_1_3_2_1_22_1","unstructured":"D. M. Mount and S. Arya. Ann: a library for approximate nearest neighbor searching. http:\/\/www.cs.umd.edu\/~mount\/ANN\/ 1998.  D. M. Mount and S. Arya. Ann: a library for approximate nearest neighbor searching. http:\/\/www.cs.umd.edu\/~mount\/ANN\/ 1998."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_16"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145836"},{"key":"e_1_3_2_1_26_1","volume-title":"Morgan Kaufmann","author":"Samet H.","year":"2006","unstructured":"H. Samet . Foundations of multidimensional and metric data structures . Morgan Kaufmann , 2006 . H. Samet. Foundations of multidimensional and metric data structures. Morgan Kaufmann, 2006."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.12.005"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588564"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409079"}],"event":{"name":"ICDCN '18: 19th International Conference on Distributed Computing and Networking","location":"Varanasi India","acronym":"ICDCN '18","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 19th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154307","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:20Z","timestamp":1750212680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":28,"alternative-id":["10.1145\/3154273.3154307","10.1145\/3154273"],"URL":"https:\/\/doi.org\/10.1145\/3154273.3154307","relation":{},"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}