Recherche

** Enumeration Classes Defined by Circuits ** We refine the complexity landscape for enumeration problems by introducing very low classes defined by

Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verification and other fields. However

Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which

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

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

/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

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