We show the first conditionally optimal deterministic algorithm for
3-co...
In this work, we present a constant-round algorithm for the 2-ruling set...
We present a deterministic algorithm for solving a wide range of dynamic...
In a reconfiguration problem, given a problem and two feasible solutions...
In this paper we present a deterministic O(loglog n)-round algorithm for...
Grouping together similar elements in datasets is a common task in data
...
We study the communication cost (or message complexity) of fundamental
d...
Motivated by recent progress on symmetry breaking problems such as maxim...
We investigate graph problems in the following setting: we are given a g...
In this paper, we consider the colorful k-center problem, which is a
gen...
We prove three new lower bounds for graph connectivity in the 1-bit
broa...
This paper presents fast, distributed, O(1)-approximation algorithms for...
The clustering problem, in its many variants, has numerous applications ...