{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:52Z","timestamp":1777954612117,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":111,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1919223, CCF-2103483, CCF-2119352, CCF-2339310, CCF-2403235, CNS-2211882, CNS-2317194"],"award-info":[{"award-number":["CCF-1919223, CCF-2103483, CCF-2119352, CCF-2339310, CCF-2403235, CNS-2211882, CNS-2317194"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743318","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"350-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2586-8311","authenticated-orcid":false,"given":"Yiwei","family":"Zhao","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9672-6490","authenticated-orcid":false,"given":"Hongbo","family":"Kang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4392-4022","authenticated-orcid":false,"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0224-9187","authenticated-orcid":false,"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0685-064X","authenticated-orcid":false,"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6281-4435","authenticated-orcid":false,"given":"Charles","family":"McGuffey","sequence":"additional","affiliation":[{"name":"Reed College, Portland, OR, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6967-2735","authenticated-orcid":false,"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777828"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN55064.2022.9891986"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626183.3659976"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386263.3411365"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240011004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.memori.2022.100022"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10539"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW58674.2023.00035"},{"key":"e_1_3_2_1_10_1","volume-title":"Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9","author":"Bentley Jon Louis","year":"1975","unstructured":"Jon Louis Bentley. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (1975)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3592980.3595312"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109780"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/nme.3091"},{"key":"e_1_3_2_1_14_1","volume-title":"Parallel Nearest Neighbors in Low Dimensions with Batch Updates. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). SIAM, 195--208","author":"Blelloch Guy E","year":"2022","unstructured":"Guy E Blelloch and Magdalen Dobson. 2022. Parallel Nearest Neighbors in Low Dimensions with Batch Updates. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). SIAM, 195--208."},{"key":"e_1_3_2_1_15_1","volume-title":"Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch, Daniel Ferizovic, and Yihan Sun. 2016. Just Join for Parallel Ordered Sets. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 253--264."},{"key":"e_1_3_2_1_16_1","volume-title":"Optimal Parallel Algorithms in the Binary-Forking Model. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"Blelloch Guy E.","year":"2020","unstructured":"Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, and Yihan Sun. 2020. Optimal Parallel Algorithms in the Binary-Forking Model. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (2020), 89--102."},{"key":"e_1_3_2_1_17_1","volume-title":"Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--246","author":"Blelloch Guy E","year":"2018","unstructured":"Guy E Blelloch, Yan Gu, Julian Shun, and Yihan Sun. 2018. Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--246."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259471"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_20_1","unstructured":"Yixi Cai Wei Xu and Fu Zhang. 2021. ikd-Tree: An Incremental K-D Tree for Robotic Applications. arXiv:2102.10808 [cs.RO] https:\/\/arxiv.org\/abs\/2102.10808"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS62058.2024.00010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247915"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.6b01222"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3658266"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.012"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538591"},{"key":"e_1_3_2_1_27_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 297--308","author":"Choe Jiwon","unstructured":"Jiwon Choe, Amy Huang, Tali Moreshet, Maurice Herlihy, and R. Iris Bahar. 2019. Concurrent Data Structures with Near-Data-Processing: an Architecture-Aware Implementation. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 297--308."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12241"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195919400028"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591071"},{"key":"e_1_3_2_1_31_1","unstructured":"Martin Ester Hans-Peter Kriegel J\u00f6rg Sander Xiaowei Xu et al. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In kdd Vol. 96. 226--231."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-4764-5_18"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO63174.2024.10715253"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF59524.2023.10476816"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_36_1","volume-title":"Cache-Oblivious Algorithms. In IEEE Symposium on Foundations of Computer Science (FOCS). 285--298","author":"Frigo Matteo","year":"1999","unstructured":"Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. 1999. Cache-Oblivious Algorithms. In IEEE Symposium on Foundations of Computer Science (FOCS). 285--298."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3083897"},{"key":"e_1_3_2_1_38_1","unstructured":"Sahar Ghoflsaz Ghinani Jingyao Zhang and Elaheh Sadredini. 2025. Enabling Low-Cost Secure Computing on Untrusted In-Memory Architectures. arXiv:2501.17292 [cs.CR] https:\/\/arxiv.org\/abs\/2501.17292"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging","author":"Gross Matthias","year":"2007","unstructured":"Matthias Gross, Carsten Lojewski, Martin Bertram, and Hans Hagen. 2007. Fast implicit KD-trees: accelerated isosurface ray tracing and maximum intensity projection for large scalar fields. In Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging (Innsbruck, Austria) (CGIM '07). ACTA Press, USA, 67--74."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538581"},{"key":"e_1_3_2_1_41_1","volume-title":"A faster algorithm for DBSCAN. Master's thesis","author":"Gunawan Ade","year":"2013","unstructured":"Ade Gunawan and M de Berg. 2013. A faster algorithm for DBSCAN. Master's thesis (2013)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC59245.2023.00030"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3174101"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/IICSPI.2018.8690508"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2024.3424853"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Yihao Huang Shangdi Yu and Julian Shun. 2023. Faster Parallel Exact Density Peaks Clustering. arXiv:2305.11335 [cs.DC] https:\/\/arxiv.org\/abs\/2305.11335","DOI":"10.1145\/3597635.3598021"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2853659"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA57654.2024.00029"},{"key":"e_1_3_2_1_49_1","volume-title":"Intel In-Memory Analytics Accelerator (Intel IAA). https:\/\/www.intel.com\/content\/www\/us\/en\/products\/docs\/accelerator-engines\/in-memory-analytics-accelerator.html. Accessed","year":"2025","unstructured":"Intel. 2025. Intel In-Memory Analytics Accelerator (Intel IAA). https:\/\/www.intel.com\/content\/www\/us\/en\/products\/docs\/accelerator-engines\/in-memory-analytics-accelerator.html. Accessed February 2025."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSIT.2012.6242474"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00300"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108563"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSIA.2017.8339084"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461816"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574275"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2211.10516"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591070"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2011.06.003"},{"key":"e_1_3_2_1_59_1","volume-title":"This Memory Slaps: Breaking Through the Memory Wall of Transactional Database Systems with Processing-in-Memory. Proc. VLDB Endow.","author":"Kim Hyoungjoo","year":"2025","unstructured":"Hyoungjoo Kim, Yiwei Zhao, Andrew Pavlo, and Phillip B. Gibbons. 2025. No Cap, This Memory Slaps: Breaking Through the Memory Wall of Transactional Database Systems with Processing-in-Memory. Proc. VLDB Endow. (2025)."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2016.7822732"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO61859.2024.00053"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523220"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403208"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.2016.7730186"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00112"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589258"},{"key":"e_1_3_2_1_67_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1595--1598","author":"Liu Xingyu","year":"2015","unstructured":"Xingyu Liu, Yangdong Deng, Yufei Ni, and Zonghui Li. 2015. FastTree: A hardware KD-tree construction acceleration engine for real-time ray tracing. In 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1595--1598."},{"key":"e_1_3_2_1_68_1","volume-title":"Concurrent Data Structures for Near-memory Computing. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--245","author":"Liu Zhiyu","year":"2017","unstructured":"Zhiyu Liu, Irina Calciu, Maurice Herlihy, and Onur Mutlu. 2017. Concurrent Data Structures for Near-memory Computing. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 235--245."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902283"},{"key":"e_1_3_2_1_70_1","volume-title":"ACM International Conference on Management of Data (SIGMOD).","author":"Men Ziyang","year":"2025","unstructured":"Ziyang Men, Zheqi Shen, Yan Gu, and Yihan Sun. 2025. Pkd-tree: Parallel kd-tree with Batch Updates. In ACM International Conference on Management of Data (SIGMOD)."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3673038.3673094"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-7487-7_7"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEDM50854.2024.10873410"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS64841.2024.00039"},{"key":"e_1_3_2_1_76_1","unstructured":"Mohammed Otair. 2013. Approximate κ-nearest neighbour based spatial clustering using k-d tree. arXiv:1303.1951 [cs.DB] https:\/\/arxiv.org\/abs\/1303.1951"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00024"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45072-6_4"},{"key":"e_1_3_2_1_80_1","volume-title":"Randomized algorithms for packet routing on the mesh. Advances in Parallel Algorithms","author":"Rajasekaran Sanguthevar","year":"1991","unstructured":"Sanguthevar Rajasekaran. 1991. Randomized algorithms for packet routing on the mesh. Advances in Parallel Algorithms (1991)."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330875"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758753"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3656019.3676947"},{"key":"e_1_3_2_1_84_1","volume-title":"Clustering by fast search and find of density peaks. science 344, 6191","author":"Rodriguez Alex","year":"2014","unstructured":"Alex Rodriguez and Alessandro Laio. 2014. Clustering by fast search and find of density peaks. science 344, 6191 (2014), 1492--1496."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1051\/0004-6361\/201322593"},{"key":"e_1_3_2_1_86_1","volume-title":"Samsung PIM Technology. https:\/\/semiconductor.samsung.com\/technologies\/memory\/pim\/. Accessed","year":"2025","unstructured":"Samsung. 2025. Samsung PIM Technology. https:\/\/semiconductor.samsung.com\/technologies\/memory\/pim\/. Accessed February 2025."},{"key":"e_1_3_2_1_87_1","volume-title":"On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM).","author":"Sanders Peter","year":"1996","unstructured":"Peter Sanders. 1996. On the Competitive Analysis of Randomized Static Load Balancing. In Workshop on Randomized Parallel Algorithms (RANDOM)."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2015.03.007"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402719"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3190958"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD63220.2024.00018"},{"key":"e_1_3_2_1_92_1","volume-title":"ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 143--153","author":"Shun Julian","unstructured":"Julian Shun, Laxman Dhulipala, and Guy E. Blelloch. 2014. A Simple and Practical Linear-work Parallel Algorithm for Connectivity. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 143--153."},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851147"},{"key":"e_1_3_2_1_94_1","first-page":"147","article-title":"Method and system for latent dirichlet allocation computation using approximate counters","volume":"10","author":"Steele Guy L","year":"2018","unstructured":"Guy L Steele Jr and Jean-Baptiste Tristan. 2018. Method and system for latent dirichlet allocation computation using approximate counters. US Patent 10,147,044.","journal-title":"US Patent"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1970.5008902"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/3652892.3700782"},{"key":"e_1_3_2_1_97_1","first-page":"8887","article-title":"Developments in KD tree and KNN searches","volume":"975","author":"Tiwari Vijay R","year":"2023","unstructured":"Vijay R Tiwari. 2023. Developments in KD tree and KNN searches. International Journal of Computer Applications 975 (2023), 8887.","journal-title":"International Journal of Computer Applications"},{"key":"e_1_3_2_1_98_1","volume-title":"Blelloch","author":"Tseng Thomas","year":"2019","unstructured":"Thomas Tseng, Laxman Dhulipala, and Guy E. Blelloch. 2019. Batch-parallel Euler Tour trees. In SIAM Meeting on Algorithm Engineering and Experiments (ALENEX). 92--106."},{"key":"e_1_3_2_1_99_1","volume-title":"UPMEM Technology. https:\/\/www.upmem.com\/technology\/. Accessed","author":"UPMEM.","year":"2025","unstructured":"UPMEM. 2025. UPMEM Technology. https:\/\/www.upmem.com\/technology\/. Accessed February 2025."},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380582"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508429"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2010.01793.x"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155454"},{"key":"e_1_3_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS51385.2021.00041"},{"key":"e_1_3_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"},{"key":"e_1_3_2_1_107_1","volume-title":"Proceedings of the European Conference on Computer Vision (ECCV) Workshops. 0--0.","author":"Zeng Wei","year":"2018","unstructured":"Wei Zeng and Theo Gevers. 2018. 3dcontextnet: Kd tree guided hierarchical learning of point clouds using local and global contextual cues. In Proceedings of the European Conference on Computer Vision (ECCV) Workshops. 0--0."},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658617.3697627"},{"key":"e_1_3_2_1_109_1","volume-title":"Syed Shakib Sarwar, Kleber Hugo Stangherlin, Yi-Lun Lu, Jorge Tomas Gomez, Jae-Sun Seo, et al.","author":"Zhao Yiwei","year":"2024","unstructured":"Yiwei Zhao, Ziyun Li, Win-San Khwa, Xiaoyu Sun, Sai Qian Zhang, Syed Shakib Sarwar, Kleber Hugo Stangherlin, Yi-Lun Lu, Jorge Tomas Gomez, Jae-Sun Seo, et al. 2024. Neural Architecture Search of Hybrid Models for NPU-CIM Heterogeneous AR\/VR Devices. arXiv preprint arXiv:2410.08326 (2024)."},{"key":"e_1_3_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2021.3114865"},{"key":"e_1_3_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409079"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:19:24Z","timestamp":1777922364000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":111,"alternative-id":["10.1145\/3694906.3743318","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743318","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}