Recherche

The talk is in two parts. In the first part, we prove a lower bound on the scrambling speed of a random quantum circuit. We give three applications of

Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the

Le Graduate Program Numerics vous invite à son séminaire sur les enjeux sociétaux & la culture scientifique en lien avec le numérique. Deuxième séance
Le Graduate Program Numerics vous invite à son séminaire sur les enjeux sociétaux & la culture scientifique en lien avec le numérique. Deuxième séance

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture

/Exposé en anglais/Talk in english/ The Maker-Breaker game is played on a hypergraph H. Maker and Breaker take turns coloring vertices of H, in red

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