Recherche
We introduce Sampled-Based Guided Quantum Walk (SamBa–GQW), a novel quantum algorithm for approximating solutions of binary combinatorial optimization
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries
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
Title: Rewriting consistent answers on annotated data Abstract: In this talk, I'll be discussing results on consistent query answering over databases
In this talk, I will present the research activities undertaken by our group focused on the study of the electronic structure of molecular systems
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