The Massively Parallel Computation (MPC) model serves as a common abstraction of many
modern large-scale parallel computation frameworks and has recently gained a lot of …

We provide a simple new randomized contraction approach to the global minimum cut
problem for simple undirected graphs. The contractions exploit 2-out edge sampling from …

We show how to construct an overlay network of constant degree and diameter O (log n) in
time O (log n) starting from an arbitrary weakly connected graph. We assume a synchronous …

We present $ O (\log\log n) $ round scalable Massively Parallel Computation algorithms for
maximal independent set and maximal matching, in trees and more generally graphs of …

We show fast deterministic algorithms for fundamental problems on forests in the
challenging low-space regime of the well-known Massive Parallel Computation (MPC) …

Locally Checkable Labeling (LCL) problems are graph problems in which a solution is
correct if it satisfies some given constraints in the local neighborhood of each node. Example …

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 present two Massively Parallel Computation (MPC) algorithms for the Minimum Cut
problem: an O (1)-round exact algorithm with Õ (n) memory per machine, and an O (log n⊙ …

We consider unconditional lower bounds in the Adaptive Massively Parallel Computation
(AMPC) model introduced by Behnezhad et al.(SPAA 19), which is an adaptive variant of the …

We establish scalable Massively Parallel Computation (MPC) algorithms for a family of
fundamental graph problems on trees. We give a general method that, for a wide range of …