Triangle counting and enumeration has emerged as a basic tool in large-scale network
analysis, fueling the development of algorithms that scale to massive graphs. Most of the …

The virtues of deterministic parallelism have been argued for decades and many forms of
deterministic parallelism have been described and analyzed. Here we are concerned with …

The DBSCAN method for spatial clustering has received significant attention due to its
applicability in a variety of data analysis tasks. There are fast sequential algorithms for …

In this paper we develop optimal algorithms in the binary-forking model for a variety of
fundamental problems, including sorting, semisorting, list ranking, tree contraction, range …

Current processor trends of integrating more cores with wider SIMD units, along with a
deeper and complex memory hierarchy, have made it increasingly more challenging to …

We present new sequential and parallel sorting algorithms that now represent the fastest
known techniques for a wide range of input sizes, input distributions, data types, and …

A fundamental problem in large-scale network analysis is finding and enumerating basic
graph motifs. Graph motifs that represent the building blocks of certain networks can reveal …

Many modern programming languages are shifting toward a functional style for collection
interfaces such as sets, maps, and sequences. Functional interfaces offer many advantages …

The cover tree is the canonical data structure that efficiently maintains a dynamic set of
points on a metric space and supports nearest and k-nearest neighbor searches. For most …

The single-source shortest-path (SSSP) problem is a notoriously hard problem in the
parallel context. In practice, the Δ-step** algorithm of Meyer and Sanders has been widely …