Manon BLANC
/ma.nɔ̃ blɑ̃/ — Talks
Research
Publications and Preprints
Talks
Teaching
Contact
Talks
2026
Invited talk at
CCA 2026
(July): TBA
Invited talk at the
Logic Colloquium 2026
, Session on Computability in Analysis (June): TBA
Invited talk at the workshop
Higher-Order Computation in Implicit and Descriptive Complexity
, (May):
Robust Dynamical Systems: the reachability relation is PSPACE^2-complete
Invited talk at the
Thermogamas Worshop
(May):
Robustness in Dynamical Systems: when allowing noise makes the undecidable decidable
Presentation at
EuroCG 2026
(March):
The Domino Problem is Decidable for Robust Tilesets
Seminar at Helsinki University, departement of Mathematics and Statistics,
Logic Group
(March):
Robustness and (un)decidability: from Noise to Effective Topology
Semninar at Lund University, MIAO team (January):
Computability and Complexity over the reals: motivations and models
Seminar
"Séminaire Général de Logique"
, at
IMJ-PRG
(January):
Complexity over the reals: characterising polynomial classes
Seminar at Université Savoie Mont Blanc, team
LAMA
(January):
Computing with real numbers: characterising complexity classes
Seminar "Complexité",
LIPN
(January):
Robust Dynamical Systems: the complexity of the reachability relation
Science popularisation seminar at
Collège Jean Rostand
(January):
Modéliser les ordinateurs
2025
Seminar at
IRIF
, team
Modélisation et vérification
(November):
Robust Dynamical Systems: the complexity of the reachability relation
ITU Seminar on Algorithms and Complexity
(October):
Computing with real numbers: characterising complexity classes (my PhD in 30 min)
Presentation for the
Prix Doctorant.es 2024 du Plateau de Saclay
at the
Journées des doctorant.es en STIC du plateau de Saclay
(October):
Analogue characterisations of complexity classes: The cost of computing with real numbers
Presentation at
CCA 2025
(September):
PSPACE-Completeness of the Reachability Relation of Robust Dynamical Systems
Presentation at
UCNC 2025
(September):
The Domino Problem is Decidable for Robust Tilesets
PhD Defence
(28th May):
Discrete-Time and Continuous-Time Systems over the Reals: Relating Complexity with Robustness, Length and Precision
Seminar at Université Aix-Marseille (Intitut de Mathématiques de Marseille),
GDAC
Team (May):
Characterisations of polynomial-time and -space complexity classes over the reals: ODEs and Robustness
Seminar at ENS de Lyon, MC2 Team (April):
Characterisations of polynomial-time and -space complexity classes over the reals: ODEs and Robustness
Seminar at Copenhagen University,
BARC
(February):
Robustness in complexity over the reals: describing complexity classes
Workshop
IRN Clove
, Copenhagen (January):
Computability and complexity over the reals: some characterisations of classes
2024
Workshop
Practices around Computation
(December):
Analogue models of computation: computing with real numbers
Seminar at Helsinki University, departement of Mathematics and Statistics,
Logic Group
(October):
Computing with real numbers: Robustness in computability and complexity over the reals
Presentation at
CCC 2024
(October):
Characterisations of polynomial-space complexity classes over the reals: algebraic characterisations of classes
Seminar at
LAMFA
, team
SymPA
(September):
Notions of robustness for different types of dynamical systems
Seminar at
Laboratoire d'Informatique de Paris-Nord
, team
LoVe
(September):
Characterisations of polynomial-time and -space complexity classes over the reals
Presentation at
ICALP 2024
(July):
The complexity of computing in continuous time: space complexity is precision
Presentation at
Women in Logic 2024
(July):
The decidability of the domino problem
The Theoretical Cosynus seminar
(June):
The complexity of computing in continuous time: space complexity is precision
Seminar at INRIA Saclay,
team GRACE
(June):
Computability and complexity over the reals
Seminar at Université Aix-Marseille, LIS,
team MOVE
(May):
Computability and complexity over the reals
Seminar at Université Versailles Saint-Quentin,
Laboratoire David
(April):
Computability and complexity over the reals
Students seminar
at École Normale Supérieure Paris-Saclay (March):
Computability and complexity over the reals, introduction
Presentation at
CSL 2024
(February) :
Measuring the robusteness of dynamical systems
2023
Presentation at the
Complexity Days
at Université Paris-Cité (December):
A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations
Seminar at Université de Caen,
GREYC
, "séminaire Algo" (December):
Measuring the robusteness of dynamical systems
Presentation at
CCC
(September) :
A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations
Presentation at
CCA
(September):
A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations
Presentation at
MFCS 2023
(August):
A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations
Presentation at
Women in Logic 2023
(July):
Measuring the robustness of dynamical systems
Seminar at
SePAG
(July):
Computability and Complexity
Presentation at
RJMI at École Normale Supérieure Paris-Saclay
(March):
Modéliser les ordinateurs: introduction à la calculabilité
2022
Presentation at
MCU 2022
(September):
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
Presentation at
CiE 2022
(July):
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations