Modern communication networks feature fully decentralized flow rerouting...
We study matrix multiplication in the low-bandwidth model: There are n
c...
Graphical games are a useful framework for modeling the interactions of
...
In this work we introduce the graph-theoretic notion of mendability: for...
In order to provide a high resilience and to react quickly to link failu...
We present a complete classification of the deterministic distributed ti...
Many graph problems are locally checkable: a solution is globally feasib...
There are distributed graph algorithms for finding maximal matchings and...
As communication networks are growing at a fast pace, the need for more
...
A graph is weakly 2-colored if the nodes are labeled with colors black a...
In this work we study the cost of local and global proofs on distributed...
We present a randomized distributed algorithm that computes a
Δ-coloring...
Distributed proofs are mechanisms enabling the nodes of a network to
col...
A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al...