research
∙
06/14/2023
Parallel Algorithms for Hierarchical Nucleus Decomposition
Nucleus decompositions have been shown to be a useful tool for finding d...
share
research
∙
05/18/2023
Faster Parallel Exact Density Peaks Clustering
Clustering multidimensional points is a fundamental data mining task, wi...
research
∙
03/09/2023
Parallel Filtered Graphs for Hierarchical Clustering
Given all pairwise weights (distances) among a set of objects, filtered ...
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
∙
07/05/2022
ParGeo: A Library for Parallel Computational Geometry
This paper presents ParGeo, a multicore library for computational geomet...
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
∙
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
∙
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
∙
04/02/2021
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
This paper presents new parallel algorithms for generating Euclidean min...
research
∙
03/01/2021
Parallel In-Place Algorithms: Theory and Practice
Many parallel algorithms use at least linear auxiliary space in the size...
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
∙
12/14/2020
Compilation Techniques for Graph Algorithms on GPUs
The performance of graph programs depends highly on the algorithm, the s...
research
∙
10/05/2020
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem
We propose a theoretically-efficient and practical parallel batch-dynami...
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
∙
12/12/2019
Theoretically-Efficient and Practical Parallel DBSCAN
The DBSCAN method for spatial clustering has received significant attent...
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
∙
07/19/2019
Parallel Algorithms for Butterfly Computations
Butterflies are the smallest non-trivial subgraph in bipartite graphs, a...
research
∙
06/12/2019
Kaskade: Graph Views for Efficient Graph Analytics
Graphs are an increasingly popular way to model real-world entities and ...
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
∙
11/29/2018
Chiller: Contention-centric Transaction Execution and Data Partitioning for Fast Networks
Distributed transactions on high-overhead TCP/IP-based networks were con...
research
∙
10/12/2018
Parallelism in Randomized Incremental Algorithms
In this paper we show that many sequential randomized incremental algori...
research
∙
05/15/2018
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
In this paper, we design parallel write-efficient geometric algorithms t...
research
∙
05/15/2018
The Parallel Persistent Memory Model
We consider a parallel computational model that consists of P processors...
research
∙
05/14/2018
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
There has been significant interest in parallel graph processing recentl...
research
∙
05/02/2018
