A geometric study of v-style pop-ups: theories and algorithms. - Xian-Ying Li; Tao Ju; Yan Gu 001; Shi-Min Hu 001 (ACM Trans. Graph., 2011)

Efficient BVH Construction via Approximate Agglomerative Clustering. - Yan Gu 001; Yong He 013; Kayvon Fatahalian; Guy E. Blelloch (High Performance Graphics, 2013)

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. - Danny Z. Chen; Yan Gu 001; Jian Li 015; Haitao Wang 001 (Discret. Comput. Geom., 2013)

Mixed-Domain Edge-Aware Image Manipulation. - Xian-Ying Li; Yan Gu 001; Shi-Min Hu 001; Ralph R. Martin (IEEE Trans. Image Process., 2013)

Cascading A*: a Parallel Approach to Approximate Heuristic Search. - Yan Gu 001; Yihan Sun 001; Yong He 013 (CoRR, 2014)

Extending the graphics pipeline with adaptive, multi-rate shading. - Yong He 013; Yan Gu 001; Kayvon Fatahalian (ACM Trans. Graph., 2014)

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. - Julian Shun; Yan Gu 001; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons (SODA, 2015)

Sorting with Asymmetric Read and Write Costs. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Julian Shun (SPAA, 2015)

A Top-Down Parallel Semisort. - Yan Gu 001; Julian Shun; Yihan Sun 001; Guy E. Blelloch (SPAA, 2015)

Ray Specialized Contraction on Bounding Volume Hierarchies. - Yan Gu 001; Yong He 013; Guy E. Blelloch (Comput. Graph. Forum, 2015)

Efficient Algorithms under Asymmetric Read and Write Costs. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Julian Shun (CoRR, 2015)

Efficient Algorithms with Asymmetric Read and Write Costs. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Julian Shun (ESA, 2016)

Parallel Algorithms for Asymmetric Read-Write Costs. - Naama Ben-David; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (SPAA, 2016)

Parallel Shortest Paths Using Radius Stepping. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001; Kanat Tangwongsan (SPAA, 2016)

A New Efficient Construction on Probabilistic Tree Embeddings. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (CoRR, 2016)

Efficient Construction of Probabilistic Tree Embeddings. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (ICALP, 2017)

Algorithmic Building Blocks for Asymmetric Memories. - Yan Gu 001; Yihan Sun 001; Guy E. Blelloch (ESA, 2018)

Implicit Decomposition for Write-Efficient Connectivity Algorithms. - Naama Ben-David; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (IPDPS, 2018)

Survey: Computational Models for Asymmetric Read and Write Costs. - Yan Gu 001 (IPDPS Workshops, 2018)

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. - Guy E. Blelloch; Yan Gu 001; Julian Shun; Yihan Sun 001 (SPAA, 2018)

The Parallel Persistent Memory Model. - Guy E. Blelloch; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (SPAA, 2018)

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra. - Yan Gu 001 (CoRR, 2018)

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. - Laxman Dhulipala; Charles McGuffey; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Phillip B. Gibbons; Julian Shun (CoRR, 2019)

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. - Guy E. Blelloch; Yan Gu 001 (APOCS, 2020)

Theoretically-Efficient and Practical Parallel DBSCAN. - Yiqiu Wang; Yan Gu 001; Julian Shun (SIGMOD Conference, 2020)

Optimal Parallel Algorithms in the Binary-Forking Model. - Guy E. Blelloch; Jeremy T. Fineman; Yan Gu 001; Yihan Sun 001 (SPAA, 2020)

Randomized Incremental Convex Hull is Highly Parallel. - Guy E. Blelloch; Yan Gu 001; Julian Shun; Yihan Sun 001 (SPAA, 2020)

Parallelism in Randomized Incremental Algorithms. - Guy E. Blelloch; Yan Gu 001; Julian Shun; Yihan Sun 001 (J. ACM, 2020)

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. - Laxman Dhulipala; Charles McGuffey; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Phillip B. Gibbons; Julian Shun (Proc. VLDB Endow., 2020)

The Read-Only Semi-External Model. - Guy E. Blelloch; Laxman Dhulipala; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (APOCS, 2021)

Parallel In-Place Algorithms: Theory and Practice. - Yan Gu 001; Omar Obeya; Julian Shun (APOCS, 2021)

A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. - Yiqiu Wang; Shangdi Yu; Yan Gu 001; Julian Shun (SoCG, 2021)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering. - Yiqiu Wang; Shangdi Yu; Yan Gu 001; Julian Shun (SIGMOD Conference, 2021)

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. - Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001; Yunming Zhang (SPAA, 2021)

The Processing-in-Memory Model. - Hongbo Kang; Phillip B. Gibbons; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey (SPAA, 2021)

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain. - Shangdi Yu; Yiqiu Wang; Yan Gu 001; Laxman Dhulipala; Julian Shun (Proc. VLDB Endow., 2021)

GeoGraph: A Framework for Graph Processing on Geometric Data. - Yiqiu Wang; Shangdi Yu; Laxman Dhulipala; Yan Gu 001; Julian Shun (ACM SIGOPS Oper. Syst. Rev., 2021)

Write-efficient Algorithms. - Yan Gu 001 (2021)

Analysis of Work-Stealing and Parallel Cache Complexity. - Yan Gu 001; Zachary Napier; Yihan Sun 001 (APOCS, 2022)

ParGeo: A Library for Parallel Computational Geometry. - Yiqiu Wang; Rahul Yesantharao; Shangdi Yu; Laxman Dhulipala; Yan Gu 001; Julian Shun (ESA, 2022)

PaC-trees: supporting parallel and compressed purely-functional collections. - Laxman Dhulipala; Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (PLDI, 2022)

ParGeo: a library for parallel computational geometry. - Yiqiu Wang; Shangdi Yu; Laxman Dhulipala; Yan Gu 001; Julian Shun (PPoPP, 2022)

Parallel Cover Trees and their Applications. - Yan Gu 001; Zachary Napier; Yihan Sun 001; Letong Wang (SPAA, 2022)

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. - Zheqi Shen; Zijin Wan; Yan Gu 001; Yihan Sun 001 (SPAA, 2022)

A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence. - Yan Gu 001; Zheqi Shen; Yihan Sun 001; Zijin Wan (CoRR, 2022)

PIM-tree: A Skew-resistant Index for Processing-in-Memory. - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (Proc. VLDB Endow., 2022)

LuisaRender: A High-Performance Rendering Framework with Layered and Unified Interfaces on Stream Architectures. - Shaokun Zheng; Zhiqian Zhou; Xin Chen 083; Difei Yan; Chuyan Zhang; Yuefeng Geng; Yan Gu 001; Kun Xu 003 (ACM Trans. Graph., 2022)

Efficient Parallel Output-Sensitive Edit Distance. - Xiangyun Ding; Xiaojun Dong 001; Yan Gu 001; Youzhe Liu; Yihan Sun 001 (ESA, 2023)

Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract). - Xiaojun Dong 001; Letong Wang; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2023)

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract). - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (HOPC@SPAA, 2023)

Parallel Strong Connectivity Based on Faster Reachability (Abstract). - Letong Wang; Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2023)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract). - Yiqiu Wang; Shangdi Yu; Yan Gu 001; Julian Shun (HOPC@SPAA, 2023)

Provably Fast and Space-Efficient Parallel Biconnectivity. - Xiaojun Dong 001; Letong Wang; Yan Gu 001; Yihan Sun 001 (PPoPP, 2023)

Parallel Longest Increasing Subsequence and van Emde Boas Trees. - Yan Gu 001; Ziyang Men; Zheqi Shen; Yihan Sun 001; Zijin Wan (SPAA, 2023)

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems. - Xiaojun Dong 001; Yunshu Wu; Zhongqi Wang; Laxman Dhulipala; Yan Gu 001; Yihan Sun 001 (SPAA, 2023)

PIM-trie: A Skew-resistant Trie for Processing-in-Memory. - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (SPAA, 2023)

Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. - Magdalen Dobson; Zheqi Shen; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Harsha Vardhan Simhadri; Yihan Sun 001 (CoRR, 2023)

Parallel Strong Connectivity Based on Faster Reachability. - Letong Wang; Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001 (Proc. ACM Manag. Data, 2023)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization. - Letong Wang; Xiangyun Ding; Yan Gu 001; Yihan Sun 001 (Proc. VLDB Endow., 2023)

Efficient Parallel Output-Sensitive Edit Distance (Abstract). - Xiangyun Ding; Xiaojun Dong 001; Yan Gu 001; Youzhe Liu; Yihan Sun 001 (HOPC@SPAA, 2024)

Parallel Integer Sort: Theory and Practice (Abstract). - Xiaojun Dong 001; Laxman Dhulipala; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2024)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization (Abstract). - Letong Wang; Xiangyun Ding; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2024)

Teaching Parallel Algorithms Using the Binary-Forking Model. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (IPDPS (Workshops), 2024)

Parallel Integer Sort: Theory and Practice. - Xiaojun Dong 001; Laxman Dhulipala; Yan Gu 001; Yihan Sun 001 (PPoPP, 2024)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. - Magdalen Dobson Manohar; Zheqi Shen; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Harsha Vardhan Simhadri; Yihan Sun 001 (PPoPP, 2024)

Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library. - Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001; Letong Wang (SPAA, 2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering. - Laxman Dhulipala; Xiaojun Dong 001; Kishen N. Gowda; Yan Gu 001 (SPAA, 2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming. - Xiangyun Ding; Yan Gu 001; Yihan Sun 001 (SPAA, 2024)

PASGAL: Parallel And Scalable Graph Algorithm Library. - Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001; Letong Wang (CoRR, 2024)

Pkd-tree: Parallel kd-tree with Batch Updates. - Ziyang Men; Zheqi Shen; Yan Gu 001; Yihan Sun 001 (CoRR, 2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable. - Zijin Wan; Xiaojun Dong 001; Letong Wang; Enzuo Zhu; Yan Gu 001; Yihan Sun 001 (CoRR, 2024)

Parallel k-Core Decomposition: Theory and Practice (Abstract). - Youzhe Liu; Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2025)

Parallel kd-tree with Batch Updates (Abstract). - Ziyang Men; Zheqi Shen; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2025)

Parallel Contraction Hierarchies Can Be Efficient and Scalable (Abstract). - Zijin Wan; Xiaojun Dong 001; Letong Wang; Enzuo Zhu; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2025)

Parallel Cluster-BFS and Applications to Shortest Paths. - Letong Wang; Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2025)

Parallel Point-to-Point Shortest Paths and Batch Queries. - Xiaojun Dong 001; Andy Li; Yan Gu 001; Yihan Sun 001 (SPAA, 2025)

Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications. - Yiwei Zhao; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Laxman Dhulipala; Charles McGuffey; Phillip B. Gibbons (SPAA, 2025)

Parallel kd-tree with Batch Updates. - Ziyang Men; Zheqi Shen; Yan Gu 001; Yihan Sun 001 (Proc. ACM Manag. Data, 2025)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications. - Xiangyun Ding; Yan Gu 001; Yihan Sun 001 (CoRR, 2025)

Parallel k-Core Decomposition: Theory and Practice. - Youzhe Liu; Xiaojun Dong 001; Yan Gu 001; Yihan Sun 001 (Proc. ACM Manag. Data, 2025)