Recherche

The first question when deploying a program synthesis approach is the design of the target programming language, called domain-specific language (DSL)

**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

Antoine Pirrone soutiendra sa thèse intitulée : « Apprentissage profond auto-supervisé de métriques : application à la prédiction d'assemblage de

/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

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

We study zero-sum games played on graphs and present contributions toward the following question: given an objective, how much memory is required to