
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using NearestNeighbor Chain
This paper studies the hierarchical clustering problem, where the goal i...
read it

Parallel BatchDynamic kCore Decomposition
Maintaining a kcore decomposition quickly in a dynamic graph is an impo...
read it

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
This paper presents new parallel algorithms for generating Euclidean min...
read it

Parallel InPlace Algorithms: Theory and Practice
Many parallel algorithms use at least linear auxiliary space in the size...
read it

Parallel IndexBased Structural Graph Clustering and Its Approximation
SCAN (Structural Clustering Algorithm for Networks) is a wellstudied, w...
read it

Compilation Techniques for Graph Algorithms on GPUs
The performance of graph programs depends highly on the algorithm, the s...
read it

A Parallel BatchDynamic Data Structure for the Closest Pair Problem
We propose a theoreticallyefficient and practical parallel batchdynami...
read it

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
Connected components and spanning forest are fundamental graph algorithm...
read it

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
Connected components is a fundamental kernel in graph applications due t...
read it

Parallel BatchDynamic kClique Counting
In this paper, we study new batchdynamic algorithms for kclique counti...
read it

Parallel Clique Counting and Peeling Algorithms
Dense subgraphs capture strong communities in social networks and entiti...
read it

TheoreticallyEfficient and Practical Parallel DBSCAN
The DBSCAN method for spatial clustering has received significant attent...
read it

Optimizing Ordered Graph Algorithms with GraphIt
Many graph problems can be solved using ordered parallel graph algorithm...
read it

PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms
Many graph problems can be solved using ordered parallel graph algorithm...
read it

SemiAsymmetric Parallel Graph Algorithms for NVRAMs
Emerging nonvolatile main memory (NVRAM) technologies provide novel fea...
read it

Parallel Algorithms for Butterfly Computations
Butterflies are the smallest nontrivial subgraph in bipartite graphs, a...
read it

Kaskade: Graph Views for Efficient Graph Analytics
Graphs are an increasingly popular way to model realworld entities and ...
read it

LowLatency Graph Streaming Using Compressed PurelyFunctional Trees
Due to the dynamic nature of realworld graphs, there has been a growing...
read it

Chiller: Contentioncentric Transaction Execution and Data Partitioning for Fast Networks
Distributed transactions on highoverhead TCP/IPbased networks were con...
read it

Parallelism in Randomized Incremental Algorithms
In this paper we show that many sequential randomized incremental algori...
read it

Parallel WriteEfficient Algorithms and Data Structures for Computational Geometry
In this paper, we design parallel writeefficient geometric algorithms t...
read it

The Parallel Persistent Memory Model
We consider a parallel computational model that consists of P processors...
read it

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
There has been significant interest in parallel graph processing recentl...
read it

GraphIt  A HighPerformance DSL for Graph Analytics
The performance bottlenecks of graph applications depend not only on the...
read it
Julian Shun
is this you? claim profile