Recherche

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

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

We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a

/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n

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

On the Compressibility of Real Numbers: Certain insights using Fourier analytic methods Subin Pulari (post-doc M2F) Abstract: Measuring the

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