Recherche
Jonathan Narboni Title: Lower Bound for Constant-Size Local Certification Abstract: Given a network property or a data structure, a local
*Two-player boundedness counter games* We consider two-player zero-sum games with winning objectives beyond regular languages, expressed as a parity
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic
Title: Querying Incomplete Numerical Data: Between Certain and Possible Answers Place: room 178 Abstract: Queries with aggregation and arithmetic
The cell cycle is a sequence of events by which a cell reproduces itself while preserving the integrity of its genome. This preservation property is
/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type
Given a relational specification \varphi(X, Y_1, ... Y_n), Boolean functional synthesis concerns the construction of Boolean functions F_1(X), ... F_n
In this talk, we present the paper "Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits" by Nikita A. Zemlevskiy, where
/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core