Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Gu 0001
Person information
- affiliation: University of California, Riverside, Department of Computer Science and Engineering, CA, USA
- affiliation (former): Massachusetts Institute of Technology, Cambridge, MA, USA
- affiliation (former, PhD 2018): Carnegie Mellon University, Pittsburgh, PA, USA
- affiliation (former): Tsinghua University, Department of Computer Science and Technology, Beijing, China
- not to be confused with: Yan Gu 0011
Other persons with the same name
- Yan Gu — disambiguation page
- Yan Gu 0002 — HP Singapore
- Yan Gu 0003 — Continental Automotive Pte Ltd, Singapore
- Yan Gu 0004 — Auburn University, AL, USA
- Yan Gu 0005 — Zhejiang University, Hangzhou, China
- Yan Gu 0007
![[0000-0002-8510-3193]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8510-3193")
— Qingdao University, College of Mathematics, China (and 1 more) - Yan Gu 0008 — Purdue University
- Yan Gu 0009 — University of Melbourne, Australia
- Yan Gu 0010 — North Dakota State University
- Yan Gu 0011 — Tsinghua University, Department of Computer Science and Technology, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c42]Magdalen Dobson Manohar, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, Yihan Sun:
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. PPoPP 2024: 270-285- [c41]Xiaojun Dong, Laxman Dhulipala, Yan Gu, Yihan Sun:
Parallel Integer Sort: Theory and Practice. PPoPP 2024: 301-315 - [i33]Xiaojun Dong, Laxman Dhulipala, Yan Gu, Yihan Sun:
Parallel Integer Sort: Theory and Practice. CoRR abs/2401.00710 (2024) - 2023
- [j13]Letong Wang, Xiaojun Dong, Yan Gu, Yihan Sun:
Parallel Strong Connectivity Based on Faster Reachability. Proc. ACM Manag. Data 1(2): 114:1-114:29 (2023) - [j12]Letong Wang, Xiangyun Ding, Yan Gu, Yihan Sun:
Fast and Space-Efficient Parallel Algorithms for Influence Maximization. Proc. VLDB Endow. 17(3): 400-413 (2023) - [c40]Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu, Yihan Sun:
Efficient Parallel Output-Sensitive Edit Distance. ESA 2023: 40:1-40:20 - [c39]Xiaojun Dong, Letong Wang, Yan Gu, Yihan Sun:
Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract). HOPC@SPAA 2023: 5-6 - [c38]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract). HOPC@SPAA 2023: 13-14 - [c37]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract). HOPC@SPAA 2023: 17-18 - [c36]Letong Wang, Xiaojun Dong, Yan Gu, Yihan Sun:
Parallel Strong Connectivity Based on Faster Reachability (Abstract). HOPC@SPAA 2023: 23-24 - [c35]Xiaojun Dong, Letong Wang, Yan Gu, Yihan Sun:
Provably Fast and Space-Efficient Parallel Biconnectivity. PPoPP 2023: 52-65 - [c34]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-trie: A Skew-resistant Trie for Processing-in-Memory. SPAA 2023: 1-14 - [c33]Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, Zijin Wan:
Parallel Longest Increasing Subsequence and van Emde Boas Trees. SPAA 2023: 327-340 - [c32]Xiaojun Dong, Yunshu Wu, Zhongqi Wang, Laxman Dhulipala, Yan Gu, Yihan Sun:
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems. SPAA 2023: 341-353 - [i32]Xiaojun Dong, Letong Wang, Yan Gu, Yihan Sun:
Provably Fast and Space-Efficient Parallel Biconnectivity. CoRR abs/2301.01356 (2023) - [i31]Letong Wang, Xiaojun Dong, Yan Gu, Yihan Sun:
Parallel Strong Connectivity Based on Faster Reachability. CoRR abs/2303.04934 (2023) - [i30]Xiaojun Dong, Yunshu Wu, Zhongqi Wang, Laxman Dhulipala, Yan Gu, Yihan Sun:
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems. CoRR abs/2304.10078 (2023) - [i29]Magdalen Dobson, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, Yihan Sun:
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. CoRR abs/2305.04359 (2023) - [i28]Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu, Yihan Sun:
Efficient Parallel Output-Sensitive Edit Distance. CoRR abs/2306.17461 (2023) - [i27]Letong Wang, Xiangyun Ding, Yan Gu, Yihan Sun:
Fast and Space-Efficient Parallel Algorithms for Influence Maximization. CoRR abs/2311.07554 (2023) - 2022
- [j11]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-tree: A Skew-resistant Index for Processing-in-Memory. Proc. VLDB Endow. 16(4): 946-958 (2022) - [j10]Shaokun Zheng, Zhiqian Zhou, Xin Chen, Difei Yan, Chuyan Zhang, Yuefeng Geng, Yan Gu, Kun Xu:
LuisaRender: A High-Performance Rendering Framework with Layered and Unified Interfaces on Stream Architectures. ACM Trans. Graph. 41(6): 232:1-232:19 (2022) - [c31]Yan Gu, Zachary Napier, Yihan Sun:
Analysis of Work-Stealing and Parallel Cache Complexity. APOCS 2022: 46-60 - [c30]Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: A Library for Parallel Computational Geometry. ESA 2022: 88:1-88:19 - [c29]Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: supporting parallel and compressed purely-functional collections. PLDI 2022: 108-121 - [c28]Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: a library for parallel computational geometry. PPoPP 2022: 450-452 - [c27]Yan Gu, Zachary Napier, Yihan Sun, Letong Wang:
Parallel Cover Trees and their Applications. SPAA 2022: 259-272 - [c26]Zheqi Shen, Zijin Wan, Yan Gu, Yihan Sun:
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. SPAA 2022: 273-286 - [i26]Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections. CoRR abs/2204.06077 (2022) - [i25]Zheqi Shen, Zijin Wan, Yan Gu, Yihan Sun:
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. CoRR abs/2205.13077 (2022) - [i24]Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: A Library for Parallel Computational Geometry. CoRR abs/2207.01834 (2022) - [i23]Yan Gu, Zheqi Shen, Yihan Sun, Zijin Wan:
A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence. CoRR abs/2208.09809 (2022) - [i22]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-tree: A Skew-resistant Index for Processing-in-Memory. CoRR abs/2211.10516 (2022) - 2021
- [b1]Yan Gu:
Write-efficient Algorithms. Carnegie Mellon University, USA, 2021 - [j9]Shangdi Yu, Yiqiu Wang, Yan Gu, Laxman Dhulipala, Julian Shun:
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain. Proc. VLDB Endow. 15(2): 285-298 (2021) - [j8]Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
GeoGraph: A Framework for Graph Processing on Geometric Data. ACM SIGOPS Oper. Syst. Rev. 55(1): 38-46 (2021) - [c25]Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Read-Only Semi-External Model. APOCS 2021: 70-84 - [c24]Yan Gu, Omar Obeya, Julian Shun:
Parallel In-Place Algorithms: Theory and Practice. APOCS 2021: 114-128 - [c23]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. SoCG 2021: 60:1-60:16 - [c22]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering. SIGMOD Conference 2021: 1982-1995 - [c21]Xiaojun Dong, Yan Gu, Yihan Sun, Yunming Zhang:
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. SPAA 2021: 184-197 - [c20]Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey:
The Processing-in-Memory Model. SPAA 2021: 295-306 - [i21]Yan Gu, Omar Obeya, Julian Shun:
Parallel In-Place Algorithms: Theory and Practice. CoRR abs/2103.01216 (2021) - [i20]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering. CoRR abs/2104.01126 (2021) - [i19]Xiaojun Dong, Yan Gu, Yihan Sun, Yunming Zhang:
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. CoRR abs/2105.06145 (2021) - [i18]Shangdi Yu, Yiqiu Wang, Yan Gu, Laxman Dhulipala, Julian Shun:
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain. CoRR abs/2106.04727 (2021) - [i17]Yan Gu, Zachary Napier, Yihan Sun:
Analysis of Work-Stealing and Parallel Cache Complexity. CoRR abs/2111.04994 (2021) - 2020
- [j7]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. J. ACM 67(5): 27:1-27:27 (2020) - [j6]Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun:
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. Proc. VLDB Endow. 13(9): 1598-1613 (2020) - [c19]Guy E. Blelloch, Yan Gu:
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. APOCS 2020: 105-119 - [c18]Yiqiu Wang, Yan Gu, Julian Shun:
Theoretically-Efficient and Practical Parallel DBSCAN. SIGMOD Conference 2020: 2555-2571 - [c17]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. SPAA 2020: 89-102 - [c16]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Randomized Incremental Convex Hull is Highly Parallel. SPAA 2020: 103-115 - [i16]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. CoRR abs/2010.02379 (2020)
2010 – 2019
- 2019
- [i15]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. CoRR abs/1903.04650 (2019) - [i14]Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun:
Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. CoRR abs/1910.12310 (2019) - [i13]Yiqiu Wang, Yan Gu, Julian Shun:
Theoretically-Efficient and Practical Parallel DBSCAN. CoRR abs/1912.06255 (2019) - 2018
- [c15]Yan Gu, Yihan Sun, Guy E. Blelloch:
Algorithmic Building Blocks for Asymmetric Memories. ESA 2018: 44:1-44:15 - [c14]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. IPDPS 2018: 711-722 - [c13]Yan Gu:
Survey: Computational Models for Asymmetric Read and Write Costs. IPDPS Workshops 2018: 733-743 - [c12]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. SPAA 2018: 235-246 - [c11]Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. SPAA 2018: 247-258 - [i12]Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. CoRR abs/1805.05580 (2018) - [i11]Guy E. Blelloch, Yan Gu, Yihan Sun, Julian Shun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. CoRR abs/1805.05592 (2018) - [i10]Yan Gu, Yihan Sun, Guy E. Blelloch:
Algorithmic Building Blocks for Asymmetric Memories. CoRR abs/1806.10370 (2018) - [i9]Yan Gu:
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra. CoRR abs/1809.09330 (2018) - [i8]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. CoRR abs/1810.05303 (2018) - 2017
- [c10]Guy E. Blelloch, Yan Gu, Yihan Sun:
Efficient Construction of Probabilistic Tree Embeddings. ICALP 2017: 26:1-26:14 - [i7]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. CoRR abs/1710.02637 (2017) - 2016
- [c9]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms with Asymmetric Read and Write Costs. ESA 2016: 14:1-14:18 - [c8]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Parallel Algorithms for Asymmetric Read-Write Costs. SPAA 2016: 145-156 - [c7]Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest Paths Using Radius Stepping. SPAA 2016: 443-454 - [c6]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. SPAA 2016: 467-478 - [i6]Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest-Paths Using Radius Stepping. CoRR abs/1602.03881 (2016) - [i5]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. CoRR abs/1603.03505 (2016) - [i4]Guy E. Blelloch, Yan Gu, Yihan Sun:
A New Efficient Construction on Probabilistic Tree Embeddings. CoRR abs/1605.04651 (2016) - 2015
- [j5]Yan Gu, Yong He, Guy E. Blelloch:
Ray Specialized Contraction on Bounding Volume Hierarchies. Comput. Graph. Forum 34(7): 309-318 (2015) - [c5]Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. SODA 2015: 431-448 - [c4]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. SPAA 2015: 1-12 - [c3]Yan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch:
A Top-Down Parallel Semisort. SPAA 2015: 24-34 - [i3]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms under Asymmetric Read and Write Costs. CoRR abs/1511.01038 (2015) - 2014
- [j4]Yong He, Yan Gu, Kayvon Fatahalian:
Extending the graphics pipeline with adaptive, multi-rate shading. ACM Trans. Graph. 33(4): 142:1-142:12 (2014) - [i2]Yan Gu, Yihan Sun, Yong He:
Cascading A*: a Parallel Approach to Approximate Heuristic Search. CoRR abs/1406.0955 (2014) - 2013
- [j3]Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. Discret. Comput. Geom. 50(2): 374-408 (2013) - [j2]Xian-Ying Li, Yan Gu, Shi-Min Hu, Ralph R. Martin:
Mixed-Domain Edge-Aware Image Manipulation. IEEE Trans. Image Process. 22(5): 1915-1925 (2013) - [c2]Yan Gu, Yong He, Kayvon Fatahalian, Guy E. Blelloch:
Efficient BVH Construction via Approximate Agglomerative Clustering. High Performance Graphics 2013: 81-88 - 2012
- [c1]Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. SWAT 2012: 177-188 - [i1]Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. CoRR abs/1207.6409 (2012) - 2011
- [j1]Xian-Ying Li, Tao Ju, Yan Gu, Shi-Min Hu:
A geometric study of v-style pop-ups: theories and algorithms. ACM Trans. Graph. 30(4): 98 (2011)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-14 03:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
