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

The well-known Nerode equivalence for finite words plays a fundamental role in our understanding of the class of regular languages. The equivalence

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

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

Mouna Safir (IRIF) Title: Some new results with k-set agreement Abstract: In this talk, I will present our investigation of the solvability of k-set

A sublinear-time quantum algorithm for approximating partition functions Gibbs partition functions are ubiquitous in statistical physics and in

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