Recherche

Many classes of Boolean functions can be tested much faster than they can be learned. However, this speedup tends to rely on query access to the

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/ 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

In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed

Hussein Kazemi (LaBRI) Title: Trajectory visibility at first sight Abstract: Let P be a simple polygon with n vertices, and let two moving entities q

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

Anaïs Binet, en thèse avec Myriam Desainte-Catherine (département I&S, équipe TAD), est lauréate du concours "Mature pour PhD +". Elle a été mise à l