Defenses are conducted in English, except possibly the questions and answers (upon mutual agreement).
Each defense consists of a 15-minute slideshow presentation followed by about 8 minutes of questions, leaving two minutes to switch speakers.
| Room B1 (Édouard Bonnet, Rémi Gribonval, Matteo Mio) | Time | Room B2 (Tito Nguyen, Nathalie Revol, Yannick Zakowski) |
|---|---|---|
| Flora Helmers: Causally Reasoning LLMs | 9:05-9:30 | Alix Tremodeux: Fault-tolerant numerical iterative algorithms at scale |
| Léo le Nestour: General Formulation of Renormalization Flow and Fixed Points with Tensor Networks | 9:30-9:55 | Hugo Passe: Automatic error analysis of programs operating on floating-point numbers |
| Thomas Bobille: Supervised Classification of Graph Signals: When to use Graph Neural Networks? | 9:55-10:20 | Élodie Bernard: Fingerprinting statemachine of WiFi-enabled user devices |
| break | ||
| Tristan Klein: Quantum max-flow/min-cut | 10:40-11:05 | Arthur Vinciguerra: Symbolic-numeric algorithms for the certified computation of Puiseux series |
| Enrique Galvez: Convolutions for Efficient Inference of Deep Neural Networks on Embedded Processors | 11:05-11:30 | Étienne Ramrani: Orientation-finding algorithms for supersingular elliptic curves |
| Room B1 (Édouard Bonnet, Matteo Mio, Tito Nguyen) | Time | Room B2 (Cyril Cohen, Nathalie Revol, Yannick Zakowski) |
| Thomas Perez: Convex relaxation and tensor network methods for ground state computation | 13:35-14:00 | Victor Dellacherie: Relational Intersection Types for Lambda Calculus |
| Hind Atbir: PAC-Bayesian Fair Learning | 14:00-14:25 | Vivien Gachet: Tail modulo Async/Await |
| Samuel Bounan: Risk-aware Reinforcement Learning: using exponential moments | 14:25-14:50 | Iwan Quémerais: Visibility in the Π-calculus |
| break | ||
| Joël Charles-Rebuffé: A model-based algorithm for restless bandits | 15:10-15:35 | Léo Poirier: Convergence properties in one-dimensional cellular automata |
| Séhane Bel Houari: A Learning Algorithm for Controlled Parametric Markov Processes | 15:35-16:00 | Damien Lesens: Greedy algorithms for computing the Birkhoff decomposition |
| Time | Room B1 (Édouard Bonnet, Daniel Hirschkoff, Gabriel Radanne) |
|---|---|
| 9:05-9:30 | Léon Ducruet: Exceptional Actris: Session-Type Based Error Handling in Separation Logic |
| 9:30-9:55 | Léon Frenot: CFG Patterns: A new tool to formally verify optimisations in Vellvm |
| 9:55-10:20 | Mathias Berry: Higher order matching |
| break | |
| 10:40-11:05 | Marie de Sainte Marie: DNA Origamis |
| 11:05-11:30 | Samuel Gardelle: DNA sequence design |
| 11:30-11:55 | Marie-Éva Fabri: Abstract Interpretation of the Dynamics of Reaction Networks with Partial Kinetic Information |
| Time | Room B1 (Édouard Bonnet, Olivier Laurent, Titouan Vayer) |
| 13:35-14:00 | Louann Coste: Graph representation with low crossing numbers |
| 14:00-14:25 | Arthur Dumas: Study of the «path-game» in trees |
| 14:25-14:50 | Clément Yvernes: Causality and Uncertainty: Identifiability by Common Backdoor of Multivariate Effects from Abstractions of Time Series Causal Graph |
| break | |
| 15:10-15:35 | Maxime Just: Study of the fundamental mechanisms in an autonomous data management system |
| 15:35-16:00 | Thomas Stavis: Energy leverages for large scale distributed systems: model extension and placement |
| 16:00-16:25 | Adrien Obrecht: Scheduling Task Graphs for Average Memory Consumption Reduction |