A simple and practical linear-work parallel algorithm for connectivity. - Julian Shun; Laxman Dhulipala; Guy E. Blelloch (SPAA, 2014)

Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. - Julian Shun; Laxman Dhulipala; Guy E. Blelloch (DCC, 2015)

Compressing Graphs and Indexes with Recursive Graph Bisection. - Laxman Dhulipala; Igor Kabiljo; Brian Karrer; Giuseppe Ottaviano; Sergey Pupyrev; Alon Shalita (KDD, 2016)

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. - Laxman Dhulipala; Guy E. Blelloch; Julian Shun (SPAA, 2017)

Batch-Parallel Euler Tour Trees. - Thomas Tseng; Laxman Dhulipala; Guy E. Blelloch (ALENEX, 2019)

Near-Optimal Massively Parallel Graph Connectivity. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni (FOCS, 2019)

Low-latency graph streaming using compressed purely-functional trees. - Laxman Dhulipala; Guy E. Blelloch; Julian Shun (PLDI, 2019)

Parallel Batch-Dynamic Graph Connectivity. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala (SPAA, 2019)

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. - Laxman Dhulipala; Charles McGuffey; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Phillip B. Gibbons; Julian Shun (CoRR, 2019)

PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms. - Yunming Zhang; Ajay Brahmakshatriya; Xinyi Chen; Laxman Dhulipala; Shoaib Kamil 001; Saman P. Amarasinghe; Julian Shun (CoRR, 2019)

SPAA 2018 Review. - Laxman Dhulipala (SIGACT News, 2019)

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs. - Changwan Hong; Laxman Dhulipala; Julian Shun (PACT, 2020)

Optimizing ordered graph algorithms with GraphIt. - Yunming Zhang; Ajay Brahmakshatriya; Xinyi Chen; Laxman Dhulipala; Shoaib Kamil 001; Saman P. Amarasinghe; Julian Shun (CGO, 2020)

Parallel Batch-Dynamic Trees via Change Propagation. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Sam Westrick (ESA, 2020)

The Graph Based Benchmark Suite (GBBS). - Laxman Dhulipala; Jessica Shi 001; Tom Tseng; Guy E. Blelloch; Julian Shun (GRADES-NDA@SIGMOD, 2020)

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. - Laxman Dhulipala; David Durfee; Janardhan Kulkarni; Richard Peng; Saurabh Sawlani; Xiaorui Sun (SODA, 2020)

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. - Guy E. Blelloch; Daniel Anderson; Laxman Dhulipala (SPAA, 2020)

Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Sam Westrick (CoRR, 2020)

Parallel Batch-Dynamic k-Clique Counting. - Laxman Dhulipala; Quanquan C. Liu; Julian Shun (CoRR, 2020)

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni; Warren Schudy (Proc. VLDB Endow., 2020)

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms. - Laxman Dhulipala; Changwan Hong; Julian Shun (Proc. VLDB Endow., 2020)

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. - Laxman Dhulipala; Charles McGuffey; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Phillip B. Gibbons; Julian Shun (Proc. VLDB Endow., 2020)

Parallel Clique Counting and Peeling Algorithms. - Jessica Shi 001; Laxman Dhulipala; Julian Shun (ACDA, 2021)

The Read-Only Semi-External Model. - Guy E. Blelloch; Laxman Dhulipala; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (APOCS, 2021)

Parallel Batch-Dynamic k-Clique Counting. - Laxman Dhulipala; Quanquan C. Liu; Julian Shun; Shangdi Yu (APOCS, 2021)

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. - Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab S. Mirrokni; Jessica Shi 001 (ICML, 2021)

LightNE: A Lightweight Graph Processing System for Network Embedding. - Jiezhong Qiu; Laxman Dhulipala; Jie Tang 001; Richard Peng; Chi Wang 001 (SIGMOD Conference, 2021)

Parallel Index-Based Structural Graph Clustering and Its Approximation. - Tom Tseng; Laxman Dhulipala; Julian Shun (SIGMOD Conference, 2021)

The Processing-in-Memory Model. - Hongbo Kang; Phillip B. Gibbons; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey (SPAA, 2021)

Parallel Batch-Dynamic k-Core Decomposition. - Quanquan C. Liu; Jessica Shi 001; Shangdi Yu; Laxman Dhulipala; Julian Shun (CoRR, 2021)

Parallel Batch-Dynamic kd-Trees. - Rahul Yesantharao; Yiqiu Wang; Laxman Dhulipala; Julian Shun (CoRR, 2021)

Scalable Community Detection via Parallel Correlation Clustering. - Jessica Shi 001; Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab S. Mirrokni (Proc. VLDB Endow., 2021)

Theoretically and Practically Efficient Parallel Nucleus Decomposition. - Jessica Shi 001; Laxman Dhulipala; Julian Shun (Proc. VLDB Endow., 2021)

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain. - Shangdi Yu; Yiqiu Wang; Yan Gu 001; Laxman Dhulipala; Julian Shun (Proc. VLDB Endow., 2021)

GeoGraph: A Framework for Graph Processing on Geometric Data. - Yiqiu Wang; Shangdi Yu; Laxman Dhulipala; Yan Gu 001; Julian Shun (ACM SIGOPS Oper. Syst. Rev., 2021)

Massively Parallel Computation via Remote Memory Access. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni; Warren Schudy (ACM Trans. Parallel Comput., 2021)

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. - Laxman Dhulipala; Guy E. Blelloch; Julian Shun (ACM Trans. Parallel Comput., 2021)

ParGeo: A Library for Parallel Computational Geometry. - Yiqiu Wang; Rahul Yesantharao; Shangdi Yu; Laxman Dhulipala; Yan Gu 001; Julian Shun (ESA, 2022)

Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs. - Laxman Dhulipala; Quanquan C. Liu; Sofya Raskhodnikova; Jessica Shi 001; Julian Shun; Shangdi Yu (FOCS, 2022)

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. - Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab Mirrokni; Jessica Shi 001 (NeurIPS, 2022)

PaC-trees: supporting parallel and compressed purely-functional collections. - Laxman Dhulipala; Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (PLDI, 2022)

The problem-based benchmark suite (PBBS), V2. - Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Magdalen Dobson; Yihan Sun 001 (PPoPP, 2022)

ParGeo: a library for parallel computational geometry. - Yiqiu Wang; Shangdi Yu; Laxman Dhulipala; Yan Gu 001; Julian Shun (PPoPP, 2022)

Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. - Quanquan C. Liu; Jessica Shi 001; Shangdi Yu; Laxman Dhulipala; Julian Shun (SPAA, 2022)

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. - Tom Tseng; Laxman Dhulipala; Julian Shun (SPAA, 2022)

PIM-tree: A Skew-resistant Index for Processing-in-Memory. - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (Proc. VLDB Endow., 2022)

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract). - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (HOPC@SPAA, 2023)

Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract). - Jessica Shi 001; Laxman Dhulipala; Julian Shun (HOPC@SPAA, 2023)

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems. - Xiaojun Dong 001; Yunshu Wu; Zhongqi Wang; Laxman Dhulipala; Yan Gu 001; Yihan Sun 001 (SPAA, 2023)

PIM-trie: A Skew-resistant Trie for Processing-in-Memory. - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (SPAA, 2023)

Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. - Magdalen Dobson; Zheqi Shen; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Harsha Vardhan Simhadri; Yihan Sun 001 (CoRR, 2023)

Near-Optimal Differentially Private k-Core Decomposition. - Laxman Dhulipala; George Z. Li; Quanquan C. Liu (CoRR, 2023)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. - Laxman Dhulipala; Jakub Lacki; Jason Lee; Vahab Mirrokni (Proc. ACM Manag. Data, 2023)

Towards Lightweight and Automated Representation Learning System for Networks. - Yuyang Xie; Jiezhong Qiu; Laxman Dhulipala; Wenjian Yu; Jie Tang 001; Richard Peng; Chi Wang 001 (IEEE Trans. Knowl. Data Eng., 2023)

Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. - Pattara Sukprasert; Quanquan C. Liu; Laxman Dhulipala; Julian Shun (ALENEX, 2024)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract). - Laxman Dhulipala; Jakub Lacki; Jason Lee; Vahab Mirrokni (HOPC@SPAA, 2024)

Parallel Integer Sort: Theory and Practice (Abstract). - Xiaojun Dong 001; Laxman Dhulipala; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2024)

It's Hard to HAC Average Linkage! - MohammadHossein Bateni; Laxman Dhulipala; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (ICALP, 2024)

Approximate Nearest Neighbor Search with Window Filters. - Joshua Engels; Benjamin Landrum; Shangdi Yu; Laxman Dhulipala; Julian Shun (ICML, 2024)

Efficient Centroid-Linkage Clustering. - Mohammad Hossein Bateni 001; Laxman Dhulipala; Willem Fletcher; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (NeurIPS, 2024)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encoding. - Rajesh Jayaram; Laxman Dhulipala; Majid Hadian; Jason Lee; Vahab Mirrokni (NeurIPS, 2024)

Parallel Integer Sort: Theory and Practice. - Xiaojun Dong 001; Laxman Dhulipala; Yan Gu 001; Yihan Sun 001 (PPoPP, 2024)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. - Magdalen Dobson Manohar; Zheqi Shen; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Harsha Vardhan Simhadri; Yihan Sun 001 (PPoPP, 2024)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering. - Laxman Dhulipala; Xiaojun Dong 001; Kishen N. Gowda; Yan Gu 001 (SPAA, 2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. - Laxman Dhulipala; Michael Dinitz; Jakub Lacki; Slobodan Mitrovic (DISC, 2024)

Fine-Grained Privacy Guarantees for Coverage Problems. - Laxman Dhulipala; George Z. Li (CoRR, 2024)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings. - Laxman Dhulipala; Majid Hadian; Rajesh Jayaram; Jason Lee; Vahab Mirrokni (CoRR, 2024)

Results of the Big ANN: NeurIPS'23 competition. - Harsha Vardhan Simhadri; Martin Aumüller 001; Amir Ingber; Matthijs Douze; George Williams; Magdalen Dobson Manohar; Dmitry Baranchuk; Edo Liberty; Frank Liu 007; Benjamin Landrum; Mazin Karjikar; Laxman Dhulipala; et al. (CoRR, 2024)

Parallel Algorithms for Hierarchical Nucleus Decomposition. - Jessica Shi 001; Laxman Dhulipala; Julian Shun (Proc. ACM Manag. Data, 2024)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. - Brian Wheatman; Xiaojun Dong 001; Zheqi Shen; Laxman Dhulipala; Jakub Lacki; Prashant Pandey 001; Helen Xu 001 (Proc. VLDB Endow., 2024)

Towards Scalable and Practical Batch-Dynamic Connectivity. - Quinten De Man; Laxman Dhulipala; Adam Karczmarz; Jakub Lacki; Julian Shun; Zhongqi Wang (Proc. VLDB Endow., 2024)

The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. - Shangdi Yu; Jessica Shi 001; Jamison Meindl; David Eisenstat; Xiaoen Ju; Sasan Tavakkol; Laxman Dhulipala; Jakub Lacki; Vahab Mirrokni; Julian Shun (Proc. VLDB Endow., 2024)

Fast, parallel, and cache-friendly suffix array construction. - Jamshed Khan; Tobias Rubel; Erin K. Molloy; Laxman Dhulipala; Rob Patro (Algorithms Mol. Biol., 2024)

Techniques for Practical Parallel BFS and SSSP. - Quinten De Man; Richard Wen; Laxman Dhulipala (FCPC@PPOPP, 2025)

Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract). - Quinten De Man; Laxman Dhulipala; Adam Karczmarz; Jakub Lacki; Julian Shun; Zhongqi Wang (HOPC@SPAA, 2025)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. - Shangdi Yu; Laxman Dhulipala; Jakub Lacki; Nikos Parotsidis (SDM, 2025)

Scaling Parallel Algorithms to Massive Datasets using Multi-SSD Machines. - Haohong Li; Jamshed Khan; Laxman Dhulipala (SPAA, 2025)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering. - Quinten De Man; Laxman Dhulipala; Kishen N. Gowda (SPAA, 2025)

Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications. - Yiwei Zhao; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Laxman Dhulipala; Charles McGuffey; Phillip B. Gibbons (SPAA, 2025)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. - Lars Gottesbüren; Laxman Dhulipala; Rajesh Jayaram; Jakub Lacki (Proc. VLDB Endow., 2025)

Efficiently Constructing Sparse Navigable Graphs. - Alexander Conway 001; Laxman Dhulipala; Martin Farach-Colton; Rob Johnson 001; Ben Landrum; Christopher Musco; Yarin Shechter; Torsten Suel; Richard Wen (CoRR, 2025)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions. - MohammadHossein Bateni; Laxman Dhulipala; Willem Fletcher; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (CoRR, 2025)