I/O- (Cache-) Efficient Algorithms
[Back to full publication list]
Algorithms with provable I/O complexity
- 2025:[5] Pkd-tree: Parallel kd-tree with Batch Updates
Ziyang Men*, Zheqi Shen*, Yan Gu*, and Yihan Sun*
ACM Special Interest Group on Management of Data (SIGMOD), 2025DOI:10.1145/3709712Software Library:Pkd-tree: Parallel kd-tree [Github]
Poster and oral presentation at the SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2025
Poster and oral presentation at the Highlights of Parallel Computing (HOPC@SPAA), 2025
Paper ArXiV Code Slides Poster - 2023:[4] High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Xiaojun Dong*, Yunshu Wu*, Zhongqi Wang*, Laxman Dhulipala, Yan Gu*, and Yihan Sun*
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023DOI:10.1145/3558481.3591071Software Library:Parallel Semisort [Github]
Paper ArXiV Code Slides - 2022:[3] Analysis of Work-Stealing and Parallel Cache Complexity
Yan Gu*, Zachary Napier, and Yihan Sun*
ACM-SIAM Algorithmic Principles of Computer Systems (APOCS), 2022DOI:10.1137/1.9781611977059.4
Paper - 2021:[2] The Read-Only Semi-External Model
Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu*, Charles McGuffey, and Julian Shun
ACM-SIAM Algorithmic Principles of Computer Systems (APOCS), 2021
Paper - 2020:[1] Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming
Yan Gu*, and Guy E. Blelloch
ACM-SIAM Algorithmic Principles of Computer Systems (APOCS), 2020
Paper ArXiV