research
∙
08/07/2023
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
We introduce TeraHAC, a (1+ϵ)-approximate hierarchical agglomerative clu...
share
research
∙
06/14/2023
Parallel Algorithms for Hierarchical Nucleus Decomposition
Nucleus decompositions have been shown to be a useful tool for finding d...
research
∙
05/07/2023
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis
Algorithms for approximate nearest-neighbor search (ANNS) have been the ...
research
∙
04/20/2023
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Semisort is a fundamental algorithmic primitive widely used in the desig...
research
∙
11/20/2022
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs
Differentially private algorithms allow large-scale data analytics while...
research
∙
11/18/2022
PIM-tree: A Skew-resistant Index for Processing-in-Memory
The performance of today's in-memory indexes is bottlenecked by the memo...
research
∙
07/05/2022
ParGeo: A Library for Parallel Computational Geometry
This paper presents ParGeo, a multicore library for computational geomet...
research
∙
06/23/2022
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Obtaining scalable algorithms for hierarchical agglomerative clustering ...
research
∙
05/10/2022
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
Hierarchical agglomerative clustering (HAC) is a popular algorithm for c...
research
∙
04/12/2022
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
Many modern programming languages are shifting toward a functional style...
research
∙
12/12/2021
Parallel Batch-Dynamic kd-Trees
kd-trees are widely used in parallel databases to support efficient neig...
research
∙
11/22/2021
Theoretically and Practically Efficient Parallel Nucleus Decomposition
This paper studies the nucleus decomposition problem, which has been sho...
research
∙
07/27/2021
Scalable Community Detection via Parallel Correlation Clustering
Graph clustering and community detection are central problems in modern ...
research
∙
06/10/2021
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
We study the widely used hierarchical agglomerative clustering (HAC) alg...
research
∙
06/08/2021
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
This paper studies the hierarchical clustering problem, where the goal i...
research
∙
06/07/2021
Parallel Batch-Dynamic k-Core Decomposition
Maintaining a k-core decomposition quickly in a dynamic graph is an impo...
research
∙
12/21/2020
Parallel Index-Based Structural Graph Clustering and Its Approximation
SCAN (Structural Clustering Algorithm for Networks) is a well-studied, w...
research
∙
09/24/2020
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
We study fundamental graph problems such as graph connectivity, minimum ...
research
∙
08/26/2020
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
Connected components and spanning forest are fundamental graph algorithm...
research
∙
08/10/2020
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Connected components is a fundamental kernel in graph applications due t...
research
∙
03/30/2020
Parallel Batch-Dynamic k-Clique Counting
In this paper, we study new batch-dynamic algorithms for k-clique counti...
research
∙
02/24/2020
Parallel Clique Counting and Peeling Algorithms
Dense subgraphs capture strong communities in social networks and entiti...
research
∙
02/12/2020
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees
Dynamic algorithms capable of supporting batches of updates are increasi...
research
∙
11/17/2019
Optimizing Ordered Graph Algorithms with GraphIt
Many graph problems can be solved using ordered parallel graph algorithm...
research
∙
11/17/2019
PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms
Many graph problems can be solved using ordered parallel graph algorithm...
research
∙
10/27/2019
Semi-Asymmetric Parallel Graph Algorithms for NVRAMs
Emerging non-volatile main memory (NVRAM) technologies provide novel fea...
research
∙
10/11/2019
Near-Optimal Massively Parallel Graph Connectivity
Identifying the connected components of a graph, apart from being a fund...
research
∙
08/06/2019
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
In this paper we study the problem of dynamically maintaining graph prop...
research
∙
05/18/2019
Massively Parallel Computation via Remote Memory Access
We introduce the Adaptive Massively Parallel Computation (AMPC) model, w...
research
∙
04/17/2019
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees
Due to the dynamic nature of real-world graphs, there has been a growing...
research
∙
03/21/2019
Parallel Batch-Dynamic Graph Connectivity
With the rapid growth of graph datasets over the past decade, a new kind...
research
∙
10/25/2018
Batch-Parallel Euler Tour Trees
The dynamic trees problem is to maintain a forest undergoing edge insert...
research
∙
05/14/2018