Recherche
Given a relational specification \varphi(X, Y_1, ... Y_n), Boolean functional synthesis concerns the construction of Boolean functions F_1(X), ... F_n
Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on
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
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 propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that
Mouna Safir (ENS Lyon) Title: Self-Stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter Abstract: We consider distributed
Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs