Recherche

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

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

Hussein Kazemi (LaBRI) Title: Trajectory visibility at first sight Abstract: Let P be a simple polygon with n vertices, and let two moving entities q

/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

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

Anaïs Binet, en thèse avec Myriam Desainte-Catherine (département I&S, équipe TAD), est lauréate du concours "Mature pour PhD +". Elle a été mise à l

We use quantum devices from IBMQ to perform digital quantum simulations of the Schwinger model. We work with a quantum link model description of the

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