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 (Samuel Arsac, Édouard Bonnet, Pascal Koiran) | Time | Room B2 (Francesco Bronzino, Elisa Riccietti, Rémi Watrigant) |
---|---|---|
- | 9:05–9:30 | Frédéric Becerril: Applications en apprentissage automatique |
Émile Martinez: Études sur les jeux d'appairages séquentiels | 9:30–9:55 | Duncan Bordin: Learning to predict the response to antidepressant drugs |
Gabin Calmet: Approche algorithmique pour estimer l’efficacité d'une population | 9:55–10:20 | Antoine Crosnier: Learning to reconstruct from noisy data alone with applications to astronomical imaging |
break | ||
Adrien Dubois: Cryptanalysis of lattice-based assumptions | 10:40–11:05 | Gaetan Nodet: X-Ray: Accélération des communications entre machines virtuelles grâce à User Interrupt |
Mathieu Bouget: Studying encryption from supersingular torsion attacks | 11:05–11:30 | Basile Leretaille: Analyse de cycle de vie prospective d'un système d'information |
Room B1 (Samuel Arsac, Édouard Bonnet, Gabriel Radanne) | Time | Room B2 (Michele Pagani, Damien Pous, Nathalie Revol) |
- | 13:35–14:00 | Apolline Rodary: Metrics for probabilistic semantics |
Johann Rosain: Une sorte pour les objets calculatoires effacés en Théorie des Types | 14:00–14:25 | Lucie Lahaye: Extensions du calcul de Trocq pour le raisonnement (iso)modulo morphisme |
Adam Donadille: Toward Refinement Types for Liveness Properties | 14:25–14:50 | Théa Hervier: Mixing Monadic Effects and Labelled Transition Systems in Rocq |
break | ||
Jonathan Roux: Study of microphone leakage on modern computers | 15:10–15:35 | Élodie Bernard: Détection de comportement de fingerprinting dans des applications Android |
- | 15:35–16:00 | – |
Time | Room B1 (Édouard Bonnet, Daniel Hirschkoff, Nicolas Trotignon) |
---|---|
9:05–9:30 | Julien Cocquet: Exclusion de mineurs dans les graphes ordonnés |
9:30–9:55 | Benjamin Duhamel: Weakly sparse classes excluding an induced minor |
9:55–10:20 | Ronan Toullec-Streicher: Décidabilité de la détection de graphe “forceur” |
break | |
10:40–11:05 | Justine Cauvi: Temporal graphs: labelings and parameters |
11:05–11:30 | Corentin Moumard: Optimizing tree decomposition algorithms for weighted component minimization in graphs |
Time | Room B1 (Christophe Alias, Édouard Bonnet, Claude-Pierre Jeannerod) |
13:35–14:00 | Maxime Bruno: TCP and QUIC: A theoretical and empirical comparison |
14:00–14:25 | Greg Depoire-Ferrer: Hardware-assisted userspace page fault handling |
14:25–14:50 | Line Fremery: Simulations performantes en volumes finis sur architectures multi-GPU |
break | |
15:10–15:35 | Gwendal Ducloz: DNA computing: Theory, Models and wet lab experiments |
15:35–16:00 | Vincent Gardies: Evolutionary Unconstraint Networks (EVOLUNET) |