As hospitals move towards automating and integrating their computing sys...
Fast distributed algorithms that output a feasible solution for constrai...
In this paper we present a deterministic O(loglog n)-round algorithm for...
We study the communication cost (or message complexity) of fundamental
d...
The goal of this paper is to understand the complexity of symmetry break...
Motivated by recent progress on symmetry breaking problems such as maxim...
We investigate graph problems in the following setting: we are given a g...
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 ...