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
Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which
Simulating noninteracting systems of fermionic particles (such as electrons) -- so called 'free fermions' -- is a basic routine in computational many
In this talk, I will present the research activities undertaken by our group focused on the study of the electronic structure of molecular systems
On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
In this talk we will discuss to what extent entanglement is a "feelable" (or efficiently observable) quantity of quantum systems. Inspired by recent
k-block-positivity is an important concept in quantum entanglement theory. A k-block-positive operator serves as a witness for states with Schmidt