Olivier Bournez

发表

Analog models of computations \& Effective Church Turing Thesis: Efficient simulation of Turing machines by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012 .

Distributed Learning of Wardrop Equilibria

Johanne Cohen, Dominique Barth, Olivier Bournez, 2008, UC.

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

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, ICALP.

Continuous Ordinary Differential Equations and Ordinal Time Turing Machines

Olivier Bournez, 2019 .

Learning Equilibria in Games by Stochastic Distributed Algorithms

Johanne Cohen, Olivier Bournez, Olivier Bournez, 2009, ISCIS.

Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings

Igor Potapov, Olivier Bournez, Rp, 2009, RP.

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2003, Electron. Notes Theor. Comput. Sci..

Computing with Pavlovian Populations

Johanne Cohen, Olivier Bournez, Jérémie Chalopin, 2011, OPODIS.

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2011, MFCS.

A Universal Ordinary Differential Equation pdf

Amaury Pouly, Olivier Bournez, Olivier Bournez, 2017, ICALP.

From Chemical Rules to Term Rewriting

Hélène Kirchner, Liliana Ibanescu, Olivier Bournez, 2005, RULE@RDP.

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions

Walid Gomaa, Olivier Bournez, Emmanuel Hainry, 2011, Int. J. Unconv. Comput..

Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012, TAMC.

Rewriting Logic and Probabilities

Olivier Bournez, Mathieu Hoyrup, Olivier Bournez, 2003, RTA.

Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy

Olivier Bournez, 1999, Theor. Comput. Sci..

On the complexity of bounded time and precision reachability for piecewise affine systems

Walid Gomaa, Amaury Pouly, Olivier Bournez, 2016, Theor. Comput. Sci..

Termination in finite mean time of a CSMA/CA rule-based model

Claude Kirchner, Olivier Bournez, Florent Garnier, 2006 .

Reachability Problems

Walid Gomaa, Amaury Pouly, Olivier Bournez, 2014, Lecture Notes in Computer Science.

A dynamic approach for load balancing

Johanne Cohen, Dominique Barth, Olivier Bournez, 2009, VALUETOOLS.

Verification of Timed Automata Using Rewrite Rules and Strategies pdf

Claude Kirchner, Olivier Bournez, Emmanuel Beffara, 2001, ArXiv.

On the Computational Power of Dynamical Systems and Hybrid Systems

Olivier Bournez, Michel Cosnard, M. Cosnard, 1996, Theor. Comput. Sci..

Proceedings of the 3rd International Workshop on Reachability Problems

Igor Potapov, Olivier Bournez, 2009 .

Proving Positive Almost Sure Termination Under Strategies

Olivier Bournez, Florent Garnier, Olivier Bournez, 2006, RTA.

Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk)

Olivier Bournez, Olivier Bournez, 2020, STACS.

A Survey on Analog Models of Computation pdf

Amaury Pouly, Olivier Bournez, Olivier Bournez, 2018, Theory and Applications of Computability.

How much can analog and hybrid systems be proved (super-)Turing

Olivier Bournez, 2006, Appl. Math. Comput..

A Universal Ordinary Differential Equation

Amaury Pouly, Olivier Bournez, 2020, Log. Methods Comput. Sci..

Cheap Non-Standard Analysis and Computability: Some Applications

Olivier Bournez, Sabrina Ouazzani, 2018, 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

Elementarily computable functions over the real numbers and R-sub-recursive functions

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2005, Theor. Comput. Sci..

Orthogonal Polyhedra: Representation and Computation

Amir Pnueli, Olivier Bournez, Oded Maler, 1999, HSCC.

Computing with Large Populations Using Interactions

Pierre Fraigniaud, Olivier Bournez, Xavier Koegler, 2012, MFCS.

Robust Computations with Dynamical Systems

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry, 2010, MFCS.

Computation with perturbed dynamical systems

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry, 2013, J. Comput. Syst. Sci..

Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems

Olivier Bournez, Eugene Asarin, Oded Maler, 2000, HSCC.

Modèles Continus. Calculs. Algorithmique Distribuée. (Continuous Models. Computations. Distributed Algorithms)

Olivier Bournez, 2006 .

On the complexity of solving initial value problems

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012, ISSAC.

Analog models of computations

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2012 .

Playing With Population Protocols

Johanne Cohen, Olivier Bournez, Jérémie Chalopin, 2008, CSP.

Probabilistic Rewrite Strategies. Applications to ELAN

Claude Kirchner, Olivier Bournez, C. Kirchner, 2002, RTA.

An Analog Characterization of Elementarily Computable Functions over the Real Numbers

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2004, ICALP.

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems

Walid Gomaa, Amaury Pouly, Olivier Bournez, 2014, RP.

Continuous Ordinary Differential Equations and Infinite Time Turing Machines pdf

Olivier Bournez, Sabrina Ouazzani, 2019, ArXiv.

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2003, FoSSaCS.

Computing with Polynomial Ordinary Differential Equations pdf

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, J. Complex..

Towards an Axiomatization of Simple Analog Algorithms

Nachum Dershowitz, Olivier Bournez, Evgenia Falkovich, 2012, TAMC.

The Stability of Saturated Linear Dynamical Systems Is Undecidable

John N. Tsitsiklis, Vincent D. Blondel, Olivier Bournez, 2000, J. Comput. Syst. Sci..

On the Representation of Timed Polyhedra

Olivier Bournez, Oded Maler, 2000, ICALP.

Using Local Planar Geometric Invariants to Match and Model Images of Line Segments

Patrick Gros, Olivier Bournez, Edmond Boyer, 1998, Comput. Vis. Image Underst..

Recursive Analysis Characterized as a Class of Real Recursive Functions

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2006, Fundam. Informaticae.

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems

Amaury Pouly, Olivier Bournez, Ning Zhong, 2013, CiE.

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation

Olivier Bournez, Daniel S. Graça, Manuel Lameiras Campagnolo, 2006, TAMC.

Reachability Problems for One-Dimensional Piecewise Affine Maps

Igor Potapov, Olivier Bournez, Oleksiy Kurganskyy, 2018, Int. J. Found. Comput. Sci..

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2004, IFIP TCS.

Recursion schemes, discrete differential equations and characterization of polynomial time computation

Olivier Bournez, Arnaud Durand, Sabrina Ouazzani, 2018, ArXiv.

Population Protocols that Correspond to Symmetric

Johanne Cohen, Olivier Bournez, Xavier Koegler, 2009 .

Homonym Population Protocols

Johanne Cohen, Olivier Bournez, Mikaël Rabie, 2017, Theory of Computing Systems.

Implicit complexity over an arbitrary structure: Quantifier alternations

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2006, Inf. Comput..

Real Recursive Functions and Real Extensions of Recursive Functions

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2004, MCU.

A Generalization of Equational Proof Theory?

Olivier Bournez, Olivier Bournez, 2002, PAPM-PROBMIV.

On the Functions Generated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, Inf. Comput..

On the Convergence of Population Protocols When Population Goes to Infinity pdf

Johanne Cohen, Olivier Bournez, Philippe Chassaing, 2009, Appl. Math. Comput..

Proving Positive Almost-Sure Termination

Olivier Bournez, Florent Garnier, Olivier Bournez, 2005, RTA.

Axiomatizing Analog Algorithms

Nachum Dershowitz, Olivier Bournez, Pierre Néron, 2016, CiE.

Cheap Non-standard Analysis and Computability pdf

Olivier Bournez, Sabrina Ouazzani, 2018, ArXiv.

Deciding stability and mortality of piecewise affine dynamical systems

John N. Tsitsiklis, Vincent D. Blondel, Christos H. Papadimitriou, 2001, Theor. Comput. Sci..

The Stability of Saturated Linear Dynamical Systems Is Undecidable

John N. Tsitsiklis, Vincent D. Blondel, Olivier Bournez, 2001, J. Comput. Syst. Sci..

The Mortality Problem for Matrices of Low Dimensions

Olivier Bournez, Michael S. Branicky, 2002, Theory of Computing Systems.

Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2015, MACIS.

A Survey on Continuous Time Computations pdf

Olivier Bournez, Manuel Lameiras Campagnolo, Olivier Bournez, 2009, ArXiv.

Population Protocols that Correspond to Symmetric Games

Johanne Cohen, Olivier Bournez, Mikaël Rabie, 2009, Int. J. Unconv. Comput..

Population Protocols on Graphs: A Hierarchy

Olivier Bournez, Jonas Lefèvre, 2013, UCNC.

Editorial

Paola Bonizzoni, Olivier Bournez, Vasco Brattka, 1978, De Computis.

Asymetric Pavlovian Populations pdf

Johanne Cohen, Olivier Bournez, Jérémie Chalopin, 2011, ArXiv.

New Results - Computability and complexity

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry, 2006 .

Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs

François Fages, Amaury Pouly, Olivier Bournez, 2017, CMSB.

A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms

Hélène Kirchner, Liliana Ibanescu, Olivier Bournez, 2003, RTA.

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems

Olivier Bournez, 1999, Theory of Computing Systems.

Automated Generation of Kinetic Chemical Mechanisms Using Rewriting

Hélène Kirchner, Liliana Ibanescu, Olivier Bournez, 2003, International Conference on Computational Science.

A Framework for Algebraic Characterizations in Recursive Analysis pdf

Walid Gomaa, Olivier Bournez, Emmanuel Hainry, 2016, ArXiv.

Trustful Population Protocols

Olivier Bournez, Mikaël Rabie, Jonas Lefèvre, 2013, DISC.

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract)

Olivier Bournez, 1997, ICALP.

On the number of binary-minded individuals required to compute sqrt(1/2)

Guillaume Aupy, Olivier Bournez, 2011, Theor. Comput. Sci..

Theoretical Computer Science: Computability, Decidability and Logic

Gilles Dowek, Olivier Bournez, Simon Perdrix, 2020, A Guided Tour of Artificial Intelligence Research.

Theoretical Computer Science: Computational Complexity

Gilles Dowek, Olivier Bournez, Simon Perdrix, 2020, A Guided Tour of Artificial Intelligence Research.

Homonym Population Protocols

Johanne Cohen, Olivier Bournez, Mikaël Rabie, 2015, NETYS.

Homonym Population Protocols, or Providing a Small Space of Computation Using a Few Identifiers pdf

Johanne Cohen, Olivier Bournez, Mikaël Rabie, 2014, ArXiv.

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2005, J. Log. Comput..

Ordinary Differential Equations & Computability

Olivier Bournez, Olivier Bournez, 2018, 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC).

Distributed Learning of Equilibria in a Routing Game

Johanne Cohen, Dominique Barth, Olivier Bournez, 2009, Parallel Process. Lett..

Preface

Gilles Dowek, Olivier Bournez, 2011, Natural Computing.

On the computational power and super-Turing capabilities of dynamical systems

Olivier Bournez, Michel Cosnard, 1995 .

On the Computational Capabilities of Several Models

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2007, MCU.

Polynomial differential equations compute all real computable functions on computable compact intervals

Olivier Bournez, Daniel S. Graça, Manuel Lameiras Campagnolo, 2007, J. Complex..

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

Amaury Pouly, Olivier Bournez, Daniel S. Graça, 2016, J. ACM.

Surreal fields stable under exponential and logarithmic functions

Olivier Bournez, Quentin Guilmant, 2022 .

Stochastic Learning of Equilibria in Games : The Ordinary Differential Equation Method

Johanne Cohen, Olivier Bournez, 2009 .

Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time

Olivier Bournez, Jean-Yves Marion, Paulin Jacobé de Naurois, 2002 .

Polynomial dierential equations compute all real computable functions

Olivier Bournez, Daniel S. Graça, Manuel L. Campagnolo, 2006 .