Laxman Dhulipala

Orcid: 0000-0003-0685-064X

Affiliations:
  • University of Maryland, College Park, USA
  • Carnegie Mellon University, PA, USA (former)


According to our database1, Laxman Dhulipala authored at least 71 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast, parallel, and cache-friendly suffix array construction.
Algorithms Mol. Biol., December, 2024

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers.
Proc. VLDB Endow., May, 2024

Parallel Algorithms for Hierarchical Nucleus Decomposition.
Proc. ACM Manag. Data, February, 2024

Results of the Big ANN: NeurIPS'23 competition.
CoRR, 2024

Efficient Centroid-Linkage Clustering.
CoRR, 2024

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings.
CoRR, 2024

Fine-Grained Privacy Guarantees for Coverage Problems.
CoRR, 2024

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search.
CoRR, 2024

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Parallel Integer Sort: Theory and Practice.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Approximate Nearest Neighbor Search with Window Filters.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

It's Hard to HAC Average Linkage!
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Parallel Integer Sort: Theory and Practice (Abstract).
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract).
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023
Towards Lightweight and Automated Representation Learning System for Networks.
IEEE Trans. Knowl. Data Eng., September, 2023

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs.
Proc. ACM Manag. Data, September, 2023

Near-Optimal Differentially Private k-Core Decomposition.
CoRR, 2023

Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis.
CoRR, 2023

PIM-trie: A Skew-resistant Trie for Processing-in-Memory.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

2022
PIM-tree: A Skew-resistant Index for Processing-in-Memory.
Proc. VLDB Endow., 2022

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

ParGeo: a library for parallel computational geometry.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

The problem-based benchmark suite (PBBS), V2.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

PaC-trees: supporting parallel and compressed purely-functional collections.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

ParGeo: A Library for Parallel Computational Geometry.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.
ACM Trans. Parallel Comput., 2021

Massively Parallel Computation via Remote Memory Access.
ACM Trans. Parallel Comput., 2021

GeoGraph: A Framework for Graph Processing on Geometric Data.
ACM SIGOPS Oper. Syst. Rev., 2021

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain.
Proc. VLDB Endow., 2021

Theoretically and Practically Efficient Parallel Nucleus Decomposition.
Proc. VLDB Endow., 2021

Scalable Community Detection via Parallel Correlation Clustering.
Proc. VLDB Endow., 2021

Parallel Batch-Dynamic kd-Trees.
CoRR, 2021

Parallel Batch-Dynamic k-Core Decomposition.
CoRR, 2021

The Processing-in-Memory Model.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Parallel Index-Based Structural Graph Clustering and Its Approximation.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

LightNE: A Lightweight Graph Processing System for Network Embedding.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time.
Proceedings of the 38th International Conference on Machine Learning, 2021

Parallel Batch-Dynamic <i>k</i>-Clique Counting.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

The Read-Only Semi-External Model.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Parallel Clique Counting and Peeling Algorithms.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs.
Proc. VLDB Endow., 2020

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms.
Proc. VLDB Endow., 2020

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.
Proc. VLDB Endow., 2020

Parallel Batch-Dynamic k-Clique Counting.
CoRR, 2020

Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.
CoRR, 2020

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Graph Based Benchmark Suite (GBBS).
Proceedings of the GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2020

Parallel Batch-Dynamic Trees via Change Propagation.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Optimizing ordered graph algorithms with GraphIt.
Proceedings of the CGO '20: 18th ACM/IEEE International Symposium on Code Generation and Optimization, 2020

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs.
Proceedings of the PACT '20: International Conference on Parallel Architectures and Compilation Techniques, 2020

2019
SPAA 2018 Review.
SIGACT News, 2019

PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms.
CoRR, 2019

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs.
CoRR, 2019

Parallel Batch-Dynamic Graph Connectivity.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Low-latency graph streaming using compressed purely-functional trees.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Near-Optimal Massively Parallel Graph Connectivity.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Batch-Parallel Euler Tour Trees.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2017
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Compressing Graphs and Indexes with Recursive Graph Bisection.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2015
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+.
Proceedings of the 2015 Data Compression Conference, 2015

2014
A simple and practical linear-work parallel algorithm for connectivity.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014


  Loading...