Olivier Bournez
Orcid: 0000-0002-9218-1130
According to our database1,
Olivier Bournez
authored at least 95 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
CoRR, 2024
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024
2023
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations.
Comput. Complex., December, 2023
A continuous characterization of PSPACE using polynomial ordinary differential equations.
J. Complex., August, 2023
Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations.
CoRR, 2023
Measuring robustness of dynamical systems. Relating time and space to length and precision.
CoRR, 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.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
2022
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations.
CoRR, 2022
A characterization of functions over the integers computable in polynomial time using discrete differential equations.
CoRR, 2022
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022
Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language.
Proceedings of the Revolutions and Revelations in Computability, 2022
2020
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk).
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
2019
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
2018
On the complexity of bounded time and precision reachability for piecewise affine systems.
Theor. Comput. Sci., 2018
Int. J. Found. Comput. Sci., 2018
Recursion schemes, discrete differential equations and characterization of polynomial time computation.
CoRR, 2018
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018
Proceedings of the 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2018
2017
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.
J. ACM, 2017
Inf. Comput., 2017
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs.
Proceedings of the Computational Methods in Systems Biology, 2017
2016
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version).
CoRR, 2016
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.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016
2015
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015
2014
Proceedings of the Reachability Problems - 8th International Workshop, 2014
2013
Int. J. Unconv. Comput., 2013
Proceedings of the Distributed Computing - 27th International Symposium, 2013
Proceedings of the Unconventional Computation and Natural Computation, 2013
Proceedings of the Theory and Applications of Models of Computation, 2013
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
Proceedings of the Computer and Information Sciences III, 2012
2011
Theor. Comput. Sci., 2011
Int. J. Unconv. Comput., 2011
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
2009
Appl. Math. Comput., 2009
Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009
2008
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008
Proceedings of the Unconventional Computing, 7th International Conference, 2008
2007
Polynomial differential equations compute all real computable functions on computable compact intervals.
J. Complex., 2007
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007
2006
Inf. Comput., 2006
Fundam. Informaticae, 2006
Appl. Math. Comput., 2006
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.
Proceedings of the Theory and Applications of Models of Computation, 2006
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006
Modèles Continus. Calculs. Algorithmique Distribuée. (Continuous Models. Computations. Distributed Algorithms).
, 2006
2005
Elementarily computable functions over the real numbers and R-sub-recursive functions.
Theor. Comput. Sci., 2005
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
J. Log. Comput., 2005
Proceedings of the 6th International Workshop on Rule-Based Programming, 2005
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005
2004
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004
An Analog Characterization of Elementarily Computable Functions over the Real Numbers.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003
Proceedings of the Computational Science - ICCS 2003, 2003
Proceedings of the Foundations of Software Science and Computational Structures, 2003
2002
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002
Proceedings of the Process Algebra and Probabilistic Methods, 2002
2001
Theor. Comput. Sci., 2001
J. Comput. Syst. Sci., 2001
2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Proceedings of the Hybrid Systems: Computation and Control, Third International Workshop, 2000
1999
Theor. Comput. Sci., 1999
Theory Comput. Syst., 1999
Proceedings of the Hybrid Systems: Computation and Control, Second International Workshop, 1999
1998
Comput. Vis. Image Underst., 1998
1997
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
1996
Theor. Comput. Sci., 1996