
Improved Distributed Lower Bounds for MIS and Bounded (Out)Degree Dominating Sets in Trees
Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first ω(log...
read it

Locally Checkable Labelings with Small Messages
A rich line of work has been addressing the computational complexity of ...
read it

Locally Checkable Problems in Rooted Trees
Consider any locally checkable labeling problem Π in rooted regular tree...
read it

Local Mending
In this work we introduce the graphtheoretic notion of mendability: for...
read it

Distributed Lower Bounds for Ruling Sets
Given a graph G = (V,E), an (α, β)ruling set is a subset S ⊆ V such tha...
read it

Distributed Edge Coloring in Time QuasiPolylogarithmic in Delta
The problem of coloring the edges of an nnode graph of maximum degree Δ...
read it

Classification of distributed binary labeling problems
We present a complete classification of the deterministic distributed ti...
read it

Locality of notsoweak coloring
Many graph problems are locally checkable: a solution is globally feasib...
read it

How much does randomness help with locally checkable problems?
Locally checkable labeling problems (LCLs) are distributed graph problem...
read it

Lower bounds for maximal matchings and maximal independent sets
There are distributed graph algorithms for finding maximal matchings and...
read it

The distributed complexity of locally checkable problems on paths is decidable
Consider a computer network that consists of a path with n nodes. The no...
read it

Hardness of minimal symmetry breaking in distributed computing
A graph is weakly 2colored if the nodes are labeled with colors black a...
read it

Almost Global Problems in the LOCAL Model
The landscape of the distributed time complexity is nowadays wellunders...
read it

New Classes of Distributed Time Complexity
A number of recent papers  e.g. Brandt et al. (STOC 2016), Chang et al...
read it
Alkida Balliu
is this you? claim profile