Recherche
Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination
In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded
/Exposé en français/Talk in french / English slides / transparents en anglais In this talk, I will given a rather simple construction of a graph U n
/Exposé en anglais/Talk in english/ The stack number of a directed acyclic graph G is the minimum k for which there is a topological ordering of G and
[ICQ] Maxime Cautrès (LIG) Vertex-minor universal graphs for generating entangled quantum subsystems
We study the notion of k-stabilizer universal quantum state, that is, an n-qubit quantum state, such that it is possible to induce any stabilizer
/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the
Guess Random Additive Noise Decoder (GRAND) has emerged as a noise-centric universal decoder in classical systems, enabling low-energy, low-latency
We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to
An algebraic circuit computes a polynomial using addition and multiplication operators. Understanding the power of algebraic circuits has close