activity
20162026
most citedOn the streaming complexity of fundamental geometric problems

3 citations · 8 across the 15 of their papers we have counts for

collaborators
Showing 2023Show all

3 papers · 1 filter

cs.DS2023

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…

cs.DS2023

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…

cs.DS2023★ 1 cited

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…