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

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

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

Tensor networks (TNs) offer powerful algorithms for simulating quantum systems, but struggle to represent states with high entanglement. In contrast

*Two-player boundedness counter games* We consider two-player zero-sum games with winning objectives beyond regular languages, expressed as a parity