Recherche
/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type
/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core
In this talk, we will consider the computational complexity of solving stochastic games with mean-payoff objectives, where ($\epsilon$-)optimal
/Exposé /Talk/ The chromatic number and clique number are well-studied notions that have motivated a significant part of the research in graph theory
Wolfgang-OP: A Robust Humanoid Robot Platform for Research and Competitions Jasper Güldenstein Visio: https://u-bordeaux-fr.zoom.us/j/83483228567
In this presentation, I will focus on two classes of games showing quantum computational advantage: XOR nonlocal games and XOR* sequential games with
Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many
Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination
Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off