23 citations · 76 across the 15 of their papers we have counts for
4 papers · 1 filter
Optimal (degree+1)-Coloring in Congested Clique
Sam Coy, Artur Czumaj, Peter Davies +1
We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node of degree is assigned a palette of colors, and the goal is to…
Component Stability in Low-Space Massively Parallel Computation
Artur Czumaj, Peter Davies, Merav Parter
We study the power and limitations of component-stable algorithms in the low-space model of Massively Parallel Computation (MPC). Recently Ghaffari, Kuhn and Uitto (FOCS 2019) intr…
Simple, Deterministic, Constant-Round Coloring in the Congested Clique
Artur Czumaj, Peter Davies, Merav Parter
We settle the complexity of the -coloring and -list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems r…
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
Artur Czumaj, Peter Davies, Merav Parter
The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (t…