Identifying the connected components of a graph, apart from being a fundamental problem
with countless applications, is a key primitive for many other algorithms. In this paper, we …

We design a generic method to reduce the task of finding weighted matchings to that of
finding short augmenting paths in unweighted graphs. This method enables us to provide …

The study of approximate matching in the Massively Parallel Computations (MPC) model
has recently seen a burst of breakthroughs. Despite this progress, however, we still have a …

Massively parallel computation (MPC) algorithms for graph problems have witnessed a
resurgence of interest in recent years. Despite major progress for numerous graph problems …

Interactive proof systems enable a verifier with limited resources to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …

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 …

Many modern parallel systems, such as MapReduce, Hadoop and Spark, can be modeled
well by the MPC model. The MPC model captures well coarse-grained computation on large …

A valid edge-coloring of a graph is an assignment of" colors" to its edges such that no two
incident edges receive the same color. The goal is to find a proper coloring that uses few …

The Massive Parallel Computation (MPC) model is a theoretical framework for popular
parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the …

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 …