Recherche

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

Nils Morawietz (LaBRI) Title: A Parameterized-Complexity Framework for Finding Local Optima Abstract: Local search is a fundamental optimization

Verifying Liveness Properties under Weak Memory Models I will discuss verifying liveness properties for concurrent programs running on weak memory

ATTENTION: 10:45 Guillaume Lagarde (LaBRI) Title: Analyzing and Leveraging the k-Sensitivity of LZ77 Abstract: We study the sensitivity of the Lempel

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

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