research
∙
04/12/2023
When Should You Wait Before Updating? Toward a Robustness Refinement
Consider a dynamic network and a given distributed problem. At any point...
share
research
∙
02/15/2023
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
In this paper, we study temporal graphs arising from mobility models whe...
research
∙
08/31/2022
Making Self-Stabilizing any Locally Greedy Problem
We propose a way to transform synchronous distributed algorithms solving...
research
∙
07/22/2022
Fault Tolerant Coloring of the Asynchronous Cycle
We present a wait-free algorithm for proper coloring the n nodes of the ...
research
∙
03/16/2022
Short and local transformations between (Δ+1)-colorings
Recoloring a graph is about finding a sequence of proper colorings of th...
research
∙
10/20/2021
Improved pyrotechnics : Closer to the burning graph conjecture
Can every connected graph burn in ⌈√(n)⌉ steps? While this conjecture re...
research
∙
09/13/2021
Distributed recoloring of interval and chordal graphs
One of the fundamental and most-studied algorithmic problems in distribu...
research
∙
04/16/2019
Distributed Computing in the Asynchronous LOCAL model
The LOCAL model is among the main models for studying locality in the fr...
research
∙
01/08/2019
Lower bounds for maximal matchings and maximal independent sets
There are distributed graph algorithms for finding maximal matchings and...
research
∙
11/05/2018
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...
research
∙
10/04/2018
Distributed Reconfiguration of Maximal Independent Sets
Consider the following problem: given a graph and two maximal independen...
research
∙
02/19/2018
