Recherche

Title: No more Boyer-Moore ! Quite old algorithmic string matching stuff but not so well known Speaker: Mathieu Raffinot, CR CNRS, équipe BKB, LaBRI

/Exposé /Talk/ The irregularity strength s(G) of a graph G is the smallest k such that the edges of G can be labelled with 1,...,k so that no two

/Exposé en anglais/Talk in english/ A rainbow matching in an edge-coloured graph is a matching whose edges all have different colours. Let G be a

We aim at designing both theoretically and experimentally methods for the automatic detection of potential bugs in software – or the proof of the

We are interested in tools for synthesizing strategies in timed games with parity objective. From a theoretical point of view, we define and interpret

Quantum physics and chemistry have provided well-recognized theoretical tools to predict the behavior of molecules and materials described by the

In this talk I will present the main result of the paper "Optimizing Strongly Interacting Fermionic Hamiltonians" Matthew B. Hastings, Ryan O'Donnell

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

In a functional program, a function may take an argument that is itself... a function. When it comes to model-checking, that implies that the tree of

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