Recherche

Runtime verification consists in checking whether a program satisfies a given specification by observing the trace it produces during its execution

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

Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which

In this talk, I will present the research activities undertaken by our group focused on the study of the electronic structure of molecular systems

Title: Rewriting consistent answers on annotated data Abstract: In this talk, I'll be discussing results on consistent query answering over databases

Simulating noninteracting systems of fermionic particles (such as electrons) -- so called 'free fermions' -- is a basic routine in computational many

Hadwiger's conjecture, first formulated in 1943, is a vast generalization of the four-color theorem, and remains one of the central open problems in

(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of

On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for