21 citations · 75 across the 21 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
Streaming Algorithms for Geometric Steiner Forest
Artur Czumaj, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
We consider an important generalization of the Steiner tree problem, the \emph{Steiner forest problem}, in the Euclidean plane: the input is a multiset ,…
cs.DS2020★ 15 cited
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…
math.CO2020
Haystack Hunting Hints and Locker Room Communication
Artur Czumaj, George Kontogeorgiou, Mike Paterson
We want to efficiently find a specific object in a large unstructured set, which we model by a random -permutation, and we have to do it by revealing just a single element. Clea…