21 citations · 75 across the 21 of their papers we have counts for
4 papers · 1 filter
Fully Scalable MPC Algorithms for Clustering in High Dimension
Artur Czumaj, Guichen Gao, Shaofeng H. -C. Jiang +2
We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalabl…
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…
On Parallel -Center Clustering
Sam Coy, Artur Czumaj, Gopinath Mishra
We consider the classic -center problem {in the constant dimensional Euclidean space} under a parallel setting, on the low-local-space Massively Parallel Computation (MPC) model…
Parallel Derandomization for Coloring
Sam Coy, Artur Czumaj, Peter Davies +1
Graph coloring problems are among the most fundamental problems in parallel and distributed computing, and have been studied extensively in both settings. In this context, designin…