Follow
olivier bournez
olivier bournez
Professor of Computer Science, Ecole Polytechnique, France
Verified email at lix.polytechnique.fr - Homepage
Title
Cited by
Cited by
Year
Approximate reachability analysis of piecewise-linear dynamical systems
E Asarin, O Bournez, T Dang, O Maler
International workshop on hybrid systems: Computation and control, 20-31, 2000
5022000
Effective synthesis of switching controllers for linear systems
E Asarin, O Bournez, T Dang, O Maler, A Pnueli
Proceedings of the IEEE 88 (7), 1011-1025, 2000
3162000
Orthogonal polyhedra: Representation and computation
O Bournez, O Maler, A Pnueli
Hybrid Systems: Computation and Control: Second International Workshop, HSCC …, 1999
1551999
New Computational Paradigms. Changing Conceptions of What is Computable, chapter A Survey on Continuous Time Computations
O Bournez, ML Campagnolo
Springer-Verlag, New York, 2008
124*2008
Polynomial differential equations compute all real computable functions on computable compact intervals
O Bournez, ML Campagnolo, DS Graça, E Hainry
Journal of Complexity 23 (3), 317-335, 2007
1102007
Proving positive almost-sure termination
O Bournez, F Garnier
International Conference on Rewriting Techniques and Applications, 323-337, 2005
1042005
Deciding stability and mortality of piecewise affine dynamical systems
VD Blondel, O Bournez, P Koiran, CH Papadimitriou, JN Tsitsiklis
Theoretical computer science 255 (1-2), 687-696, 2001
922001
Strong turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs
F Fages, G Le Guludec, O Bournez, A Pouly
Computational Methods in Systems Biology: 15th International Conference …, 2017
792017
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
O Bournez
Theoretical Computer Science 210 (1), 21-71, 1999
781999
On the computational power of dynamical systems and hybrid systems
O Bournez, M Cosnard
Theoretical Computer Science 168 (2), 417-459, 1996
781996
The stability of saturated linear dynamical systems is undecidable
VD Blondel, O Bournez, P Koiran, JN Tsitsiklis
Journal of Computer and System Sciences 62 (3), 442-462, 2001
682001
The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation
O Bournez, ML Campagnolo, DS Graça, E Hainry
International Conference on Theory and Applications of Models of Computation …, 2006
672006
Probabilistic rewrite strategies. Applications to ELAN
O Bournez, C Kirchner
International Conference on Rewriting Techniques and Applications, 252-266, 2002
652002
Using local planar geometric invariants to match and model images of line segments
P Gros, O Bournez, E Boyer
Computer Vision and Image Understanding 69 (2), 135-155, 1998
57*1998
Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length
O Bournez, DS Graça, A Pouly
Journal of the ACM (JACM) 64 (6), 1-76, 2017
522017
The mortality problem for matrices of low dimensions
O Bournez, M Branicky
Theory of Computing Systems 35, 433-448, 2002
492002
A survey on analog models of computation
O Bournez, A Pouly
Handbook of Computability and Complexity in Analysis, 173-226, 2021
442021
Rewriting logic and probabilities
O Bournez, M Hoyrup
Rewriting Techniques and Applications: 14th International Conference, RTA …, 2003
432003
Elementarily computable functions over the real numbers and R-sub-recursive functions
O Bournez, E Hainry
Theoretical Computer Science 348 (2-3), 130-147, 2005
402005
Recursive analysis characterized as a class of real recursive functions
O Bournez, E Hainry
Fundamenta Informaticae 74 (4), 409-434, 2006
382006
The system can't perform the operation now. Try again later.
Articles 1–20