Computational Complexity of Multi-player Evolutionarily Stable Strategies. - Manon Blanc; Kristoffer Arnsfelt Hansen (CSR, 2021)

A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. - Manon Blanc; Olivier Bournez (MCU, 2022)

Polynomial time computable functions over the reals characterized using discrete ordinary differential equations. - Manon Blanc; Olivier Bournez (CoRR, 2022)

A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs. - Manon Blanc; Olivier Bournez (MFCS, 2023)

Measuring robustness of dynamical systems. Relating time and space to length and precision. - Manon Blanc; Olivier Bournez (CoRR, 2023)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations. - Manon Blanc; Olivier Bournez (CoRR, 2023)

Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision. - Manon Blanc; Olivier Bournez (CSL, 2024)

The Complexity of Computing in Continuous Time: Space Complexity Is Precision. - Manon Blanc; Olivier Bournez (ICALP, 2024)

The domino problem is decidable for robust tilesets. - Nathalie Aubrun; Manon Blanc; Olivier Bournez (CoRR, 2024)

Simulation of Turing machines with analytic discrete ODEs: Polynomial-time and space over the reals characterised with discrete ordinary differential equations. - Manon Blanc; Olivier Bournez (J. Log. Anal., 2025)