default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulian Shun
信哲文
Person information
- affiliation: Massachusetts Institute of Technology, MA, USA
- unicode name: 信哲文
- award (2023): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Jessica Shi
, Laxman Dhulipala, Julian Shun:
Parallel Algorithms for Hierarchical Nucleus Decomposition. Proc. ACM Manag. Data 2(1): 32:1-32:27 (2024)- [c69]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX 2024: 59-73 - [c68]Junhong Lin, Xiaojie Guo, Yada Zhu, Samuel Mitchell, Erik Altman, Julian Shun:
FraudGT: A Simple, Effective, and Efficient Graph Transformer for Financial Fraud Detection. ICAIF 2024: 292-300 - [c67]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. ICML 2024 - [c66]Quanquan C. Liu, Julian Shun, Igor Zablotchi:
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads. PPoPP 2024: 286-300 - [i49]Joana M. F. da Trindade, Julian Shun, Samuel Madden, Nesime Tatbul:
Kairos: Efficient Temporal Graph Analytics on a Single Machine. CoRR abs/2401.02563 (2024) - [i48]Quanquan C. Liu, Julian Shun, Igor Zablotchi:
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads. CoRR abs/2401.08015 (2024) - [i47]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. CoRR abs/2402.00943 (2024) - [i46]Junhong Lin, Xiaojie Guo, Shuaicheng Zhang, Dawei Zhou, Yada Zhu, Julian Shun:
When Heterophily Meets Heterogeneity: New Graph Benchmarks and Effective Methods. CoRR abs/2407.10916 (2024) - [i45]Steven Raphael, Julian Shun:
Faster Parallel Triangular Maximally Filtered Graphs and Hierarchical Clustering. CoRR abs/2408.09399 (2024) - [i44]Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun:
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. CoRR abs/2411.10290 (2024) - [i43]Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang:
Towards Scalable and Practical Batch-Dynamic Connectivity. CoRR abs/2411.11781 (2024) - [i42]Younghun Roh, Yuanhao Wei, Eric Ruppert, Panagiota Fatourou, Siddhartha Jayanti, Julian Shun:
Aggregating Funnels for Faster Fetch&Add and Queues. CoRR abs/2411.14420 (2024) - 2023
- [j16]Yossi Azar, Julian Shun:
Introduction to the Special Issue for SPAA'21. ACM Trans. Parallel Comput. 10(4): 17:1 (2023) - [c65]Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering. ACDA 2023: 49-62 - [c64]Yihao Huang, Claire Wang, Jessica Shi, Julian Shun:
Efficient Algorithms for Parallel Bi-core Decomposition. APOCS 2023: 17-32 - [c63]Zhi Wei Gan, Grace Cai, Noble Harasha, Nancy A. Lynch, Julian Shun:
ParSwarm: A C++ Framework for Evaluating Distributed Algorithms for Robot Swarms. ApPLIED@PODC 2023: 14:1-14:5 - [c62]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract). HOPC@SPAA 2023: 7-8 - [c61]Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering (Abstract). HOPC@SPAA 2023: 11-12 - [c60]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 - [c59]Shangdi Yu, Julian Shun:
Parallel Filtered Graphs for Hierarchical Clustering. ICDE 2023: 1967-1980 - [e2]Gonzalo Navarro, Julian Shun:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023. SIAM 2023, ISBN 978-1-61197-756-1 [contents] - [e1]Kunal Agrawal, Julian Shun:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023. ACM 2023, ISBN 978-1-4503-9545-8 [contents] - [i41]Shangdi Yu, Julian Shun:
Parallel Filtered Graphs for Hierarchical Clustering. CoRR abs/2303.05009 (2023) - [i40]Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering. CoRR abs/2305.11335 (2023) - [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) - [i37]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
- [j15]Jessica Shi, Louisa Ruixue Huang, Julian Shun:
Parallel Five-cycle Counting Algorithms. ACM J. Exp. Algorithmics 27: 4.1:1-4.1:23 (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 - [p1]Jessica Shi, Julian Shun:
Parallel Algorithms for Butterfly Computations. Massive Graph Analytics 2022: 287-330 - [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) - [j12]Erfan Zamanian, Julian Shun, Carsten Binnig, Tim Kraska:
Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks. SIGMOD Rec. 50(1): 15-22 (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 - [c51]Yan Gu, Omar Obeya, Julian Shun:
Parallel In-Place Algorithms: Theory and Practice. APOCS 2021: 114-128 - [c50]Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu:
Parallel Batch-Dynamic k-Clique Counting. APOCS 2021: 129-143 - [c49]Ajay Brahmakshatriya, Yunming Zhang, Changwan Hong, Shoaib Kamil, Julian Shun, Saman P. Amarasinghe:
Compiling Graph Applications for GPU s with GraphIt. CGO 2021: 248-261 - [c48]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 - [c47]Ajay Brahmakshatriya, Emily Furst, Victor A. Ying, Claire Hsu, Changwan Hong, Max Ruttenberg, Yunming Zhang, Dai Cheol Jung, Dustin Richmond, Michael B. Taylor, Julian Shun, Mark Oskin, Daniel Sánchez, Saman P. Amarasinghe:
Taming the Zoo: The Unified GraphIt Compiler Framework for Novel Architectures. ISCA 2021: 429-442 - [c46]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. SIGMOD Conference 2021: 1851-1864 - [c45]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 - [c44]Siddhartha Jayanti, Julian Shun:
Fast Arrays: Atomic Arrays with Constant Time Initialization. DISC 2021: 25:1-25:19 - [c43]Louisa Ruixue Huang, Jessica Shi, Julian Shun:
Parallel Five-Cycle Counting Algorithms. SEA 2021: 2:1-2:18 - [i33]Yan Gu, Omar Obeya, Julian Shun:
Parallel In-Place Algorithms: Theory and Practice. CoRR abs/2103.01216 (2021) - [i32]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) - [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
- [j9]Julian Shun:
Improved parallel construction of wavelet trees and rank/select structures. Inf. Comput. 273: 104516 (2020) - [j8]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. J. ACM 67(5): 27:1-27:27 (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 - [c41]Jessica Shi, Julian Shun:
Parallel Algorithms for Butterfly Computations. APOCS 2020: 16-30 - [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 - [c39]Joana M. F. da Trindade, Konstantinos Karanasos, Carlo Curino, Samuel Madden, Julian Shun:
Kaskade: Graph Views for Efficient Graph Analytics. ICDE 2020: 193-204 - [c38]Julian Shun:
Practical parallel hypergraph algorithms. PPoPP 2020: 232-249 - [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 - [c36]Erfan Zamanian, Julian Shun, Carsten Binnig, Tim Kraska:
Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks. SIGMOD Conference 2020: 511-526 - [c35]Yiqiu Wang, Yan Gu, Julian Shun:
Theoretically-Efficient and Practical Parallel DBSCAN. SIGMOD Conference 2020: 2555-2571 - [c34]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Randomized Incremental Convex Hull is Highly Parallel. SPAA 2020: 103-115 - [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) - [i23]Yiqiu Wang, Shangdi Yu, Yan Gu, Julian Shun:
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. CoRR abs/2010.02379 (2020) - [i22]Ajay Brahmakshatriya, Yunming Zhang, Changwan Hong, Shoaib Kamil, Julian Shun, Saman P. Amarasinghe:
Compliation Techniques for Graphs Algorithms on GPUs. CoRR abs/2012.07990 (2020) - [i21]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. CoRR abs/2012.11188 (2020)
2010 – 2019
- 2019
- [j5]Kimon Fountoulakis, Farbod Roosta-Khorasani, Julian Shun, Xiang Cheng, Michael W. Mahoney:
Variational perspective on local graph clustering. Math. Program. 174(1-2): 553-573 (2019) - [c33]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Low-latency graph streaming using compressed purely-functional trees. PLDI 2019: 918-934 - [c32]Yu Xia, Xiangyao Yu, William S. Moses, Julian Shun, Srinivas Devadas:
LiTM: A Lightweight Deterministic Software Transactional Memory System. PMAM@PPoPP 2019: 1-10 - [c31]Omar Obeya, Endrias Kahssay, Edward Fan, Julian Shun:
Theoretically-Efficient and Practical Parallel In-Place Radix Sorting. SPAA 2019: 213-224 - [i20]Laxman Dhulipala, Julian Shun, Guy E. Blelloch:
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees. CoRR abs/1904.08380 (2019) - [i19]Joana M. F. da Trindade, Konstantinos Karanasos, Carlo Curino, Samuel Madden, Julian Shun:
Kaskade: Graph Views for Efficient Graph Analytics. CoRR abs/1906.05162 (2019) - [i18]Jessica Shi, Julian Shun:
Parallel Algorithms for Butterfly Computations. CoRR abs/1907.08607 (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) - [i15]Yiqiu Wang, Yan Gu, Julian Shun:
Theoretically-Efficient and Practical Parallel DBSCAN. CoRR abs/1912.06255 (2019) - 2018
- [j4]Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, Saman P. Amarasinghe:
GraphIt: a high-performance graph DSL. Proc. ACM Program. Lang. 2(OOPSLA): 121:1-121:30 (2018) - [c30]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 - [c29]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. SPAA 2018: 235-246 - [c28]Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. SPAA 2018: 247-258 - [c27]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA 2018: 393-404 - [i14]Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, Saman P. Amarasinghe:
GraphIt - A High-Performance DSL for Graph Analytics. CoRR abs/1805.00923 (2018) - [i13]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. CoRR abs/1805.05208 (2018) - [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]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. CoRR abs/1810.05303 (2018) - [i9]Erfan Zamanian, Julian Shun, Carsten Binnig, Tim Kraska:
Chiller: Contention-centric Transaction Execution and Data Partitioning for Fast Networks. CoRR abs/1811.12204 (2018) - 2017
- [j3]Julian Labeit, Julian Shun, Guy E. Blelloch:
Parallel lightweight wavelet tree, suffix array and FM-index construction. J. Discrete Algorithms 43: 2-17 (2017) - [c26]Julian Shun:
Improved Parallel Construction of Wavelet Trees and Rank/Select Structures. DCC 2017: 92-101 - [c25]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA 2017: 293-304 - [i8]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
- [j2]Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, Michael W. Mahoney:
Parallel Local Graph Clustering. Proc. VLDB Endow. 9(12): 1041-1052 (2016) - [c24]Julian Labeit, Julian Shun, Guy E. Blelloch:
Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction. DCC 2016: 33-42 - [c23]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 - [c22]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 - [c21]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. SPAA 2016: 467-478 - [i7]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) - [i6]Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, Michael W. Mahoney:
Parallel Local Graph Clustering. CoRR abs/1604.07515 (2016) - [i5]Julian Shun:
Improved Parallel Construction of Wavelet Trees and Rank/Select Structures. CoRR abs/1610.03524 (2016) - 2015
- [c20]Julian Shun:
Parallel Wavelet Tree Construction. DCC 2015: 63-72 - [c19]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. DCC 2015: 403-412 - [c18]Niklas Baumstark, Guy E. Blelloch, Julian Shun:
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. ESA 2015: 106-117 - [c17]Julian Shun, Kanat Tangwongsan:
Multicore triangle computations without tuning. ICDE 2015: 149-160 - [c16]Julian Shun:
An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs. KDD 2015: 1095-1104 - [c15]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 - [c14]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. SPAA 2015: 1-12 - [c13]Yan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch:
A Top-Down Parallel Semisort. SPAA 2015: 24-34 - [i4]Niklas Baumstark, Guy E. Blelloch, Julian Shun:
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. CoRR abs/1507.01926 (2015) - [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
- [j1]Julian Shun, Guy E. Blelloch:
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction. ACM Trans. Parallel Comput. 1(1): 8:1-8:20 (2014) - [c12]Julian Shun:
Fast Parallel Computation of Longest Common Prefixes. SC 2014: 387-398 - [c11]Julian Shun, Guy E. Blelloch:
Phase-concurrent hash tables for determinism. SPAA 2014: 96-107 - [c10]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
A simple and practical linear-work parallel algorithm for connectivity. SPAA 2014: 143-153 - [c9]Aapo Kyrola, Julian Shun, Guy E. Blelloch:
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest. SEA 2014: 123-137 - [i2]Julian Shun:
Parallel Wavelet Tree Construction. CoRR abs/1407.8142 (2014) - 2013
- [c8]Julian Shun, Fuyao Zhao:
Practical Parallel Lempel-Ziv Factorization. DCC 2013: 123-132 - [c7]Julian Shun, Guy E. Blelloch:
Ligra: a lightweight graph processing framework for shared memory. PPoPP 2013: 135-146 - [c6]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. PPoPP 2013: 299-300 - [c5]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. SPAA 2013: 152-163 - 2012
- [c4]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun:
Internally deterministic parallel algorithms can be fast. PPoPP 2012: 181-192 - [c3]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Brief announcement: the problem based benchmark suite. SPAA 2012: 68-70 - [c2]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy sequential maximal independent set and matching are parallel on average. SPAA 2012: 308-317 - [i1]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR abs/1202.3205 (2012) - 2011
- [c1]Guy E. Blelloch, Julian Shun:
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. ALENEX 2011: 48-58
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 2025-01-23 21:29 CET 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:
