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

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

(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

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