Recherche

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

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

Mouna Safir (ENS Lyon) Title: Self-Stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter Abstract: We consider distributed

Vectors addition systems with states (VASS), a model equivalent to Petri nets, are finite-state machines with finitely many counters ranging over the

/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

Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs