
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
Graphical games are a useful framework for modeling the interactions of ...
read it

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

On the Feasibility of Perfect Resilience with Local Fast Failover
In order to provide a high resilience and to react quickly to link failu...
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

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

On the Power of Preprocessing in Decentralized Network Optimization
As communication networks are growing at a fast pace, the need for more ...
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

Local verification of global proofs
In this work we study the cost of local and global proofs on distributed...
read it

Improved Distributed ΔColoring
We present a randomized distributed algorithm that computes a Δcoloring...
read it

Redundancy in Distributed Proofs
Distributed proofs are mechanisms enabling the nodes of a network to col...
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
Juho Hirvonen
is this you? claim profile