Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications

Award ID(s):: 2403235 2103483 2339310 2119352

PAR ID:: 10636084

Author(s) / Creator(s):: Zhao, Yiwei; Kang, Hongbo; Gu, Yan; Blelloch, Guy E; Dhulipala, Laxman; McGuffey, Charles; Gibbons, Phillip B

Publisher / Repository:: ACM

Date Published:: 2025-07-16

Page Range / eLocation ID:: 350 to 366

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on July 16, 2026
Conference Paper:
https://doi.org/10.1145/3694906.3743318