Recherche

Anaïs Binet, en thèse avec Myriam Desainte-Catherine (département I&S, équipe TAD), est lauréate du concours "Mature pour PhD +". Elle a été mise à l

/Exposé en anglais/Talk in english/ The Alon-Jaeger-Tarsi conjecture states that for any finite field F of size at least 4 and any nonsingular matrix

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

*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/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type

In this presentation, I will focus on two classes of games showing quantum computational advantage: XOR nonlocal games and XOR* sequential games with

Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination

Title: Querying Incomplete Numerical Data: Between Certain and Possible Answers Place: room 178 Abstract: Queries with aggregation and arithmetic