The locality of distributed symmetry breaking
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 …
computing and yet the most fundamental questions about their complexity remain open. In …
An exponential separation between randomized and deterministic complexity in the LOCAL model
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 …
problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge …
Distributed (∆+ 1)-coloring in sublogarithmic rounds
The (∆+ 1)-coloring problem is a fundamental symmetry breaking problem in distributed
computing. We give a new randomized coloring algorithm for (∆+ 1)-coloring running in O …
computing. We give a new randomized coloring algorithm for (∆+ 1)-coloring running in O …
Deterministic distributed edge-coloring via hypergraph maximal matching
We present a deterministic distributed algorithm that computes a (2Δ-1)-edge-coloring, or
even list-edge-coloring, in any n-node graph with maximum degree Δ, in O (log 8 Δ· log n) …
even list-edge-coloring, in any n-node graph with maximum degree Δ, in O (log 8 Δ· log n) …
Distributed∆-coloring plays hide-and-seek
We prove several new tight or near-tight distributed lower bounds for classic symmetry
breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any …
breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any …
Distributed lower bounds for ruling sets
Given a graph G=(V,E), an (α,β)-ruling set is a subset S⊆V such that the distance between
any two vertices in S is at least α, and the distance between any vertex in V and the closest …
any two vertices in S is at least α, and the distance between any vertex in V and the closest …
Stone age distributed computing
A new model that depicts a network of randomized finite state machines operating in an
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …
asynchronous environment is introduced. This model, that can be viewed as a hybrid of the …
LCL problems on grids
LCLs or locally checkable labelling problems (eg maximal independent set, maximal
matching, and vertex colouring) in the LOCAL model of computation are very well …
matching, and vertex colouring) in the LOCAL model of computation are very well …
Toward more localized local algorithms: removing assumptions concerning global knowledge
Numerous sophisticated local algorithm were suggested in the literature for various
fundamental problems. Notable examples are the MIS and (Δ+ 1)-coloring algorithms by …
fundamental problems. Notable examples are the MIS and (Δ+ 1)-coloring algorithms by …
An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks
Maximal independent set (MIS) is a very important structure that provides data aggregation,
topology control and routing for wireless sensor networks (WSNs). Energy-efficient and fault …
topology control and routing for wireless sensor networks (WSNs). Energy-efficient and fault …