We present a deterministic O (log log log n)-round low-space Massively Parallel
Computation (MPC) algorithm for the classical problem of (Δ+ 1)-coloring on n-vertex …

Clustering of data in metric spaces is a fundamental problem and has many applications in
data mining and it is often used as an unsupervised learning tool inside other machine …

We consider the problem of designing deterministic graph algorithms for the model of
Massively Parallel Computation (MPC) that improve with the sparsity of the input graph, as …

We study the deterministic complexity of the 2-Ruling Set problem in the model of Massively
Parallel Computation (MPC) with linear and strongly sublinear local memory. Linear MPC …

Massively-parallel graph algorithms have received extensive attention over the past decade,
with research focusing on three memory regimes: the superlinear regime, the near-linear …

We present the first sublinear round algorithm for approximately sampling uniform spanning
trees in the CongestedClique model of distributed computing. In particular, our algorithm …

The Massively Parallel Computation (MPC) model is a popular abstraction for large-scale
distributed computing. The Set Cover problem is a classical combinatorial optimization …

In this paper, we present a deterministic-round algorithm for the 2-ruling set problem in the
sublinear Massively Parallel Computation (MPC) model. This improves upon the fastest …

The size of data sets is increasing to the point where we cannot store all data in a single
machine (eg, a computer or mobile device). This is a problem for algorithms which assume …