Parallel kd-tree with Batch Updates.
Proc. ACM Manag. Data, February, 2025
Parallel kd-tree with Batch Updates (Abstract).
Proceedings of the 3rd Highlights of Parallel Computing Workshop, 2025
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers.
Proc. VLDB Endow., May, 2024
Pkd-tree: Parallel <i>k</i>d-tree with Batch Updates.
CoRR, 2024
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis.
CoRR, 2023
Parallel Longest Increasing Subsequence and van Emde Boas Trees.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
Predicting Depression on Twitter with Word Embedding by Pretrained Language Model.
Proceedings of the 12th International Conference on Awareness Science and Technology, 2023
A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence.
CoRR, 2022
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022
Parameter Estimation Based on a Local Ensemble Transform Kalman Filter Applied to El Niño-Southern Oscillation Ensemble Prediction.
Remote. Sens., 2021