default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShangdi Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j3]Xiang Fu, Shangdi Yu
, Austin R. Benson:
Modelling and analysis of tagging networks in Stack Exchange communities. J. Complex Networks 8(5) (2021)- [j2]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) - [j1]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)
Conference and Workshop Papers
- 2024
- [c13]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. ICML 2024 - 2023
- [c12]Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering. ACDA 2023: 49-62 - [c11]Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering (Abstract). HOPC@SPAA 2023: 11-12 - [c10]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 - [c9]Shangdi Yu, Julian Shun:
Parallel Filtered Graphs for Hierarchical Clustering. ICDE 2023: 1967-1980 - [c8]Horace He, Shangdi Yu:
Transcending Runtime-Memory Tradeoffs in Checkpointing by being Fusion Aware. MLSys 2023 - 2022
- [c7]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 - [c6]Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, Shangdi Yu:
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs. FOCS 2022: 754-765 - [c5]Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: a library for parallel computational geometry. PPoPP 2022: 450-452 - [c4]Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. SPAA 2022: 191-204 - 2021
- [c3]Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu:
Parallel Batch-Dynamic k-Clique Counting. APOCS 2021: 129-143 - [c2]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 - [c1]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
Informal and Other Publications
- 2024
- [i14]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. CoRR abs/2402.00943 (2024) - 2023
- [i13]Shangdi Yu, Julian Shun:
Parallel Filtered Graphs for Hierarchical Clustering. CoRR abs/2303.05009 (2023) - [i12]Zhen Guo, Peiqi Wang, Yanwei Wang, Shangdi Yu:
Dr. LLaMA: Improving Small Language Models on PubMedQA via Generative Data Augmentation. CoRR abs/2305.07804 (2023) - [i11]Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering. CoRR abs/2305.11335 (2023) - [i10]Zhen Guo, Shangdi Yu:
AuthentiGPT: Detecting Machine-Generated Text via Black-Box Language Models Denoising. CoRR abs/2311.07700 (2023) - [i9]Shangdi Yu, Joshua Engels, Yihao Huang, Julian Shun:
PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search. CoRR abs/2312.03940 (2023) - 2022
- [i8]Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: A Library for Parallel Computational Geometry. CoRR abs/2207.01834 (2022) - [i7]Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, Shangdi Yu:
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs. CoRR abs/2211.10887 (2022) - 2021
- [i6]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) - [i5]Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic k-Core Decomposition. CoRR abs/2106.03824 (2021) - [i4]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) - 2020
- [i3]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. CoRR abs/2010.02379 (2020) - 2019
- [i2]Xiang Fu, Shangdi Yu, Austin R. Benson:
Modeling and Analysis of Tagging Networks in Stack Exchange Communities. CoRR abs/1902.02372 (2019) - [i1]Michelangelo Harris, Brian Liu, Cean Park, Ravi Ramireddy, Gloria Ren, Max Ren, Shangdi Yu, Andrew Daw, Jamol Pender:
Analyzing the Spotify Top 200 Through a Point Process Lens. CoRR abs/1910.01445 (2019)
Coauthor Index
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-09-04 01:23 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:
