Recherche

**Orbit-finite linear programming** An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely

Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments This paper deals with the trade-off between time

Anaïs Binet, en thèse avec Myriam Desainte-Catherine (département I&S, équipe TAD), est lauréate du concours "Mature pour PhD +". Elle a été mise à l

(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of

We use quantum devices from IBMQ to perform digital quantum simulations of the Schwinger model. We work with a quantum link model description of the

We introduce Sampled-Based Guided Quantum Walk (SamBa–GQW), a novel quantum algorithm for approximating solutions of binary combinatorial optimization

/Exposé en français/Talk in french / English slides / transparents en anglais In this talk, I will given a rather simple construction of a graph U n

/Exposé en anglais/Talk in english/ Given n points in the plane, a spanning tree is a set of n-1 straight line edges connecting them while inducing a

/Exposé /Talk/ We introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the

We study the notion of k-stabilizer universal quantum state, that is, an n-qubit quantum state, such that it is possible to induce any stabilizer