Publications

2024

• Manon Blanc and Olivier Bournez. A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations, International Journal of Foundations of Computer Science, published in August 2024.
• Manon Blanc and Olivier Bournez. The Complexity of Computing in Continuous Time: Space Complexity Is Precision 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 129:1-129:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ICALP.2024.129
• Manon Blanc and Olivier Bournez. Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 17:1-17:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

2023

• Blanc, M., Bournez, O. (2023). 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. MFCS 2023: 21:1-21:15. BEST PAPER AWARD.

2022

• Blanc, M., Bournez, O. (2022). A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. In: Durand-Lose, J., Vaszil, G. (eds) Machines, Computations, and Universality. MCU 2022. Lecture Notes in Computer Science, vol 13419. Springer, Cham. https://doi.org/10.1007/978-3-031-13502-6_4. BEST STUDENT PAPER AWARD.

2021

• Blanc, M., Hansen, K.A. (2021).Computational Complexity of Multi-player Evolutionarily Stable Strategies. In: Santhanam, R., Musatov, D. (eds) Computer Science – Theory and Applications. CSR 2021. Lecture Notes in Computer Science(), vol 12730. Springer, Cham. https://doi.org/10.1007/978-3-030-79416-3_1

Preprints

• Blanc, M., Bournez, O. (2024). The complexity of computing in continuous time: space complexity is precision .
• Aubrun, N., Blanc, M., Bournez, O. (2024). The domino problem is decidable for robust tilesets.
• Blanc, M., Bournez, O. (2023).Measuring robustness of dynamical systems. Relating time and space to length and precision.
• Blanc, M., Bournez, O. (2022).Polynomial time computable functions over the reals characterized using discrete ordinary differential equations.
• Blanc, M., Hansen, K.A. (2022).Computational Complexity of Multi-player Evolutionarily Stable Strategies, journal version.