Search the dblp DataBase
Olivier Bournez :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Olivier Bournez , Felipe Cucker , Paulin Jacobé de Naurois , Jean-Yves Marion Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2003, pp:185-199 [Conf ] Eugene Asarin , Thao Dang , Oded Maler , Olivier Bournez Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. [Citation Graph (0, 0)][DBLP ] HSCC, 2000, pp:20-31 [Conf ] Olivier Bournez , Oded Maler , Amir Pnueli Orthogonal Polyhedra: Representation and Computation. [Citation Graph (0, 0)][DBLP ] HSCC, 1999, pp:46-60 [Conf ] Olivier Bournez Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:143-153 [Conf ] Olivier Bournez , Emmanuel Hainry An Analog Characterization of Elementarily Computable Functions over the Real Numbers. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:269-280 [Conf ] Olivier Bournez , Oded Maler On the Representation of Timed Polyhedra. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:793-807 [Conf ] Olivier Bournez , Guy-Marie Côme , Valérie Conraud , Hélène Kirchner , Liliana Ibanescu Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science, 2003, pp:367-376 [Conf ] Olivier Bournez , Felipe Cucker , Paulin Jacobé de Naurois , Jean-Yves Marion Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2004, pp:409-422 [Conf ] Olivier Bournez , Emmanuel Hainry Real Recursive Functions and Real Extensions of Recursive Functions. [Citation Graph (0, 0)][DBLP ] MCU, 2004, pp:116-127 [Conf ] Olivier Bournez A Generalization of Equational Proof Theory? [Citation Graph (0, 0)][DBLP ] PAPM-PROBMIV, 2002, pp:207-208 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:30-45 [Conf ] Olivier Bournez , Florent Garnier Proving Positive Almost-Sure Termination. [Citation Graph (0, 0)][DBLP ] RTA, 2005, pp:323-337 [Conf ] Olivier Bournez , Florent Garnier Proving Positive Almost Sure Termination Under Strategies. [Citation Graph (0, 0)][DBLP ] RTA, 2006, pp:357-371 [Conf ] Olivier Bournez , Mathieu Hoyrup Rewriting Logic and Probabilities. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:61-75 [Conf ] Olivier Bournez , Claude Kirchner Probabilistic Rewrite Strategies. Applications to ELAN. [Citation Graph (0, 0)][DBLP ] RTA, 2002, pp:252-266 [Conf ] Vincent D. Blondel , Olivier Bournez , Pascal Koiran , John N. Tsitsiklis The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:479-490 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] TAMC, 2006, pp:631-643 [Conf ] Emmanuel Beffara , Olivier Bournez , Hassen Kacem , Claude Kirchner Verification of Timed Automata Using Rewrite Rules and Strategies [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Patrick Gros , Olivier Bournez , Edmond Boyer Using Local Planar Geometric Invariants to Match and Model Images of Line Segments. [Citation Graph (0, 0)][DBLP ] Computer Vision and Image Understanding, 1998, v:69, n:2, pp:135-155 [Journal ] Olivier Bournez , Felipe Cucker , Paulin Jacobé de Naurois , Jean-Yves Marion Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2003, v:90, n:1, pp:- [Journal ] Olivier Bournez , Liliana Ibanescu , Hélène Kirchner From Chemical Rules to Term Rewriting. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:147, n:1, pp:113-134 [Journal ] Olivier Bournez , Emmanuel Hainry Recursive Analysis Characterized as a Class of Real Recursive Functions. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2006, v:74, n:4, pp:409-433 [Journal ] Olivier Bournez , Felipe Cucker , Paulin Jacobé de Naurois , Jean-Yves Marion Implicit complexity over an arbitrary structure: Quantifier alternations. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2006, v:204, n:2, pp:210-230 [Journal ] Vincent D. Blondel , Olivier Bournez , Pascal Koiran , John N. Tsitsiklis The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2001, v:62, n:3, pp:442-462 [Journal ] Olivier Bournez , Felipe Cucker , Paulin Jacobé de Naurois , Jean-Yves Marion Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 2005, v:15, n:1, pp:41-58 [Journal ] Olivier Bournez Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1999, v:32, n:1, pp:35-67 [Journal ] Olivier Bournez , Michael S. Branicky The Mortality Problem for Matrices of Low Dimensions. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2002, v:35, n:4, pp:433-448 [Journal ] Vincent D. Blondel , Olivier Bournez , Pascal Koiran , Christos H. Papadimitriou , John N. Tsitsiklis Deciding stability and mortality of piecewise affine dynamical systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:687-696 [Journal ] Olivier Bournez Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:210, n:1, pp:21-71 [Journal ] Olivier Bournez , Michel Cosnard On the Computational Power of Dynamical Systems and Hybrid Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:168, n:2, pp:417-459 [Journal ] Olivier Bournez , Emmanuel Hainry Elementarily computable functions over the real numbers and R-sub-recursive functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:130-147 [Journal ] Olivier Bournez How much can analog and hybrid systems be proved (super-)Turing. [Citation Graph (0, 0)][DBLP ] Applied Mathematics and Computation, 2006, v:178, n:1, pp:58-71 [Journal ] Olivier Bournez , Emmanuel Hainry On the Computational Capabilities of Several Models. [Citation Graph (0, 0)][DBLP ] MCU, 2007, pp:12-23 [Conf ] Robust Computations with Dynamical Systems. [Citation Graph (, )][DBLP ] Distributed Learning of Wardrop Equilibria. [Citation Graph (, )][DBLP ] Playing With Population Protocols [Citation Graph (, )][DBLP ] Learning Equilibria in Games by Stochastic Distributed Algorithms [Citation Graph (, )][DBLP ] A Survey on Continuous Time Computations [Citation Graph (, )][DBLP ] On the Convergence of Population Protocols When Population Goes to Infinity [Citation Graph (, )][DBLP ] Verification of Timed Automata Using Rewrite Rules and Strategies [Citation Graph (, )][DBLP ] Population Protocols that Correspond to Symmetric Games [Citation Graph (, )][DBLP ] Search in 0.007secs, Finished in 0.009secs