Recherche
https://ratio.labri.fr/#meetings Title: Algorithms for consistent query answering under primary key constraints Abstract: Databases often have
/Exposé /Talk/ Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and
Contextuality in composite systems: entanglement vs. the Kochen-Specker theorem The Kochen-Specker (KS) theorem is often taken as a notion of
Quantum Chemistry and Physics have been identified as key applications for quantum computers and quantum algorithms have been designed to solve the
Timothé Picavet (LaBRI) Title: Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors Abstract: We show that graphs
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
Title: Rewriting consistent answers on annotated data Abstract: In this talk, I'll be discussing results on consistent query answering over databases
Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which