Olivier Bournez

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie: Population Protocols that Correspond to Symmetric Games. IJUC 9(1-2): 5-36 (2013)

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry: Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79(5): 714-724 (2013)

Olivier Bournez, Daniel S. Graça, Amaury Pouly: Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC 2013: 169-180

Olivier Bournez, Gilles Dowek: Preface. Natural Computing 11(1): 1 (2012)

Olivier Bournez, Johanne Cohen: Learning Equilibria in Games by Stochastic Distributed Algorithms. ISCIS 2012: 31-38

Olivier Bournez, Daniel S. Graça, Amaury Pouly: On the complexity of solving initial value problems. ISSAC 2012: 115-121

Olivier Bournez, Pierre Fraigniaud, Xavier Koegler: Computing with Large Populations Using Interactions. MFCS 2012: 234-246

Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich: Towards an Axiomatization of Simple Analog Algorithms. TAMC 2012: 525-536

Olivier Bournez, Daniel S. Graça, Amaury Pouly: On the complexity of solving initial value problems. CoRR abs/1202.4407 (2012)

Amaury Pouly, Olivier Bournez, Daniel S. Graça: Analog models of computations . CoRR abs/1203.4667 (2012)

Olivier Bournez, Igor Potapov: Preface. Int. J. Found. Comput. Sci. 22(4) (2011)

Olivier Bournez, Walid Gomaa, Emmanuel Hainry: Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. IJUC 7(5): 331-351 (2011)

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)

Olivier Bournez, Daniel S. Graça, Amaury Pouly: Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS 2011: 170-181

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie: Computing with Pavlovian Populations. OPODIS 2011: 409-420

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie: Asymetric Pavlovian Populations. CoRR abs/1109.4433 (2011)

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry: Robust Computations with Dynamical Systems. MFCS 2010: 198-208

Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin, Xavier Koegler: On the convergence of population protocols when population goes to infinity. Applied Mathematics and Computation 215(4): 1340-1350 (2009)

Dominique Barth, Johanne Cohen, Olivier Bournez, Octave Boussaton: Distributed Learning of Equilibria in a Routing Game. Parallel Processing Letters 19(2): 189-204 (2009)

Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen: A dynamic approach for load balancing. VALUETOOLS 2009: 60

Olivier Bournez, Igor Potapov (Eds.): 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

Olivier Bournez, Johanne Cohen: Learning Equilibria in Games by Stochastic Distributed Algorithms. CoRR abs/0907.1916 (2009)

Olivier Bournez, Manuel Lameiras Campagnolo: A Survey on Continuous Time Computations. CoRR abs/0907.3117 (2009)

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)

Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner: Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR abs/0907.3123 (2009)

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler: Population Protocols that Correspond to Symmetric Games. CoRR abs/0907.3126 (2009)

Dominique Barth, Olivier Bournez, Octave Boussaton, Johanne Cohen: Distributed Learning of Wardrop Equilibria. UC 2008: 19-32

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler: Playing With Population Protocols. CSP 2008: 3-15

Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry: Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complexity 23(3): 317-335 (2007)

Olivier Bournez, Emmanuel Hainry: On the Computational Capabilities of Several Models. MCU 2007: 12-23

Olivier Bournez: How much can analog and hybrid systems be proved (super-)Turing. Applied Mathematics and Computation 178(1): 58-71 (2006)

Olivier Bournez, Liliana Ibanescu, Hélène Kirchner: From Chemical Rules to Term Rewriting. Electr. Notes Theor. Comput. Sci. 147(1): 113-134 (2006)

Olivier Bournez, Emmanuel Hainry: Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Inform. 74(4): 409-433 (2006)

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)

Olivier Bournez, Florent Garnier: Proving Positive Almost Sure Termination Under Strategies. RTA 2006: 357-371

Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry: The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC 2006: 631-643

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)

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)

Olivier Bournez, Florent Garnier: Proving Positive Almost-Sure Termination. RTA 2005: 323-337

Olivier Bournez, Emmanuel Hainry: An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP 2004: 269-280

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

Olivier Bournez, Emmanuel Hainry: Real Recursive Functions and Real Extensions of Recursive Functions. MCU 2004: 116-127

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electr. Notes Theor. Comput. Sci. 90: 3-14 (2003)

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

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

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

Olivier Bournez, Mathieu Hoyrup: Rewriting Logic and Probabilities. RTA 2003: 61-75

Olivier Bournez, Michael S. Branicky: The Mortality Problem for Matrices of Low Dimensions. Theory Comput. Syst. 35(4): 433-448 (2002)

Olivier Bournez: A Generalization of Equational Proof Theory? PAPM-PROBMIV 2002: 207-208

Olivier Bournez, Claude Kirchner: Probabilistic Rewrite Strategies. Applications to ELAN. RTA 2002: 252-266

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)

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)

Emmanuel Beffara, Olivier Bournez, Hassen Kacem, Claude Kirchner: Verification of Timed Automata Using Rewrite Rules and Strategies. CoRR cs.PL/0109024 (2001)

Eugene Asarin, Thao Dang, Oded Maler, Olivier Bournez: Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. HSCC 2000: 20-31

Olivier Bournez, Oded Maler: On the Representation of Timed Polyhedra. ICALP 2000: 793-807

Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490

Olivier Bournez: Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. Theory Comput. Syst. 32(1): 35-67 (1999)

Olivier Bournez: Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. Theor. Comput. Sci. 210(1): 21-71 (1999)

Olivier Bournez, Oded Maler, Amir Pnueli: Orthogonal Polyhedra: Representation and Computation. HSCC 1999: 46-60

Patrick Gros, Olivier Bournez, Edmond Boyer: Using Local Planar Geometric Invariants to Match and Model Images of Line Segments. Computer Vision and Image Understanding 69(2): 135-155 (1998)

Olivier Bournez: Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). ICALP 1997: 143-153

Olivier Bournez, Michel Cosnard: On the Computational Power of Dynamical Systems and Hybrid Systems. Theor. Comput. Sci. 168(2): 417-459 (1996)