Recherche
/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core
Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off
Many classes of Boolean functions can be tested much faster than they can be learned. However, this speedup tends to rely on query access to the
Tensor networks (TNs) offer powerful algorithms for simulating quantum systems, but struggle to represent states with high entanglement. In contrast
We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a
/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic
Strong flip-flatness has emerged as a natural dense analogue of uniform almost-wideness in the context of preservation theorems, but its combinatorial