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
In this talk I will present the main result of the paper "Optimizing Strongly Interacting Fermionic Hamiltonians" Matthew B. Hastings, Ryan O'Donnell
In a functional program, a function may take an argument that is itself... a function. When it comes to model-checking, that implies that the tree of
/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
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed
We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to