Recherche

Exposé en anglais / Talk in english There are various parameters used to measure the complexity of posets (partially ordered sets), and many

Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on

Fabien Lotte est lauréat 2022 du prix USERN (Universal Scientific Education and Research Network) dans la catégorie "Formal Science", pour son projet

Petri nets constitute a well-studied model to verify and study concurrent systems, among others, and computing the coverability set is one of the most

/Exposé /Talk/ Recent developments in the intersection of structural graph theory, parameterized algorithms, and finite model theory have provided

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

Maslov’s class K-bar is a fragment of First-Order Logic consisting of formulae in NNF whose variables occurring in the different atoms obey a certain

We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from

/Exposé /Talk/ In this talk, we will introduce a novel cooperative game theory model designed to tackle a significant unresolved issue in operations