By integrating wireless, video, speech and real-time data access technologies, a unique
shopping assistant service can be created that personalizes the attention provided to a …

Symmetry-breaking problems are among the most well studied in the field of distributed
computing and yet the most fundamental questions about their complexity remain open. In …

Over the past 30 years numerous algorithms have been designed for symmetry breaking
problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge …

Any graph with maximum degree Δ admits a proper vertex coloring with Δ+ 1 colors that can
be found via a simple sequential greedy algorithm in linear time and space. But can one find …

The gap between the known randomized and deterministic local distributed algorithms
underlies arguably the most fundamental and central open question in distributed graph …

This paper is centered on the complexity of graph problems in the well-studied LOCAL
model of distributed computing, introduced by Linial [FOCS'87]. It is widely known that for …

Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring,
maximal matching, maximal independent set, etc., is a long-standing challenge in distributed …

In this paper, we present new randomized algorithms that improve the complexity of the
classic (Δ+ 1)-coloring problem, and its generalization (Δ+ 1)-list-coloring, in three well …

We present a simple deterministic distributed algorithm that computes a (Δ+1)-vertex
coloring in O(log^2Δ.log\n) rounds. The algorithm can be implemented with O(log\n)-bit …

We present a new approach for solving (minimum disagreement) correlation clustering that
results in sublinear algorithms with highly efficient time and space complexity for this …