Olivier Bournez

124 papers A* 6A 4B 10C 10Misc 3Journal 66Unranked 20

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Toward higher-order infinite time Turing machines: simulational Γ-machines. Ann. Pure Appl. Log. Olivier Bournez, Olivier Finkel, Johan Girardot
2025	J	`jnl`	A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. Int. J. Found. Comput. Sci. Manon Blanc, Olivier Bournez
2025	B	`conf`	A Universal Uniform Approximation Theorem for Neural Networks. MFCS Olivier Bournez, Johanne Cohen, Adrian Wurm
2025	J	`jnl`	Set descriptive complexity of solvable functions. Comput. Olivier Bournez, Riccardo Gozzi
2025	J	`jnl`	Simulation of Turing machines with analytic discrete ODEs: Polynomial-time and space over the reals characterised with discrete ordinary differential equations. J. Log. Anal. Manon Blanc, Olivier Bournez
2025	—	`conf`	The Domino Problem Is Decidable for Robust Tilesets. UCNC Nathalie Aubrun, Manon Blanc, Olivier Bournez
2024	B	`conf`	Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision. CSL Manon Blanc, Olivier Bournez
2024	J	`jnl`	Set Descriptive Complexity of Solvable Functions. CoRR Riccardo Gozzi, Olivier Bournez
2024	J	`jnl`	Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations. CoRR Olivier Bournez, Riccardo Gozzi
2024	A	`conf`	Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. STACS Olivier Bournez, Riccardo Gozzi
2024	A*	`conf`	The Complexity of Computing in Continuous Time: Space Complexity Is Precision. ICALP Manon Blanc, Olivier Bournez
2024	J	`jnl`	The complexity of computing in continuous time: space complexity is precision. CoRR Manon Blanc, Olivier Bournez
2024	J	`jnl`	The domino problem is decidable for robust tilesets. CoRR Nathalie Aubrun, Manon Blanc, Olivier Bournez
2023	B	`conf`	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 Manon Blanc, Olivier Bournez
2023	J	`jnl`	A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Comput. Complex. Olivier Bournez, Arnaud Durand
2023	J	`jnl`	A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly
2023	J	`jnl`	Measuring robustness of dynamical systems. Relating time and space to length and precision. CoRR Manon Blanc, Olivier Bournez
2023	—	`ed.`	Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings RP Olivier Bournez, Enrico Formenti, Igor Potapov
2023	J	`jnl`	Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations. CoRR Manon Blanc, Olivier Bournez
2022	C	`conf`	A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. MCU Manon Blanc, Olivier Bournez
2022	J	`jnl`	A characterization of functions over the integers computable in polynomial time using discrete differential equations. CoRR Olivier Bournez, Arnaud Durand
2022	J	`jnl`	A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations. CoRR Manon Blanc, Olivier Bournez
2022	J	`jnl`	Polynomial time computable functions over the reals characterized using discrete ordinary differential equations. CoRR Manon Blanc, Olivier Bournez
2022	C	`conf`	Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language. CiE Olivier Bournez
2020	J	`jnl`	A Universal Ordinary Differential Equation. Log. Methods Comput. Sci. Olivier Bournez, Amaury Pouly
2020	A	`conf`	Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). STACS Olivier Bournez
2020	—	`ch.`	Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison
2020	—	`ch.`	Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison
2019	B	`conf`	Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. MFCS Olivier Bournez, Arnaud Durand
2018	J	`jnl`	A Survey on Analog Models of Computation. CoRR Olivier Bournez, Amaury Pouly
2018	Misc	`conf`	Cheap Non-Standard Analysis and Computability: Some Applications. SYNASC Olivier Bournez, Sabrina Ouazzani
2018	J	`jnl`	Cheap Non-standard Analysis and Computability. CoRR Olivier Bournez, Sabrina Ouazzani
2018	J	`jnl`	Homonym Population Protocols. Theory Comput. Syst. Olivier Bournez, Johanne Cohen, Mikaël Rabie
2018	J	`jnl`	On the complexity of bounded time and precision reachability for piecewise affine systems. Theor. Comput. Sci. Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
2018	Misc	`conf`	Ordinary Differential Equations & Computability. SYNASC Olivier Bournez
2018	J	`jnl`	Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov
2018	J	`jnl`	Recursion schemes, discrete differential equations and characterization of polynomial time computation. CoRR Olivier Bournez, Arnaud Durand, Sabrina Ouazzani
2017	A*	`conf`	A Universal Ordinary Differential Equation. ICALP Olivier Bournez, Amaury Pouly
2017	J	`jnl`	A Universal Ordinary Differential Equation. CoRR Olivier Bournez, Amaury Pouly
2017	J	`jnl`	On the functions generated by the general purpose analog computer. Inf. Comput. Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2017	J	`jnl`	Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2017	—	`conf`	Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs. CMSB François Fages, Guillaume Le Guludec, Olivier Bournez, Amaury Pouly
2016	J	`jnl`	A Framework for Algebraic Characterizations in Recursive Analysis. CoRR Olivier Bournez, Walid Gomaa, Emmanuel Hainry
2016	C	`conf`	Axiomatizing Analog Algorithms. CiE Olivier Bournez, Nachum Dershowitz, Pierre Néron
2016	J	`jnl`	Axiomatizing Analog Algorithms. CoRR Olivier Bournez, Nachum Dershowitz, Pierre Néron
2016	J	`jnl`	Computing with Polynomial Ordinary Differential Equations. CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Computing with polynomial ordinary differential equations. J. Complex. Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Editorial. Comput. Vasco Brattka, Paola Bonizzoni, Olivier Bournez, Elvira Mayordomo
2016	J	`jnl`	Homonym Population Protocols. CoRR Olivier Bournez, Johanne Cohen, Mikaël Rabie
2016	J	`jnl`	On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. CoRR Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
2016	J	`jnl`	On the Functions Generated by the General Purpose Analog Computer. CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	A*	`conf`	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 Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016	J	`jnl`	Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2015	—	`conf`	Homonym Population Protocols. NETYS Olivier Bournez, Johanne Cohen, Mikaël Rabie
2015	—	`conf`	Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2014	—	`conf`	On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. RP Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
2013	C	`conf`	Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong
2013	J	`jnl`	Computation with perturbed dynamical systems. J. Comput. Syst. Sci. Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
2013	—	`conf`	Population Protocols on Graphs: A Hierarchy. UCNC Olivier Bournez, Jonas Lefèvre
2013	J	`jnl`	Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
2013	A	`conf`	Trustful Population Protocols. DISC Olivier Bournez, Jonas Lefèvre, Mikaël Rabie
2013	C	`conf`	Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012	B	`conf`	Computing with Large Populations Using Interactions. MFCS Olivier Bournez, Pierre Fraigniaud, Xavier Koegler
2012	—	`conf`	Learning Equilibria in Games by Stochastic Distributed Algorithms. ISCIS Olivier Bournez, Johanne Cohen
2012	J	`jnl`	On the complexity of solving initial value problems CoRR Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012	B	`conf`	On the complexity of solving initial value problems. ISSAC Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012	J	`jnl`	Preface. Nat. Comput. Olivier Bournez, Gilles Dowek
2012	C	`conf`	Towards an Axiomatization of Simple Analog Algorithms. TAMC Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich
2012	J	`jnl`	Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR Amaury Pouly, Olivier Bournez, Daniel Silva Graça
2011	J	`jnl`	Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. Int. J. Unconv. Comput. Olivier Bournez, Walid Gomaa, Emmanuel Hainry
2011	J	`jnl`	Asymetric Pavlovian Populations CoRR Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
2011	B	`conf`	Computing with Pavlovian Populations. OPODIS Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
2011	J	`jnl`	On the number of binary-minded individuals required to compute sqrt(1/2). Theor. Comput. Sci. Guillaume Aupy, Olivier Bournez
2011	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Olivier Bournez, Igor Potapov
2011	B	`conf`	Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2010	B	`conf`	Robust Computations with Dynamical Systems. MFCS Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
2009	J	`jnl`	A Survey on Continuous Time Computations CoRR Olivier Bournez, Manuel Lameiras Campagnolo
2009	—	`conf`	A dynamic approach for load balancing. VALUETOOLS Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen
2009	J	`jnl`	Distributed Learning of Equilibria in a Routing Game. Parallel Process. Lett. Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton
2009	J	`jnl`	Learning Equilibria in Games by Stochastic Distributed Algorithms CoRR Olivier Bournez, Johanne Cohen
2009	J	`jnl`	On the Convergence of Population Protocols When Population Goes to Infinity CoRR Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler
2009	J	`jnl`	On the convergence of population protocols when population goes to infinity. Appl. Math. Comput. Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler
2009	J	`jnl`	Population Protocols that Correspond to Symmetric Games CoRR Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
2009	—	`ed.`	Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings RP Olivier Bournez, Igor Potapov
2009	J	`jnl`	Verification of Timed Automata Using Rewrite Rules and Strategies CoRR Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner
2008	C	`conf`	Distributed Learning of Wardrop Equilibria. UC Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen
2008	—	`conf`	Playing With Population Protocols CSP Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
2007	C	`conf`	On the Computational Capabilities of Several Models. MCU Olivier Bournez, Emmanuel Hainry
2007	J	`jnl`	Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
2006	J	`jnl`	How much can analog and hybrid systems be proved (super-)Turing. Appl. Math. Comput. Olivier Bournez
2006	J	`jnl`	Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2006	—	`book`	Modèles Continus. Calculs. Algorithmique Distribuée. (Continuous Models. Computations. Distributed Algorithms). Olivier Bournez
2006	—	`conf`	Proving Positive Almost Sure Termination Under Strategies. RTA Olivier Bournez, Florent Garnier
2006	J	`jnl`	Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Informaticae Olivier Bournez, Emmanuel Hainry
2006	C	`conf`	The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
2005	J	`jnl`	Elementarily computable functions over the real numbers and R-sub-recursive functions. Theor. Comput. Sci. Olivier Bournez, Emmanuel Hainry
2005	—	`conf`	From Chemical Rules to Term Rewriting. RULE@RDP Olivier Bournez, Liliana Ibanescu, Hélène Kirchner
2005	J	`jnl`	Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2005	—	`conf`	Proving Positive Almost-Sure Termination. RTA Olivier Bournez, Florent Garnier
2004	A*	`conf`	An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP Olivier Bournez, Emmanuel Hainry
2004	C	`conf`	Real Recursive Functions and Real Extensions of Recursive Functions. MCU Olivier Bournez, Emmanuel Hainry
2004	—	`conf`	Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003	—	`conf`	A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms. RTA Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu
2003	Misc	`conf`	Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. International Conference on Computational Science Olivier Bournez, Guy-Marie Côme, Valérie Conraud, Hélène Kirchner, Liliana Ibanescu
2003	B	`conf`	Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003	—	`conf`	Rewriting Logic and Probabilities. RTA Olivier Bournez, Mathieu Hoyrup
2003	—	`conf`	Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. ICC@LICS Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2002	—	`conf`	A Generalization of Equational Proof Theory? PAPM-PROBMIV Olivier Bournez
2002	—	`conf`	Probabilistic Rewrite Strategies. Applications to ELAN. RTA Olivier Bournez, Claude Kirchner
2002	J	`jnl`	The Mortality Problem for Matrices of Low Dimensions. Theory Comput. Syst. Olivier Bournez, Michael S. Branicky
2001	J	`jnl`	Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis
2001	J	`jnl`	The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
2001	J	`jnl`	Verification of Timed Automata Using Rewrite Rules and Strategies CoRR Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner
2000	—	`conf`	Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. HSCC Eugene Asarin, Thao Dang, Oded Maler, Olivier Bournez
2000	J	`jnl`	Effective synthesis of switching controllers for linear systems. Proc. IEEE Eugene Asarin, Olivier Bournez, Thao Dang, Oded Maler, Amir Pnueli
2000	A*	`conf`	On the Representation of Timed Polyhedra. ICALP Olivier Bournez, Oded Maler
2000	A	`conf`	The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
1999	J	`jnl`	Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. Theor. Comput. Sci. Olivier Bournez
1999	—	`conf`	Orthogonal Polyhedra: Representation and Computation. HSCC Olivier Bournez, Oded Maler, Amir Pnueli
1999	J	`jnl`	Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. Theory Comput. Syst. Olivier Bournez
1998	J	`jnl`	Using Local Planar Geometric Invariants to Match and Model Images of Line Segments. Comput. Vis. Image Underst. Patrick Gros, Olivier Bournez, Edmond Boyer
1997	A*	`conf`	Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). ICALP Olivier Bournez
1996	J	`jnl`	On the Computational Power of Dynamical Systems and Hybrid Systems. Theor. Comput. Sci. Olivier Bournez, Michel Cosnard