| 2026 | CiE | Ordinary Differential Equations as a Universal Language for Computability and Complexity: From Polynomial Time to the Hyperarithmetical Hierarchy. | Olivier Bournez |
| 2026 | ISSAC | Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides. | Olivier Bournez, Alonso Nez |
| 2026 | MFCS | Primitive Recursion Without Composition. | Olivier Bournez |
| 2025 | MFCS | A Universal Uniform Approximation Theorem for Neural Networks. | Olivier Bournez, Johanne Cohen, Adrian Wurm |
| 2025 | UC | The Domino Problem Is Decidable for Robust Tilesets. | Nathalie Aubrun, Manon Blanc, Olivier Bournez |
| 2024 | CSL | Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision. | Manon Blanc, Olivier Bournez |
| 2024 | ICALP | The Complexity of Computing in Continuous Time: Space Complexity Is Precision. | Manon Blanc, Olivier Bournez |
| 2024 | STACS | Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. | Olivier Bournez, Riccardo Gozzi |
| 2023 | MFCS | 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 |
| 2022 | CiE | Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language. | Olivier Bournez |
| 2022 | MCU | A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. | Manon Blanc, Olivier Bournez |
| 2020 | STACS | Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). | Olivier Bournez |
| 2019 | MFCS | Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. | Olivier Bournez, Arnaud Durand |
| 2018 | SYNASC | Ordinary Differential Equations & Computability. | Olivier Bournez |
| 2018 | SYNASC | Cheap Non-Standard Analysis and Computability: Some Applications. | Olivier Bournez, Sabrina Ouazzani |
| 2017 | ICALP | A Universal Ordinary Differential Equation. | Olivier Bournez, Amaury Pouly |
| 2016 | CiE | Axiomatizing Analog Algorithms. | Olivier Bournez, Nachum Dershowitz, Pierre Nron |
| 2016 | ICALP | Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2013 | CiE | Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly, Ning Zhong |
| 2013 | TAMC | Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2013 | UC | Population Protocols on Graphs: A Hierarchy. | Olivier Bournez, Jonas Lefvre |
| 2012 | ISSAC | On the complexity of solving initial value problems. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2012 | MFCS | Computing with Large Populations Using Interactions. | Olivier Bournez, Pierre Fraigniaud, Xavier Koegler |
| 2012 | TAMC | Towards an Axiomatization of Simple Analog Algorithms. | Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich |
| 2011 | MFCS | Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2011 | OPODIS | Computing with Pavlovian Populations. | Olivier Bournez, Jrmie Chalopin, Johanne Cohen, Xavier Koegler, Mikal Rabie |
| 2010 | MFCS | Robust Computations with Dynamical Systems. | Olivier Bournez, Daniel Silva Graa, Emmanuel Hainry |
| 2008 | UC | Distributed Learning of Wardrop Equilibria. | Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen |
| 2007 | MCU | On the Computational Capabilities of Several Models. | Olivier Bournez, Emmanuel Hainry |
| 2006 | TAMC | The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. | Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graa, Emmanuel Hainry |
| 2004 | ICALP | An Analog Characterization of Elementarily Computable Functions over the Real Numbers. | Olivier Bournez, Emmanuel Hainry |
| 2004 | MCU | Real Recursive Functions and Real Extensions of Recursive Functions. | Olivier Bournez, Emmanuel Hainry |
| 2003 | FOSSACS | Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. | Olivier Bournez, Felipe Cucker, Paulin Jacob de Naurois, Jean-Yves Marion |
| 2003 | ICCS | Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. | Olivier Bournez, Guy-Marie Cme, Valrie Conraud, Hlne Kirchner, Liliana Ibanescu |
| 2000 | ICALP | On the Representation of Timed Polyhedra. | Olivier Bournez, Oded Maler |
| 2000 | STACS | The Stability of Saturated Linear Dynamical Systems Is Undecidable. | Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis |
| 1997 | ICALP | Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). | Olivier Bournez |