Mikaël Rabie | DeepAI

DeepAI AI Chat

Featured Co-authors

Nicolas Bousquet
43 publications
Marthe Bonamy
30 publications
Sebastian Brandt
28 publications
Keren Censor-Hillel
28 publications
Jukka Suomela
26 publications
Dennis Olivetti
25 publications
Alkida Balliu
24 publications
Yi-Jun Chang
24 publications
Jara Uitto
24 publications
Laurent Feuilloley
21 publications
Pierre Fraigniaud
21 publications

∙ 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...

0 Swan Dubois, et al. ∙

∙ 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...

0 Michel Habib, et al. ∙

∙ 08/31/2022

Making Self-Stabilizing any Locally Greedy Problem

We propose a way to transform synchronous distributed algorithms solving...

0 Johanne Cohen, et al. ∙

∙ 07/22/2022

Fault Tolerant Coloring of the Asynchronous Cycle

We present a wait-free algorithm for proper coloring the n nodes of the ...

0 Pierre Fraigniaud, et al. ∙

∙ 03/16/2022

Short and local transformations between (Δ+1)-colorings

Recoloring a graph is about finding a sequence of proper colorings of th...

0 Nicolas Bousquet, et al. ∙

∙ 10/20/2021

Improved pyrotechnics : Closer to the burning graph conjecture

Can every connected graph burn in ⌈√(n)⌉ steps? While this conjecture re...

0 Paul Bastide, et al. ∙

∙ 09/13/2021

Distributed recoloring of interval and chordal graphs

One of the fundamental and most-studied algorithmic problems in distribu...

0 Nicolas Bousquet, et al. ∙

∙ 04/16/2019

Distributed Computing in the Asynchronous LOCAL model

The LOCAL model is among the main models for studying locality in the fr...

0 Carole Delporte-Gallet, et al. ∙

∙ 01/08/2019

Lower bounds for maximal matchings and maximal independent sets

There are distributed graph algorithms for finding maximal matchings and...

0 Alkida Balliu, et al. ∙

∙ 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...

0 Alkida Balliu, et al. ∙

∙ 10/04/2018

Distributed Reconfiguration of Maximal Independent Sets

Consider the following problem: given a graph and two maximal independen...

0 Keren Censor-Hillel, et al. ∙

∙ 02/19/2018

Distributed Recoloring

Given two colorings of a graph, we consider the following problem: can w...

0 Marthe Bonamy, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world