default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Bournez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c51]Manon Blanc, Olivier Bournez:
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision. CSL 2024: 17:1-17:20- [c50]Manon Blanc, Olivier Bournez:
The Complexity of Computing in Continuous Time: Space Complexity Is Precision. ICALP 2024: 129:1-129:22 - [c49]Olivier Bournez, Riccardo Gozzi
:
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. STACS 2024: 20:1-20:19 - [i30]Nathalie Aubrun, Manon Blanc, Olivier Bournez:
The domino problem is decidable for robust tilesets. CoRR abs/2402.04438 (2024) - [i29]Manon Blanc, Olivier Bournez:
The complexity of computing in continuous time: space complexity is precision. CoRR abs/2403.02499 (2024) - [i28]Olivier Bournez, Riccardo Gozzi:
Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations. CoRR abs/2405.00165 (2024) - [i27]Riccardo Gozzi, Olivier Bournez:
Set Descriptive Complexity of Solvable Functions. CoRR abs/2405.19304 (2024) - 2023
- [j32]Olivier Bournez, Arnaud Durand:
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Comput. Complex. 32(2): 7 (2023) - [j31]Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly:
A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. 77: 101755 (2023) - [c48]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: 21:1-21:15 - [e2]Olivier Bournez, Enrico Formenti, Igor Potapov:
Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings. Lecture Notes in Computer Science 14235, Springer 2023, ISBN 978-3-031-45285-7 [contents] - [i26]Manon Blanc, Olivier Bournez:
Measuring robustness of dynamical systems. Relating time and space to length and precision. CoRR abs/2301.12723 (2023) - [i25]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 abs/2307.11747 (2023) - 2022
- [c47]Olivier Bournez:
Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language. CiE 2022: 39-51 - [c46]Manon Blanc, Olivier Bournez:
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations. MCU 2022: 58-74 - [i24]Olivier Bournez, Arnaud Durand:
A characterization of functions over the integers computable in polynomial time using discrete differential equations. CoRR abs/2209.12168 (2022) - [i23]Manon Blanc, Olivier Bournez:
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations. CoRR abs/2209.13404 (2022) - [i22]Manon Blanc, Olivier Bournez:
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations. CoRR abs/2209.13599 (2022) - 2020
- [j30]Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. Log. Methods Comput. Sci. 16(1) (2020) - [c45]Olivier Bournez:
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). STACS 2020: 3:1-3:13 - [p2]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 1-50 - [p1]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 51-89
2010 – 2019
- 2019
- [c44]Olivier Bournez, Arnaud Durand:
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. MFCS 2019: 23:1-23:14 - 2018
- [j29]Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. 29(4): 529-549 (2018) - [j28]Olivier Bournez, Johanne Cohen, Mikaël Rabie:
Homonym Population Protocols. Theory Comput. Syst. 62(5): 1318-1346 (2018) - [j27]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: 132-146 (2018) - [c43]Olivier Bournez:
Ordinary Differential Equations & Computability. SYNASC 2018: 3-5 - [c42]Olivier Bournez, Sabrina Ouazzani:
Cheap Non-Standard Analysis and Computability: Some Applications. SYNASC 2018: 149-156 - [i21]Olivier Bournez, Sabrina Ouazzani:
Cheap Non-standard Analysis and Computability. CoRR abs/1804.09746 (2018) - [i20]Olivier Bournez, Amaury Pouly:
A Survey on Analog Models of Computation. CoRR abs/1805.05729 (2018) - [i19]Olivier Bournez, Arnaud Durand, Sabrina Ouazzani:
Recursion schemes, discrete differential equations and characterization of polynomial time computation. CoRR abs/1810.02241 (2018) - 2017
- [j26]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the functions generated by the general purpose analog computer. Inf. Comput. 257: 34-57 (2017) - [j25]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): 38:1-38:76 (2017) - [c41]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: 108-127 - [c40]Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. ICALP 2017: 116:1-116:14 - [i18]Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. CoRR abs/1702.08328 (2017) - 2016
- [j24]Vasco Brattka, Paola Bonizzoni, Olivier Bournez, Elvira Mayordomo:
Editorial. Comput. 5(1): 1 (2016) - [j23]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Computing with polynomial ordinary differential equations. J. Complex. 36: 106-140 (2016) - [c39]Olivier Bournez, Nachum Dershowitz, Pierre Néron:
Axiomatizing Analog Algorithms. CiE 2016: 215-224 - [c38]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: 109:1-109:15 - [i17]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. CoRR abs/1601.05353 (2016) - [i16]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR abs/1601.05360 (2016) - [i15]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Computing with Polynomial Ordinary Differential Equations. CoRR abs/1601.05683 (2016) - [i14]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the Functions Generated by the General Purpose Analog Computer. CoRR abs/1602.00546 (2016) - [i13]Olivier Bournez, Johanne Cohen, Mikaël Rabie:
Homonym Population Protocols. CoRR abs/1602.03540 (2016) - [i12]Olivier Bournez, Nachum Dershowitz, Pierre Néron:
Axiomatizing Analog Algorithms. CoRR abs/1604.04295 (2016) - [i11]Olivier Bournez, Walid Gomaa, Emmanuel Hainry:
A Framework for Algebraic Characterizations in Recursive Analysis. CoRR abs/1609.07972 (2016) - [i10]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR abs/1609.08059 (2016) - 2015
- [c37]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS 2015: 469-473 - [c36]Olivier Bournez, Johanne Cohen, Mikaël Rabie:
Homonym Population Protocols. NETYS 2015: 125-139 - 2014
- [c35]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. RP 2014: 20-31 - 2013
- [j22]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): 5-36 (2013) - [j21]Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry:
Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79(5): 714-724 (2013) - [c34]Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong:
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE 2013: 12-21 - [c33]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC 2013: 169-180 - [c32]Olivier Bournez, Jonas Lefèvre:
Population Protocols on Graphs: A Hierarchy. UCNC 2013: 31-42 - [c31]Olivier Bournez, Jonas Lefèvre, Mikaël Rabie:
Trustful Population Protocols. DISC 2013: 447-461 - 2012
- [j20]Olivier Bournez, Gilles Dowek:
Preface. Nat. Comput. 11(1): 1 (2012) - [c30]Olivier Bournez, Johanne Cohen:
Learning Equilibria in Games by Stochastic Distributed Algorithms. ISCIS 2012: 31-38 - [c29]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the complexity of solving initial value problems. ISSAC 2012: 115-121 - [c28]Olivier Bournez, Pierre Fraigniaud, Xavier Koegler:
Computing with Large Populations Using Interactions. MFCS 2012: 234-246 - [c27]Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich:
Towards an Axiomatization of Simple Analog Algorithms. TAMC 2012: 525-536 - [i9]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the complexity of solving initial value problems. CoRR abs/1202.4407 (2012) - [i8]Amaury Pouly, Olivier Bournez, Daniel Silva Graça:
Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR abs/1203.4667 (2012) - 2011
- [j19]Olivier Bournez, Igor Potapov:
Preface. Int. J. Found. Comput. Sci. 22(4) (2011) - [j18]Olivier Bournez, Walid Gomaa, Emmanuel Hainry:
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. Int. J. Unconv. Comput. 7(5): 331-351 (2011) - [j17]Guillaume Aupy, Olivier Bournez:
On the number of binary-minded individuals required to compute sqrt(1/2). Theor. Comput. Sci. 412(22): 2262-2267 (2011) - [c26]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS 2011: 170-181 - [c25]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Computing with Pavlovian Populations. OPODIS 2011: 409-420 - [i7]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie:
Asymetric Pavlovian Populations. CoRR abs/1109.4433 (2011) - 2010
- [c24]Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry:
Robust Computations with Dynamical Systems. MFCS 2010: 198-208
2000 – 2009
- 2009
- [j16]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): 1340-1350 (2009) - [j15]Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton:
Distributed Learning of Equilibria in a Routing Game. Parallel Process. Lett. 19(2): 189-204 (2009) - [c23]Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen:
A dynamic approach for load balancing. VALUETOOLS 2009: 60 - [e1]Olivier Bournez, Igor Potapov:
Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings. Lecture Notes in Computer Science 5797, Springer 2009, ISBN 978-3-642-04419-9 [contents] - [i6]Olivier Bournez, Johanne Cohen:
Learning Equilibria in Games by Stochastic Distributed Algorithms. CoRR abs/0907.1916 (2009) - [i5]Olivier Bournez, Manuel Lameiras Campagnolo:
A Survey on Continuous Time Computations. CoRR abs/0907.3117 (2009) - [i4]Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler:
On the Convergence of Population Protocols When Population Goes to Infinity. CoRR abs/0907.3118 (2009) - [i3]Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner:
Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR abs/0907.3123 (2009) - [i2]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler:
Population Protocols that Correspond to Symmetric Games. CoRR abs/0907.3126 (2009) - 2008
- [c22]Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen:
Distributed Learning of Wardrop Equilibria. UC 2008: 19-32 - [c21]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler:
Playing With Population Protocols. CSP 2008: 3-15 - 2007
- [j14]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): 317-335 (2007) - [c20]Olivier Bournez, Emmanuel Hainry:
On the Computational Capabilities of Several Models. MCU 2007: 12-23 - 2006
- [b1]Olivier Bournez:
Modèles Continus. Calculs. Algorithmique Distribuée. (Continuous Models. Computations. Distributed Algorithms). National Polytechnic Institute of Lorraine, Nancy, France, 2006 - [j13]Olivier Bournez:
How much can analog and hybrid systems be proved (super-)Turing. Appl. Math. Comput. 178(1): 58-71 (2006) - [j12]Olivier Bournez, Emmanuel Hainry:
Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Informaticae 74(4): 409-433 (2006) - [j11]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204(2): 210-230 (2006) - [c19]Olivier Bournez, Florent Garnier:
Proving Positive Almost Sure Termination Under Strategies. RTA 2006: 357-371 - [c18]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: 631-643 - 2005
- [j10]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): 41-58 (2005) - [j9]Olivier Bournez, Emmanuel Hainry:
Elementarily computable functions over the real numbers and R-sub-recursive functions. Theor. Comput. Sci. 348(2-3): 130-147 (2005) - [c17]Olivier Bournez, Florent Garnier:
Proving Positive Almost-Sure Termination. RTA 2005: 323-337 - [c16]Olivier Bournez, Liliana Ibanescu, Hélène Kirchner:
From Chemical Rules to Term Rewriting. RULE@RDP 2005: 113-134 - 2004
- [c15]Olivier Bournez, Emmanuel Hainry:
An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP 2004: 269-280 - [c14]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: 409-422 - [c13]Olivier Bournez, Emmanuel Hainry:
Real Recursive Functions and Real Extensions of Recursive Functions. MCU 2004: 116-127 - 2003
- [c12]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS 2003: 185-199 - [c11]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: 367-376 - [c10]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: 30-45 - [c9]Olivier Bournez, Mathieu Hoyrup:
Rewriting Logic and Probabilities. RTA 2003: 61-75 - [c8]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion:
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. ICC@LICS 2003: 3-14 - 2002
- [j8]Olivier Bournez, Michael S. Branicky:
The Mortality Problem for Matrices of Low Dimensions. Theory Comput. Syst. 35(4): 433-448 (2002) - [c7]Olivier Bournez:
A Generalization of Equational Proof Theory? PAPM-PROBMIV 2002: 207-208 - [c6]Olivier Bournez, Claude Kirchner:
Probabilistic Rewrite Strategies. Applications to ELAN. RTA 2002: 252-266 - 2001
- [j7]Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. 62(3): 442-462 (2001) - [j6]Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis:
Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1-2): 687-696 (2001) - [i1]Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner:
Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR cs.PL/0109024 (2001) - 2000
- [j5]Eugene Asarin, Olivier Bournez, Thao Dang, Oded Maler, Amir Pnueli:
Effective synthesis of switching controllers for linear systems. Proc. IEEE 88(7): 1011-1025 (2000) - [c5]Eugene Asarin, Thao Dang, Oded Maler, Olivier Bournez:
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. HSCC 2000: 20-31 - [c4]Olivier Bournez, Oded Maler:
On the Representation of Timed Polyhedra. ICALP 2000: 793-807 - [c3]Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490
1990 – 1999
- 1999
- [j4]Olivier Bournez:
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. Theory Comput. Syst. 32(1): 35-67 (1999) - [j3]Olivier Bournez:
Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. Theor. Comput. Sci. 210(1): 21-71 (1999) - [c2]Olivier Bournez, Oded Maler, Amir Pnueli:
Orthogonal Polyhedra: Representation and Computation. HSCC 1999: 46-60 - 1998
- [j2]Patrick Gros, Olivier Bournez, Edmond Boyer:
Using Local Planar Geometric Invariants to Match and Model Images of Line Segments. Comput. Vis. Image Underst. 69(2): 135-155 (1998) - 1997
- [c1]Olivier Bournez:
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). ICALP 1997: 143-153 - 1996
- [j1]Olivier Bournez, Michel Cosnard:
On the Computational Power of Dynamical Systems and Hybrid Systems. Theor. Comput. Sci. 168(2): 417-459 (1996)
Coauthor Index