Olivier Bournez

2008

Playing With Population Protocols. (full details)
Bournez, Olivier , Chalopin, J{\'e}r{\'e}mie , Cohen, Johanne and Koegler, Xavier
In The Complexity of a Simple Program. Cork, Irland, December 6-7th. 2008. (PDF) (BibTeX)
Distributed Learning of Wardrop Equilibria. (full details)
Barth, Dominique , Bournez, Olivier , Boussaton, Octave and Cohen, Johanne
In Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28. Volume 5204 of Lecture Notes in Computer Science. Springer, pages 19-32. 2008. (PUBLISHER URL) (PDF) (BibTeX)
On the Convergence of a Population Protocol When Population Goes to Infinity. (full details)
Bournez, Olivier , Chassaing, Philippe , Cohen, Johanne , Gerin, Lucas and Koegler, Xavier
In Physics and Computations, Worshop of Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28. 2008. (PDF) (BibTeX)
Termination in finite mean time of a CSMA/CA Termination in finite mean time of a CSMA/CA rule-based model. (full details)
Bournez, Olivier and Garnier, Florent
Technical report, LORIA/INRIA. 2008. Get it. (BibTeX)
Termination in finite mean time of a CSMA/CA Termination in finite mean time of a CSMA/CA rule-based model. (full details)
Bournez, Olivier and Garnier, Florent
Technical report, LORIA/INRIA. 2008. Get it. (BibTeX)
A Dynamical Approach for Load Balancing. (full details)
Barth, Dominique , Bournez, Olivier , Boussaton, Octave and Cohen, Johanne
Technical report, LORIA/INRIA. 2008. (PDF) (BibTeX)
A Survey on Continuous Time Computations. (full details)
Bournez, Olivier and Campagnolo, Manuel L.
In New Computational Paradigms. Changing Conceptions of What is Computable. (Cooper, S.B. and L{\"o}we, B. and Sorbi, A., Eds.). New York, Springer-Verlag, pages 383-423. 2008. (PDF) (BibTeX)

2007

Polynomial differential equations compute all real computable functions on computable compact intervals. (full details)
Bournez, Olivier , Campagnolo, Manuel L. , Gra{\c c}a, Daniel S. and Hainry, Emmanuel
Journal of Complexity, 23(3):317-335. 2007. (PUBLISHER URL) (PDF) (BibTeX)
On the Computational Capabilities of Several Models. (full details)
Bournez, Olivier and Hainry, Emmanuel
In Machines, Computations and Universality (MCU'2007). September 10-13. Volume 4664 of Lecture Notes in Computer Science. Springer. 2007. (PDF) (BibTeX)
Convergences et dynamiques du routage dans les r\'eseaux. (full details)
Barth, D. , Bournez, O. , Boussaton, O. and Cohen, J.
In Journ{\'e}es P{\^o}le ResCom. September. 2007. (BibTeX)

2006

Existence of a Nash Equilibria in a pricing game adapted to BGP. (full details)
Sylvie Dela{\"e}t, Dominique Barth, Olivier Bournez Johanne Cohen Loubna Echabbi
Technical report, LRI. 2006. Get it. (BibTeX)
Implicit Complexity over an Arbitrary Structure: Quantifier Alternations. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
Information and Computation, 202(2):210-230. 2006. (PUBLISHER URL) (PDF) (BibTeX)
Recursive Analysis Characterized as a Class of Real Recursive Functions. (full details)
Bournez, Olivier and Hainry, Emmanuel
Fundamenta Informaticae, 74(4):409-433. 2006. (PDF) (BibTeX)
How much can analog and hybrid systems be proved (super-)Turing. (full details)
Bournez, Olivier
Applied Mathematics and Computation, 178(1):58-71. 2006. (PDF) (BibTeX)
Proving Positive Almost Sure Termination Under Strategies. (full details)
Bournez, Olivier and Garnier, Florent
In 17th International Conference on Rewriting Techniques and Applications (RTA'2006). Seattle, WA, USA. (Pfenning, Frank, Eds.) Volume 4098 of Lecture Notes in Computer Science. Springer, pages 357-371. 2006. (PDF) (BibTeX)
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. (full details)
Bournez, Olivier , Campagnolo, Manuel L. , Gra{\c c}a, Daniel S. and Hainry, Emmanuel
In Theory and Applications of Models of Computation, Third International Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings. (Cai, {Jin-yi} and Cooper, S. Barry and Li, Angsheng, Eds.) Volume 3959 of Lecture Notes in Computer Science. Springer, pages 631-643. 2006. (PUBLISHER URL) (PDF) (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 2. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Annexe {A}. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 3. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 1. {H}abilitation {\`a} Diriger les Recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 4. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Habilitation Diriger les Recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. R{\'e}sum{\'e} et T{\'e}l{\'e}chargement. Abstract and Download. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 5. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)

2005

Termination in finite mean time of a CSMA/CA rule-based model. (full details)
Bournez, Olivier , Garnier, Florent and Kirchner, Claude
Technical report, LORIA, Nancy. 2005. Get it. (BibTeX)
Symbolic Simulation and Formal Verification of Updatable Timed Automata. (full details)
Bournez, Olivier , Soussan, Terence , Tavernier, Bertr and
Technical report, LORIA. 2005. Get it. (BibTeX)
Logical Characterizations of $P_\mathcalK$ and $NP_\mathcalK$ Over an Arbitrary Structure $K$. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In 3rd APPSEM II Workshop (APPSEM'05), Frauenchiemsee, Germany, 2005. Also accepted for presentation at \textit{CIE 2005: New Computational Paradigms.}.. 2005. (BibTeX)
Elementarily Computable Functions Over the Real Numbers and $\mathbbR$-Sub-Recursive Functions. (full details)
Bournez, Olivier and Hainry, Emmanuel
Theoretical Computer Science, 348(2--3):130-147. 2005. (PDF) (BibTeX)
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
Journal of Logic and Computation, 15(1):41-58. 2005. (PUBLISHER URL) (PDF) (BibTeX)
Proving Positive Almost Sure Termination. (full details)
Bournez, Olivier and Garnier, Florent
In 16th International Conference on Rewriting Techniques and Applications (RTA'2005). Nara, Japan. Volume 3467 of Lecture Notes in Computer Science. Springer, page 323. 2005. (PDF) (BibTeX)
From Chemical Rules to Term Rewriting. (full details)
Bournez, Olivier , Ibanescu, Liliana and Kirchner, H{\'e}l{\`e}ne
In 6th International Workshop on Rule-Based Programming. Nara, Japan, April. 2005. (BibTeX)

2004

An Analog Characterization of Elementarily Computable Functions Over the Real Numbers. (full details)
Bournez, Olivier and Hainry, Emmanuel
In In 2nd APPSEM II Workshop (APPSEM'04). Tallinn, Estonia, April. 2004. (BibTeX)
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In In 2nd APPSEM II Workshop (APPSEM'04). April. 2004. (BibTeX)
An Analog Characterization of Elementarily Computable Functions Over the Real Numbers. (full details)
Bournez, Olivier and Hainry, Emmanuel
In 31th International Colloquium on Automata Languages and Programming (ICALP'04). Turku, Finland. Volume 3142 of Lecture Notes in Computer Science. Springer, pages 269-280. 2004. (PDF) (BibTeX)
Real Recursive Functions and Real Extentions of Recursive Functions. (full details)
Bournez, Olivier and Hainry, Emmanuel
In Machines, Computations and Universality (MCU'2004). Saint-Petersburg, Russia, September. (Margenstern, Maurice, Eds.) Volume 3354 of Lecture Notes in Computer Science. 2004. (PDF) (BibTeX)
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In 3rd IFIP International Conference on Theoretical Computer Science - TCS'2004. Toulouse, France, august. Kluwer Academic Press. 2004. (PDF) (BibTeX)
Symbolic Simulation and Formal Verification of Updatable Timed Automata using a Rewrite System. (full details)
Bournez, Olivier , Soussan, T{\'e}rence , Tavernier, Bertr and
Technical report, LORIA. 2004. Get it. (BibTeX)

2003

Fuzzy Equational Theories. (full details)
Bournez, Olivier
Technical report, LORIA. 2003. Get it. (BibTeX)
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In Foundations of Software Science and Computational Structures, 6th International Conference (FOSSACS'2003). Warsaw. (Gordon, Andrew D., Eds.) Volume 2620 of Lecture Notes in Computer Science. Springer, pages 185-199. 2003. (BibTeX)
Safe Recursion Over an Arbitrary Structure: PAR, PH and PH. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In Fifth International Worshop on Implicit Computational Complexity - ICC'2003. Ottawa, Canada. (Dawar, Anuj, Eds.) Volume 90 of Electronic Notes in Theoretical Computer Science. 2003. (PDF) (BibTeX)
Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. (full details)
Bournez, Olivier , C{\^o}me, Guy-Marie , Conraud, Val{\'e}rie , Kirchner, H{\'e}l{\`e}ne and Ibanescu, Liliana
In International Conference on Computational Science - ICCS 2003, Melbourne, June 2-4, 2003, Proceedings, Part III. (Sloot, P.M.A. and Abramson, D. and Bogdanov, A.V. and Dongarra, J.J. and Zomaya, A.Y. and Gorbachev, Y.E., Eds.) Volume 2659 of Lecture Notes in Computer Science. Springer, pages 367-376. 2003. (PUBLISHER URL) (PDF) (BibTeX)
The QSL Plateform at LORIA. (full details)
Bournez, Olivier , Habib, Mohamed El , Kirchner, Claude , Kirchner, H{\'e}l{\`e}ne , Marion, Jean-Yves and Merz, Stephan
In First QPQ Workshop on Deductive Software Components. Miami, Florida, July 28, pages 9-12. 2003. (BibTeX)
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.. (full details)
Bournez, Olivier , C{\^o}me, Guy-Marie , Conraud, Val{\'e}rie , Kirchner, H{\'e}l{\`e}ne and Ibanescu, Liliana
In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. June. (Nieuwenhuis, Robert, Eds.) Volume 2706 of Lecture Notes in Computer Science. Springer, pages 30-45. 2003. (PUBLISHER URL) (PDF) (BibTeX)
Rewriting Logic and Probabilities. (full details)
Bournez, Olivier and Hoyrup, Mathieu
In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. June. (Nieuwenhuis, Robert, Eds.) Volume 2706 of Lecture Notes in Computer Science. Springer, pages 61-75. 2003. (PDF) (BibTeX)
Logique de r\'e\'ecriture probabiliste. (full details)
Bournez, Olivier , Hoyrup, Mathieu and Kirchner, Claude
Technical report, LORIA. 2003. Get it. (BibTeX)
Fuzzy Equational Theories. (full details)
Bournez, Olivier
Technical report, LORIA. 2003. (BibTeX)

2002

Safe recursion and calculus over an arbitrary structure. (full details)
Bournez, Olivier , de Naurois, Paulin and Marion, Jean-Yves
In Implicit Computational Complexity - ICC'02. Copenhagen, Denmark, July. 2002. (PDF) (BibTeX)
The Mortality Problem for Matrices of Low Dimensions. (full details)
Bournez, Olivier and Branicky, Michael
Theory of Computing Systems, 35(4):433-448. 2002. (PUBLISHER URL) (PDF) (BibTeX)
A Generalization of Equational Proof Theory? (full details)
Bournez, Olivier
In Process Algebra and Probabilistic Methods : Performance Modeling and Verification, 2nd Joint International Workshop. jul # {25--26}. (Hermanns, Holger and Segala, Roberto, Eds.) Volume 2399 of Lecture Notes in Computer Science. Springer-Verlag, pages 208-209. 2002. (PDF) (BibTeX)
Probabilistic rewrite strategies: Applications to ELAN. (full details)
Bournez, Olivier and Kirchner, Claude
In Rewriting Techniques and Applications. jul # {22-24}. (Tison, Sophie, Eds.) Volume 2378 of Lecture Notes in Computer Science. Springer-Verlag, pages 252-266. 2002. (PDF) (BibTeX)

2001

Verification of timed automata using rewrite rules and strategies. (full details)
Beffara, Emmanuel , Bournez, Olivier , Kacem, Hassen and Kirchner, Claude
In Proceedings BISFAI 2001, Seventh Biennial Bar-Ilan International Symposium on the Foundations of Artificial Intelligence. Ramat-Gan, Israel, jun # {25--27,}. (Dershowitz, Nachum and Frank, Ariel, Eds.). 2001. (PDF) (BibTeX)
The stability of saturated linear dynamical systems is undecidable. (full details)
Blondel, Vincent D. , Bournez, Olivier , Koiran, Pascal and Tsitsiklis, John
Journal of Computer and System Science, 62(3):442-462. 2001. (PUBLISHER URL) (PDF) (BibTeX)
Deciding Stability and Mortality of Piecewise Affine Dynamical Systems. (full details)
Blondel, Vincent , Bournez, Olivier , Koiran, Pascal , Papadimitriou, Christos and Tsitsiklis, John
Theoretical Computer Science A, 1--2(255):687-696. 2001. (PUBLISHER URL) (PDF) (BibTeX)
Verification of timed automata using rewrite rules and strategies. (full details)
Beffara, Emmanuel , Bournez, Olivier , Kacem, Hassen and Kirchner, Claude
In Sixth Annual Workshop of the ERCIM Working Group on Constraints. Prague, jun # {18--20,}. 2001. (PDF) (BibTeX)

2000

Approximate reachability analysis of piecewise-linear dynamical systems. (full details)
Asarin, Eugene , Bournez, Olivier , Dang, Thao and Maler, Oded
In {Hybrid Systems\,: Computation and Control (HSCC'00), Pittsburgh (USA)}. March 23-25 2000. Volume 1790 of Lecture Notes in Computer Science. Springer-Verlag, pages 20-31. 2000. (PUBLISHER URL) (PDF) (BibTeX)
Effective Synthesis of Switching Controllers for Linear Systems. (full details)
Asarin, Eugene , Bournez, Olivier , Dang, Thao , Maler, Oded and Pnueli, Amir
Proceedings of the IEEE, Special Issue on `Hybrid Systems'', 88(7):1011-1025. 2000. (PDF) (BibTeX)
The stability of saturated linear dynamical systems is undecidable. (full details)
Blondel, Vincent D. , Bournez, Olivier , Koiran, Pascal and Tsitsiklis, John N.
In {Symposium on Theoretical Aspects of Computer Science (STACS), Lille, France}. Feb. (Tison, Horst Reichel Sophie, Eds.) Volume 1770 of Lecture Notes in Computer Science. Springer-Verlag, pages 479-490. 2000. (PUBLISHER URL) (PDF) (BibTeX)
On the representation of timed polyhedra. (full details)
Bournez, Olivier and Maler, Oded
In International Colloquium on Automata Languages and Programming (ICALP'00). Geneva, Switzerland, {9--15~} # jul. Volume 1853 of Lecture Notes in Computer Science. Springer, pages 793-807. 2000. (PUBLISHER URL) (PDF) (BibTeX)

1999

Orthogonal polyhedra: Representation and Computation. (full details)
Bournez, Olivier , Maler, Oded and Pnueli, Amir
In Hybrid Systems: Computation and Control - HSCC'99. Nijmegen, Pays-Bas, {29--31} # mar. Volume 1569 of Lecture Notes in Computer Science, pages 46-60. 1999. (PUBLISHER URL) (PDF) (BibTeX)
Some bounds on the computational power of Piecewise Constant Derivative systems. (full details)
Bournez, Olivier
Theory of Computing Systems, 32(1):35-67. 1999. (PDF) (BibTeX)
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy. (full details)
Bournez, Olivier
Theoretical Computer Science, 210(1):21-71. 1999. (PDF) (BibTeX)
Complexit\'e Algorithmique des Syst\`emes Dynamiques Continus et Hybrides. (full details)
Bournez, Olivier
PhD Thesis, Ecole Normale Sup{\'e}rieure de Lyon. 18 Janvier. 1999. R{\'e}sum{\'e} et T{\'e}l{\'e}chargement. Abstract and Download. (BibTeX)

1998

On matrix mortality in low dimensions. (full details)
Bournez, Olivier and Branicky, Michael B.
In Open Problems in Mathematical Systems and Control Theory. (Blondel, V. D. and Sontag, E. D. and Vidyasagar, M. and Willems, J. C., Eds.), Springer-Verlag, London, pages 67-70. 1998. (PDF) (BibTeX)
Using Local Planar Geometric invariants to Match and Model Images of Line Segments. (full details)
Gros, Patrick , Bournez, Olivier and Boyer, Edmond
Computer Vision and Image Understanding: CVIU, 69(2):135-155. 1998. (PUBLISHER URL) (PDF) (BibTeX)

1997

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. (full details)
Bournez, O.
In Automata, Languages and Programming, 24th International Colloquium (ICALP'97). Bologne, Italie, {7--11~} # jul. (Degano, Pierpaolo and Gorrieri, Robert and Marchetti-Spaccamela, Alberto, Eds.) Volume 1256 of Lecture Notes in Computer Science. Springer-Verlag, pages 143-153. 1997. (PDF) (BibTeX)

1996

On the computational power of dynamical systems and hybrid systems. (full details)
Bournez, Olivier and Cosnard, Michel
Theoretical Computer Science, 168(2):417-459. 1996. (PUBLISHER URL) (PDF) (BibTeX)

1994

MORSE: A 3D Object Recognition System Based on Geometric Invariants. (full details)
Mundy, J. , Huang, C. , Liu, J. , Hoffman, W. , Forsyth, D. , Rothwell, C. , Zisserman, A. , Utcke, S. and Bournez, O.
In ARPA Image Understanding Workshop. Monterey (CA), USA, {13--16} # nov, pages 1393-1402. 1994. (PDF) (BibTeX)
Page last modified on March 12, 2008, at 04:45 PM