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 the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded

In this presentation, I will focus on two classes of games showing quantum computational advantage: XOR nonlocal games and XOR* sequential games with

Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination

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