Travelled to:
1 × Denmark
1 × Finland
1 × Italy
1 × Japan
1 × Poland
1 × Spain
1 × Switzerland
1 × USA
Collaborated with:
F.Garnier E.Hainry M.Hoyrup C.Kirchner O.Maler ∅ F.Cucker P.J.d.Naurois J.Marion G.Côme V.Conraud H.Kirchner L.Ibanescu
Talks about:
comput (3) strategi (2) termin (2) rewrit (2) almost (2) prove (2) posit (2) time (2) sure (2) elementarili (1)
Person: Olivier Bournez
DBLP: Bournez:Olivier
Contributed to:
Wrote 9 papers:
- RTA-2006-BournezG #proving #termination
- Proving Positive Almost Sure Termination Under Strategies (OB, FG), pp. 357–371.
- RTA-2005-BournezG #proving #termination
- Proving Positive Almost-Sure Termination (OB, FG), pp. 323–337.
- ICALP-2004-BournezH
- An Analog Characterization of Elementarily Computable Functions over the Real Numbers (OB, EH), pp. 269–280.
- FoSSaCS-2003-BournezCNM #parallel #polynomial
- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time (OB, FC, PJdN, JYM), pp. 185–199.
- RTA-2003-BournezCCKI #approach #automation #generative #rule-based
- A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms (OB, GMC, VC, HK, LI), pp. 30–45.
- RTA-2003-BournezH #logic
- Rewriting Logic and Probabilities (OB, MH), pp. 61–75.
- RTA-2002-BournezK #probability
- Probabilistic Rewrite Strategies. Applications to ELAN (OB, CK), pp. 252–266.
- ICALP-2000-BournezM #on the #representation
- On the Representation of Timed Polyhedra (OB, OM), pp. 793–807.
- ICALP-1997-Bournez #bound #constant #power of
- Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (OB), pp. 143–153.