research
∙
04/07/2022
On the Price of Locality in Static Fast Rerouting
Modern communication networks feature fully decentralized flow rerouting...
share
research
∙
03/02/2022
Sparse matrix multiplication in the low-bandwidth model
We study matrix multiplication in the low-bandwidth model: There are n c...
research
∙
02/26/2021
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
Graphical games are a useful framework for modeling the interactions of ...
research
∙
02/17/2021
Local Mending
In this work we introduce the graph-theoretic notion of mendability: for...
research
∙
06/11/2020
On the Feasibility of Perfect Resilience with Local Fast Failover
In order to provide a high resilience and to react quickly to link failu...
research
∙
11/29/2019
Classification of distributed binary labeling problems
We present a complete classification of the deterministic distributed ti...
research
∙
04/11/2019
Locality of not-so-weak coloring
Many graph problems are locally checkable: a solution is globally feasib...
research
∙
01/08/2019
Lower bounds for maximal matchings and maximal independent sets
There are distributed graph algorithms for finding maximal matchings and...
research
∙
12/03/2018
On the Power of Preprocessing in Decentralized Network Optimization
As communication networks are growing at a fast pace, the need for more ...
research
∙
11/05/2018
Hardness of minimal symmetry breaking in distributed computing
A graph is weakly 2-colored if the nodes are labeled with colors black a...
research
∙
03/26/2018
Local verification of global proofs
In this work we study the cost of local and global proofs on distributed...
research
∙
03/08/2018
Improved Distributed Δ-Coloring
We present a randomized distributed algorithm that computes a Δ-coloring...
research
∙
03/08/2018
Redundancy in Distributed Proofs
Distributed proofs are mechanisms enabling the nodes of a network to col...
research
∙
11/06/2017
