| 2008 |
|---|
| 36 | | Olivier Bournez,
Jérémie Chalopin,
Johanne Cohen,
Xavier Koegler:
Playing With Population Protocols.
CSP 2008: 1-14 |
| 35 | EE | Dominique Barth,
Olivier Bournez,
Octave Boussaton,
Johanne Cohen:
Distributed Learning of Wardrop Equilibria.
UC 2008: 19-32 |
| 2007 |
|---|
| 34 | EE | Olivier Bournez,
Emmanuel Hainry:
On the Computational Capabilities of Several Models.
MCU 2007: 12-23 |
| 33 | EE | 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) |
| 2006 |
|---|
| 32 | EE | Olivier Bournez,
Florent Garnier:
Proving Positive Almost Sure Termination Under Strategies.
RTA 2006: 357-371 |
| 31 | EE | 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 |
| 30 | EE | Olivier Bournez:
How much can analog and hybrid systems be proved (super-)Turing.
Applied Mathematics and Computation 178(1): 58-71 (2006) |
| 29 | EE | Olivier Bournez,
Liliana Ibanescu,
Hélène Kirchner:
From Chemical Rules to Term Rewriting.
Electr. Notes Theor. Comput. Sci. 147(1): 113-134 (2006) |
| 28 | EE | Olivier Bournez,
Emmanuel Hainry:
Recursive Analysis Characterized as a Class of Real Recursive Functions.
Fundam. Inform. 74(4): 409-433 (2006) |
| 27 | EE | 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) |
| 2005 |
|---|
| 26 | EE | Olivier Bournez,
Florent Garnier:
Proving Positive Almost-Sure Termination.
RTA 2005: 323-337 |
| 25 | EE | 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) |
| 24 | EE | 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) |
| 2004 |
|---|
| 23 | EE | Olivier Bournez,
Emmanuel Hainry:
An Analog Characterization of Elementarily Computable Functions over the Real Numbers.
ICALP 2004: 269-280 |
| 22 | | 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 |
| 21 | EE | Olivier Bournez,
Emmanuel Hainry:
Real Recursive Functions and Real Extensions of Recursive Functions.
MCU 2004: 116-127 |
| 2003 |
|---|
| 20 | EE | 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 |
| 19 | EE | 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 |
| 18 | EE | 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 |
| 17 | EE | Olivier Bournez,
Mathieu Hoyrup:
Rewriting Logic and Probabilities.
RTA 2003: 61-75 |
| 16 | EE | 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(1): (2003) |
| 2002 |
|---|
| 15 | EE | Olivier Bournez:
A Generalization of Equational Proof Theory?
PAPM-PROBMIV 2002: 207-208 |
| 14 | EE | Olivier Bournez,
Claude Kirchner:
Probabilistic Rewrite Strategies. Applications to ELAN.
RTA 2002: 252-266 |
| 13 | EE | Olivier Bournez,
Michael S. Branicky:
The Mortality Problem for Matrices of Low Dimensions.
Theory Comput. Syst. 35(4): 433-448 (2002) |
| 2001 |
|---|
| 12 | EE | Emmanuel Beffara,
Olivier Bournez,
Hassen Kacem,
Claude Kirchner:
Verification of Timed Automata Using Rewrite Rules and Strategies
CoRR cs.PL/0109024: (2001) |
| 11 | | 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) |
| 10 | EE | 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) |
| 2000 |
|---|
| 9 | EE | Eugene Asarin,
Thao Dang,
Oded Maler,
Olivier Bournez:
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems.
HSCC 2000: 20-31 |
| 8 | EE | Olivier Bournez,
Oded Maler:
On the Representation of Timed Polyhedra.
ICALP 2000: 793-807 |
| 7 | EE | Vincent D. Blondel,
Olivier Bournez,
Pascal Koiran,
John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable.
STACS 2000: 479-490 |
| 1999 |
|---|
| 6 | EE | Olivier Bournez,
Oded Maler,
Amir Pnueli:
Orthogonal Polyhedra: Representation and Computation.
HSCC 1999: 46-60 |
| 5 | EE | Olivier Bournez:
Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy.
Theor. Comput. Sci. 210(1): 21-71 (1999) |
| 4 | EE | Olivier Bournez:
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems.
Theory Comput. Syst. 32(1): 35-67 (1999) |
| 1998 |
|---|
| 3 | EE | 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) |
| 1997 |
|---|
| 2 | | Olivier Bournez:
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract).
ICALP 1997: 143-153 |
| 1996 |
|---|
| 1 | EE | Olivier Bournez,
Michel Cosnard:
On the Computational Power of Dynamical Systems and Hybrid Systems.
Theor. Comput. Sci. 168(2): 417-459 (1996) |
