Recherche
Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination
/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
Guess Random Additive Noise Decoder (GRAND) has emerged as a noise-centric universal decoder in classical systems, enabling low-energy, low-latency
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
In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph