default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaxman Dhulipala
Person information
- affiliation: University of Maryland, College Park, USA
- affiliation (former): Carnegie Mellon University, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j16]Jamshed Khan, Tobias Rubel, Erin K. Molloy, Laxman Dhulipala, Rob Patro:
Fast, parallel, and cache-friendly suffix array construction. Algorithms Mol. Biol. 19(1): 16 (2024)- [j15]Jessica Shi
, Laxman Dhulipala, Julian Shun:
Parallel Algorithms for Hierarchical Nucleus Decomposition. Proc. ACM Manag. Data 2(1): 32:1-32:27 (2024) - [j14]Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu:
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. Proc. VLDB Endow. 17(9): 2307-2320 (2024) - [c45]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX 2024: 59-73 - [c44]Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract). HOPC@SPAA 2024 - [c43]Xiaojun Dong, Laxman Dhulipala, Yan Gu, Yihan Sun:
Parallel Integer Sort: Theory and Practice (Abstract). HOPC@SPAA 2024 - [c42]MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC Average Linkage! ICALP 2024: 18:1-18:18 - [c41]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. ICML 2024 - [c40]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 - [c39]Xiaojun Dong, Laxman Dhulipala, Yan Gu, Yihan Sun:
Parallel Integer Sort: Theory and Practice. PPoPP 2024: 301-315 - [c38]Laxman Dhulipala, Xiaojun Dong, Kishen N. Gowda, Yan Gu:
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering. SPAA 2024: 233-245 - [c37]Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic:
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. DISC 2024: 19:1-19:23 - [e2]Laxman Dhulipala, Yihan Sun:
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, HOPC 2024, Nantes, France, 17 June 2024. ACM 2024, ISBN 979-8-4007-0700-1 [contents] - [i47]Xiaojun Dong, Laxman Dhulipala, Yan Gu, Yihan Sun:
Parallel Integer Sort: Theory and Practice. CoRR abs/2401.00710 (2024) - [i46]Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Approximate Nearest Neighbor Search with Window Filters. CoRR abs/2402.00943 (2024) - [i45]Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki:
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. CoRR abs/2403.01797 (2024) - [i44]Laxman Dhulipala, George Z. Li:
Fine-Grained Privacy Guarantees for Coverage Problems. CoRR abs/2403.03337 (2024) - [i43]MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
It's Hard to HAC with Average Linkage! CoRR abs/2404.14730 (2024) - [i42]Laxman Dhulipala, Xiaojun Dong, Kishen N. Gowda, Yan Gu:
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering. CoRR abs/2404.19019 (2024) - [i41]Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu:
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. CoRR abs/2405.11671 (2024) - [i40]Laxman Dhulipala, Majid Hadian, Rajesh Jayaram, Jason Lee, Vahab Mirrokni:
MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings. CoRR abs/2405.19504 (2024) - [i39]MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki:
Efficient Centroid-Linkage Clustering. CoRR abs/2406.05066 (2024) - [i38]Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic:
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. CoRR abs/2408.13362 (2024) - [i37]Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber, Matthijs Douze, George Williams, Magdalen Dobson Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang:
Results of the Big ANN: NeurIPS'23 competition. CoRR abs/2409.17424 (2024) - 2023
- [j13]Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. Proc. ACM Manag. Data 1(3): 221:1-221:27 (2023) - [j12]Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, Wenjian Yu, Jie Tang, Richard Peng, Chi Wang:
Towards Lightweight and Automated Representation Learning System for Networks. IEEE Trans. Knowl. Data Eng. 35(9): 9613-9627 (2023) - [c36]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract). HOPC@SPAA 2023: 7-8 - [c35]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 - [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]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 - [c32]Jamshed Khan, Tobias Rubel, Laxman Dhulipala, Erin K. Molloy, Rob Patro:
Fast, Parallel, and Cache-Friendly Suffix Array Construction. WABI 2023: 16:1-16:21 - [e1]Laxman Dhulipala, Yihan Sun:
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, HOPC 2023, Orlando, FL, USA, 16 June 2023. ACM 2023 [contents] - [i36]Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala, Wenjian Yu, Jie Tang, Richard Peng, Chi Wang:
Towards Lightweight and Automated Representation Learning System for Networks. CoRR abs/2302.07084 (2023) - [i35]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) - [i34]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) - [i33]Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Algorithms for Hierarchical Nucleus Decomposition. CoRR abs/2306.08623 (2023) - [i32]Laxman Dhulipala, Jason Lee, Jakub Lacki, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. CoRR abs/2308.03578 (2023) - [i31]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) - [i30]Laxman Dhulipala, George Z. Li, Quanquan C. Liu:
Near-Optimal Differentially Private k-Core Decomposition. CoRR abs/2312.07706 (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) - [c31]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 - [c30]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 - [c29]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS 2022 - [c28]Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: supporting parallel and compressed purely-functional collections. PLDI 2022: 108-121 - [c27]Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, Yihan Sun:
The problem-based benchmark suite (PBBS), V2. PPoPP 2022: 445-447 - [c26]Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: a library for parallel computational geometry. PPoPP 2022: 450-452 - [c25]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 - [c24]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. SPAA 2022: 233-245 - [i29]Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections. CoRR abs/2204.06077 (2022) - [i28]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) - [i27]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR abs/2206.11654 (2022) - [i26]Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: A Library for Parallel Computational Geometry. CoRR abs/2207.01834 (2022) - [i25]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) - [i24]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
- [j10]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14(11): 2305-2313 (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]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition. Proc. VLDB Endow. 15(3): 583-596 (2021) - [j7]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) - [j6]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) - [j5]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8(3): 13:1-13:25 (2021) - [c23]Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Clique Counting and Peeling Algorithms. ACDA 2021: 135-146 - [c22]Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Read-Only Semi-External Model. APOCS 2021: 70-84 - [c21]Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu:
Parallel Batch-Dynamic k-Clique Counting. APOCS 2021: 129-143 - [c20]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML 2021: 2676-2686 - [c19]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. SIGMOD Conference 2021: 1851-1864 - [c18]Jiezhong Qiu, Laxman Dhulipala, Jie Tang, Richard Peng, Chi Wang:
LightNE: A Lightweight Graph Processing System for Network Embedding. SIGMOD Conference 2021: 2281-2289 - [c17]Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey:
The Processing-in-Memory Model. SPAA 2021: 295-306 - [i23]Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic k-Core Decomposition. CoRR abs/2106.03824 (2021) - [i22]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) - [i21]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR abs/2106.05610 (2021) - [i20]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. CoRR abs/2108.01731 (2021) - [i19]Jessica Shi, Laxman Dhulipala, Julian Shun:
Theoretically and Practically Efficient Parallel Nucleus Decomposition. CoRR abs/2111.10980 (2021) - [i18]Rahul Yesantharao, Yiqiu Wang, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic kd-Trees. CoRR abs/2112.06188 (2021) - 2020
- [j4]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) - [j3]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13(13): 3588-3602 (2020) - [j2]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) - [c16]Changwan Hong, Laxman Dhulipala, Julian Shun:
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs. PACT 2020: 55-69 - [c15]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 - [c14]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Parallel Batch-Dynamic Trees via Change Propagation. ESA 2020: 2:1-2:23 - [c13]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 - [c12]Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun:
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. SODA 2020: 1300-1319 - [c11]Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala:
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. SPAA 2020: 507-509 - [i17]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. CoRR abs/2002.05129 (2020) - [i16]Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Clique Counting and Peeling Algorithms. CoRR abs/2002.10047 (2020) - [i15]Laxman Dhulipala, Quanquan C. Liu, Julian Shun:
Parallel Batch-Dynamic k-Clique Counting. CoRR abs/2003.13585 (2020) - [i14]Laxman Dhulipala, Changwan Hong, Julian Shun:
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms. CoRR abs/2008.03909 (2020) - [i13]Changwan Hong, Laxman Dhulipala, Julian Shun:
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs. CoRR abs/2008.11839 (2020) - [i12]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020) - [i11]Tom Tseng, Laxman Dhulipala, Julian Shun:
Parallel Index-Based Structural Graph Clustering and Its Approximation. CoRR abs/2012.11188 (2020)
2010 – 2019
- 2019
- [j1]Laxman Dhulipala:
SPAA 2018 Review. SIGACT News 50(1): 61-64 (2019) - [c10]Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. ALENEX 2019: 92-106 - [c9]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c8]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Low-latency graph streaming using compressed purely-functional trees. PLDI 2019: 918-934 - [c7]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [c6]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala:
Parallel Batch-Dynamic Graph Connectivity. SPAA 2019: 381-392 - [i10]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala:
Parallel Batch-Dynamic Graph Connectivity. CoRR abs/1903.08794 (2019) - [i9]Laxman Dhulipala, Julian Shun, Guy E. Blelloch:
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees. CoRR abs/1904.08380 (2019) - [i8]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - [i7]David Durfee, Laxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun:
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. CoRR abs/1908.01956 (2019) - [i6]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019) - [i5]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) - [i4]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
- [c5]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA 2018: 393-404 - [i3]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. CoRR abs/1805.05208 (2018) - [i2]Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. CoRR abs/1810.10738 (2018) - 2017
- [c4]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA 2017: 293-304 - 2016
- [c3]Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita:
Compressing Graphs and Indexes with Recursive Graph Bisection. KDD 2016: 1535-1544 - [i1]Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita:
Compressing Graphs and Indexes with Recursive Graph Bisection. CoRR abs/1602.08820 (2016) - 2015
- [c2]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. DCC 2015: 403-412 - 2014
- [c1]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
A simple and practical linear-work parallel algorithm for connectivity. SPAA 2014: 143-153
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-10-25 20:11 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:
