{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:57Z","timestamp":1773481857076,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CAREER Award","award":["CCF-1845763"],"award-info":[{"award-number":["CCF-1845763"]}]},{"name":"DARPA SDH Award","award":["HR0011-18-3-0007"],"award-info":[{"award-number":["HR0011-18-3-0007"]}]},{"name":"Google Faculty Research Award"},{"name":"Applications Driving Architectures (ADA) Research Center"},{"name":"Google Research Scholar Award"},{"name":"DOE Early Career Award","award":["DE-SC0018947"],"award-info":[{"award-number":["DE-SC0018947"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,2]]},"DOI":"10.1145\/3503221.3508429","type":"proceedings-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T13:58:22Z","timestamp":1648475902000},"page":"450-452","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["ParGeo"],"prefix":"10.1145","author":[{"given":"Yiqiu","family":"Wang","sequence":"first","affiliation":[{"name":"MIT CSAIL"}]},{"given":"Shangdi","family":"Yu","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]},{"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]},{"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"UC Riverside"}]},{"given":"Julian","family":"Shun","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]}],"member":"320","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"e_1_3_2_3_1_1","unstructured":"The computational geometry algorithms library www.cgal.org."},{"key":"e_1_3_2_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2010.04.008"},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935766"},{"key":"e_1_3_2_3_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400255"},{"key":"e_1_3_2_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48481-7_29"},{"key":"e_1_3_2_3_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2016.01.003"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_3_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2012.03.015"},{"key":"e_1_3_2_3_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469384"},{"key":"e_1_3_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457296"},{"key":"e_1_3_2_3_12_1","volume-title":"SoCG","author":"Wang Y.","year":"2021","unstructured":"Y. Wang, S. Yu, Y. Gu, and J. Shun. A parallel batch-dynamic data structure for the closest pair problem. In SoCG, 2021."},{"key":"e_1_3_2_3_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0038202"},{"key":"e_1_3_2_3_14_1","volume-title":"Parallel batch-dynamic kd-trees. arXiv","author":"Yesantharao R.","year":"2021","unstructured":"R. Yesantharao, Y. Wang, L. Dhulipala, and J. Shun. Parallel batch-dynamic kd-trees. arXiv, 2021."}],"event":{"name":"PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Seoul Republic of Korea","acronym":"PPoPP '22","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508429","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503221.3508429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:49Z","timestamp":1750186849000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503221.3508429"}},"subtitle":["a library for parallel computational geometry"],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":14,"alternative-id":["10.1145\/3503221.3508429","10.1145\/3503221"],"URL":"https:\/\/doi.org\/10.1145\/3503221.3508429","relation":{},"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"2022-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}