Olivier Bournez

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 45

Top Venues

Publications

Manon Blanc, Olivier Bournez
The complexity of computing in continuous time: space complexity is precision. CoRR (2024)
Manon Blanc, Olivier Bournez
The Complexity of Computing in Continuous Time: Space Complexity Is Precision. ICALP (2024)
Riccardo Gozzi, Olivier Bournez
Set Descriptive Complexity of Solvable Functions. CoRR (2024)
Olivier Bournez, Riccardo Gozzi
Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations. CoRR (2024)
Nathalie Aubrun, Manon Blanc, Olivier Bournez
The domino problem is decidable for robust tilesets. CoRR (2024)
Olivier Bournez, Riccardo Gozzi
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. STACS (2024)
Manon Blanc, Olivier Bournez
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision. CSL (2024)
Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly
A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. 77 (2023)
Olivier Bournez, Arnaud Durand
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Comput. Complex. 32 (2) (2023)
Manon Blanc, Olivier Bournez
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)
Manon Blanc, Olivier Bournez
Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations. CoRR (2023)
Manon Blanc, Olivier Bournez
Measuring robustness of dynamical systems. Relating time and space to length and precision. CoRR (2023)
Manon Blanc, Olivier Bournez
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations. CoRR (2022)
Manon Blanc, Olivier Bournez
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations. CoRR (2022)
Manon Blanc, Olivier Bournez
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. MCU (2022)
Olivier Bournez, Arnaud Durand
A characterization of functions over the integers computable in polynomial time using discrete differential equations. CoRR (2022)
Olivier Bournez
Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language. CiE (2022)
Olivier Bournez
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). STACS (2020)
Olivier Bournez, Amaury Pouly
A Universal Ordinary Differential Equation. Log. Methods Comput. Sci. 16 (1) (2020)
Olivier Bournez, Arnaud Durand
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. MFCS (2019)
Olivier Bournez, Amaury Pouly
A Survey on Analog Models of Computation. CoRR (2018)
Olivier Bournez, Arnaud Durand, Sabrina Ouazzani
Recursion schemes, discrete differential equations and characterization of polynomial time computation. CoRR (2018)
Olivier Bournez
Ordinary Differential Equations & Computability. SYNASC (2018)
Olivier Bournez, Johanne Cohen, Mikaël Rabie
Homonym Population Protocols. Theory Comput. Syst. 62 (5) (2018)
Olivier Bournez, Sabrina Ouazzani
Cheap Non-Standard Analysis and Computability: Some Applications. SYNASC (2018)
Olivier Bournez, Sabrina Ouazzani
Cheap Non-standard Analysis and Computability. CoRR (2018)
Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov
Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. 29 (4) (2018)
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
On the complexity of bounded time and precision reachability for piecewise affine systems. Theor. Comput. Sci. 735 (2018)
Olivier Bournez, Amaury Pouly
A Universal Ordinary Differential Equation. CoRR (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the functions generated by the general purpose analog computer. Inf. Comput. 257 (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM 64 (6) (2017)
Olivier Bournez, Amaury Pouly
A Universal Ordinary Differential Equation. ICALP (2017)
François Fages, Guillaume Le Guludec, Olivier Bournez, Amaury Pouly
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs. CMSB (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR (2016)
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
A Framework for Algebraic Characterizations in Recursive Analysis. CoRR (2016)
Olivier Bournez, Nachum Dershowitz, Pierre Néron
Axiomatizing Analog Algorithms. CiE (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Computing with polynomial ordinary differential equations. J. Complex. 36 (2016)
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. CoRR (2016)
Olivier Bournez, Johanne Cohen, Mikaël Rabie
Homonym Population Protocols. CoRR (2016)
Olivier Bournez, Nachum Dershowitz, Pierre Néron
Axiomatizing Analog Algorithms. CoRR (2016)
Vasco Brattka, Paola Bonizzoni, Olivier Bournez, Elvira Mayordomo
Editorial. Comput. 5 (1) (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the Functions Generated by the General Purpose Analog Computer. CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
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. ICALP (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Computing with Polynomial Ordinary Differential Equations. CoRR (2016)
Olivier Bournez, Johanne Cohen, Mikaël Rabie
Homonym Population Protocols. NETYS (2015)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS (2015)
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. RP (2014)
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79 (5) (2013)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE (2013)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. 9 (1-2) (2013)
Olivier Bournez, Jonas Lefèvre, Mikaël Rabie
Trustful Population Protocols. DISC (2013)
Olivier Bournez, Jonas Lefèvre
Population Protocols on Graphs: A Hierarchy. UCNC (2013)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC (2013)
Olivier Bournez, Pierre Fraigniaud, Xavier Koegler
Computing with Large Populations Using Interactions. MFCS (2012)
Amaury Pouly, Olivier Bournez, Daniel Silva Graça
Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the complexity of solving initial value problems CoRR (2012)
Olivier Bournez, Johanne Cohen
Learning Equilibria in Games by Stochastic Distributed Algorithms. ISCIS (2012)
Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich
Towards an Axiomatization of Simple Analog Algorithms. TAMC (2012)
Olivier Bournez, Gilles Dowek
Preface. Nat. Comput. 11 (1) (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the complexity of solving initial value problems. ISSAC (2012)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
Asymetric Pavlovian Populations CoRR (2011)
Olivier Bournez, Walid Gomaa, Emmanuel Hainry
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. Int. J. Unconv. Comput. 7 (5) (2011)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
Computing with Pavlovian Populations. OPODIS (2011)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS (2011)
Guillaume Aupy, Olivier Bournez
On the number of binary-minded individuals required to compute sqrt(1/2). Theor. Comput. Sci. 412 (22) (2011)
Olivier Bournez, Igor Potapov
Preface. Int. J. Found. Comput. Sci. 22 (4) (2011)
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
Robust Computations with Dynamical Systems. MFCS (2010)
Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen
A dynamic approach for load balancing. VALUETOOLS (2009)
Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton
Distributed Learning of Equilibria in a Routing Game. Parallel Process. Lett. 19 (2) (2009)
Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner
Verification of Timed Automata Using Rewrite Rules and Strategies CoRR (2009)
Olivier Bournez, Manuel Lameiras Campagnolo
A Survey on Continuous Time Computations CoRR (2009)
Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler
On the convergence of population protocols when population goes to infinity. Appl. Math. Comput. 215 (4) (2009)
Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler
On the Convergence of Population Protocols When Population Goes to Infinity CoRR (2009)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
Population Protocols that Correspond to Symmetric Games CoRR (2009)
Olivier Bournez, Johanne Cohen
Learning Equilibria in Games by Stochastic Distributed Algorithms CoRR (2009)
Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen
Distributed Learning of Wardrop Equilibria. UC (2008)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
Playing With Population Protocols CSP (2008)
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. 23 (3) (2007)
Olivier Bournez, Emmanuel Hainry
On the Computational Capabilities of Several Models. MCU (2007)
Olivier Bournez, Liliana Ibanescu, Hélène Kirchner
From Chemical Rules to Term Rewriting. Electron. Notes Theor. Comput. Sci. 147 (1) (2006)
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC (2006)
Olivier Bournez
How much can analog and hybrid systems be proved (super-)Turing. Appl. Math. Comput. 178 (1) (2006)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204 (2) (2006)
Olivier Bournez, Florent Garnier
Proving Positive Almost Sure Termination Under Strategies. RTA (2006)
Olivier Bournez, Emmanuel Hainry
Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Informaticae 74 (4) (2006)
Olivier Bournez, Emmanuel Hainry
Elementarily computable functions over the real numbers and R-sub-recursive functions. Theor. Comput. Sci. 348 (2-3) (2005)
Olivier Bournez, Florent Garnier
Proving Positive Almost-Sure Termination. RTA (2005)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. 15 (1) (2005)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS (2004)
Olivier Bournez, Emmanuel Hainry
An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP (2004)
Olivier Bournez, Emmanuel Hainry
Real Recursive Functions and Real Extensions of Recursive Functions. MCU (2004)
Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu
Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. International Conference on Computational Science (2003)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electron. Notes Theor. Comput. Sci. 90 (2003)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS (2003)
Olivier Bournez, Mathieu Hoyrup
Rewriting Logic and Probabilities. RTA (2003)
Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms. RTA (2003)
Olivier Bournez, Claude Kirchner
Probabilistic Rewrite Strategies. Applications to ELAN. RTA (2002)
Olivier Bournez
A Generalization of Equational Proof Theory? PAPM-PROBMIV (2002)
Olivier Bournez, Michael S. Branicky
The Mortality Problem for Matrices of Low Dimensions. Theory Comput. Syst. 35 (4) (2002)

Olivier Bournez.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Bournez