Recherche

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

Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs

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

/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

On the Compressibility of Real Numbers: Certain insights using Fourier analytic methods Subin Pulari (post-doc M2F) Abstract: Measuring the

Ralf Klasing (LaBRI) Title: Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems Abstract: Finding a maximum-weight

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