Остановите войну!
for scientists:
default search action
Julian Shun
- > Home > Persons > Julian Shun
Publications
- 2024
- [i42]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. CoRR abs/2402.00943 (2024) - 2023
- [c62]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract). HOPC@SPAA 2023: 7-8 - [i39]Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Algorithms for Hierarchical Nucleus Decomposition. CoRR abs/2306.08623 (2023) - [i38]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. CoRR abs/2311.04333 (2023) - 2022
- [c58]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 - [c57]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 - [c56]Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: a library for parallel computational geometry. PPoPP 2022: 450-452 - [c55]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 - [c54]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. SPAA 2022: 233-245 - [i36]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. CoRR abs/2205.04956 (2022) - [i35]Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: A Library for Parallel Computational Geometry. CoRR abs/2207.01834 (2022) - [i34]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
- [j14]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) - [j13]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition. Proc. VLDB Endow. 15(3): 583-596 (2021) - [j11]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) - [j10]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Trans. Parallel Comput. 8(1): 4:1-4:70 (2021) - [c53]Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Clique Counting and Peeling Algorithms. ACDA 2021: 135-146 - [c52]Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Read-Only Semi-External Model. APOCS 2021: 70-84 - [c50]Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu:
Parallel Batch-Dynamic k-Clique Counting. APOCS 2021: 129-143 - [c46]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. SIGMOD Conference 2021: 1851-1864 - [i31]Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic k-Core Decomposition. CoRR abs/2106.03824 (2021) - [i30]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) - [i29]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition. CoRR abs/2111.10980 (2021) - [i28]Rahul Yesantharao, Yiqiu Wang, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic kd-Trees. CoRR abs/2112.06188 (2021) - 2020
- [j7]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) - [j6]Laxman Dhulipala, Changwan Hong, Julian Shun:
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms. Proc. VLDB Endow. 14(4): 653-667 (2020) - [c42]Changwan Hong, Laxman Dhulipala, Julian Shun:
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs. PACT 2020: 55-69 - [c40]Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen, Laxman Dhulipala, Shoaib Kamil, Saman P. Amarasinghe, Julian Shun:
Optimizing ordered graph algorithms with GraphIt. CGO 2020: 158-170 - [c37]Laxman Dhulipala, Jessica Shi, Tom Tseng, Guy E. Blelloch, Julian Shun:
The Graph Based Benchmark Suite (GBBS). GRADES-NDA@SIGMOD 2020: 11:1-11:8 - [i27]Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Clique Counting and Peeling Algorithms. CoRR abs/2002.10047 (2020) - [i26]Laxman Dhulipala, Quanquan C. Liu, Julian Shun:
Parallel Batch-Dynamic k-Clique Counting. CoRR abs/2003.13585 (2020) - [i25]Laxman Dhulipala, Changwan Hong, Julian Shun:
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms. CoRR abs/2008.03909 (2020) - [i24]Changwan Hong, Laxman Dhulipala, Julian Shun:
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs. CoRR abs/2008.11839 (2020) - [i21]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. CoRR abs/2012.11188 (2020) - 2019
- [c33]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Low-latency graph streaming using compressed purely-functional trees. PLDI 2019: 918-934 - [i20]Laxman Dhulipala, Julian Shun, Guy E. Blelloch:
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees. CoRR abs/1904.08380 (2019) - [i17]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) - [i16]Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen, Laxman Dhulipala, Shoaib Kamil, Saman P. Amarasinghe, Julian Shun:
PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms. CoRR abs/1911.07260 (2019) - 2018
- [c27]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA 2018: 393-404 - [i13]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. CoRR abs/1805.05208 (2018) - 2017
- [c25]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA 2017: 293-304 - 2015
- [c19]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. DCC 2015: 403-412 - 2014
- [c10]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
A simple and practical linear-work parallel algorithm for connectivity. SPAA 2014: 143-153
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-25 02:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint