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
In this talk we will discuss to what extent entanglement is a "feelable" (or efficiently observable) quantity of quantum systems. Inspired by recent
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
Measurement incompatibility vs. Bell non-locality: an approach via tensor norms. Measurement incompatibility and quantum non-locality are two key
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
Runtime verification consists in checking whether a program satisfies a given specification by observing the trace it produces during its execution
Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which