We show the first conditionally optimal deterministic algorithm for $3 $-coloring forests in the
low-space massively parallel computation (MPC) model. Our algorithm runs in $ O (\log\log …

We present a deterministic algorithm for solving a wide range of dynamic programming
problems in trees in O (log D) rounds in the massively parallel computation model (MPC) …

We consider two natural variants of the problem of minimum spanning tree (MST) of a graph
in the parallel setting: MST verification (verifying if a given tree is an MST) and the sensitivity …

We consider the massively parallel computation (MPC) model, which is a theoretical
abstraction of large-scale parallel processing models such as MapReduce. In this model …

Computing the connected components of a graph is a fundamental problem in algorithmic
graph theory. A major question in this area is whether we can compute connected …

We study the problem of finding connected components in the Adaptive Massively Parallel
Computation (AMPC) model. We show that when we require the total space to be linear in …

Massively parallel computations are gaining more and more importance in the computing
world, due to hardware evolution and the staggering amounts of data produced and …