Olivier Bournez
Main.Publications3 (old fashioned version) / MainPublications3 (more fancy version of it)

Publications3

click here for a more fancy version of same webpage

2008

  1. Olivier Bournez, J{\'e}r{\'e}mie Chalopin, Johanne Cohen and Xavier Koegler. Playing With Population Protocols.
    In The Complexity of a Simple Program. Cork, Irland, December 6-7th.
    (2008) (PDF) (BibTeX)
  2. Dominique Barth, Olivier Bournez, Octave Boussaton and Johanne Cohen. Distributed Learning of Wardrop Equilibria.
    In Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28. Volume 5204 of Lecture Notes in Computer Science. Springer, pages 19-32.
    (2008) (URL) (PDF) (BibTeX)
  3. Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin and Xavier Koegler. On the Convergence of a Population Protocol When Population Goes to Infinity.
    In Physics and Computations, Worshop of Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28.
    (2008) (PDF) (BibTeX)
  4. Olivier Bournez and Florent Garnier. Termination in finite mean time of a CSMA/CA Termination in finite mean time of a CSMA/CA rule-based model.
    Technical report, LORIA/INRIA Submitted.
    (2008) Get it. (BibTeX)
  5. Olivier Bournez and Florent Garnier. Termination in finite mean time of a CSMA/CA Termination in finite mean time of a CSMA/CA rule-based model.
    Technical report, LORIA/INRIA Submitted.
    (2008) Get it. (BibTeX)
  6. Dominique Barth, Olivier Bournez, Octave Boussaton and Johanne Cohen. A Dynamical Approach for Load Balancing.
    Technical report, LORIA/INRIA Submitted. Available on {\tt http://www.lix.polytechnique.fr/\~{}bournez/load/Soumis-Octave-Fev-2008.pdf}.
    (2008) (PDF) (BibTeX)
  7. Olivier Bournez and Manuel L. Campagnolo. A Survey on Continuous Time Computations.
    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

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

2006

  1. Dominique Barth, Olivier Bournez Johanne Cohen Loubna Echabbi Sylvie Dela{\"e}t. Existence of a Nash Equilibria in a pricing game adapted to BGP.
    Technical report, LRI.
    (2006) Get it. (BibTeX)
  2. Olivier Bournez, Felipe Cucker, Paulin Jacob{\'e} de Naurois and Jean-Yves Marion. Implicit Complexity over an Arbitrary Structure: Quantifier Alternations.
    Information and Computation, 202(2):210-230.
    (2006) (URL) (PDF) (BibTeX)
  3. Olivier Bournez and Emmanuel Hainry. Recursive Analysis Characterized as a Class of Real Recursive Functions.
    Fundamenta Informaticae, 74(4):409-433.
    (2006) (PDF) (BibTeX)
  4. Olivier Bournez. How much can analog and hybrid systems be proved (super-)Turing.
    Applied Mathematics and Computation, 178(1):58-71.
    (2006) (PDF) (BibTeX)
  5. Olivier Bournez and Florent Garnier. Proving Positive Almost Sure Termination Under Strategies.
    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)
  6. Olivier Bournez, Manuel L. Campagnolo, Daniel S. Gra{\c c}a and Emmanuel Hainry. The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.
    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) (URL) (PDF) (BibTeX)
  7. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    Chapitre 2. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre.
    (2006) (BibTeX)
  8. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    Annexe {A}. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre.
    (2006) (BibTeX)
  9. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    Chapitre 3. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre.
    (2006) (BibTeX)
  10. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    Chapitre 1. {H}abilitation {\`a} Diriger les Recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre.
    (2006) (BibTeX)
  11. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    Chapitre 4. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre.
    (2006) (BibTeX)
  12. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    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)
  13. Olivier Bournez. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    Chapitre 5. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre.
    (2006) (BibTeX)

2005

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

2004

  1. Olivier Bournez and Emmanuel Hainry. An Analog Characterization of Elementarily Computable Functions Over the Real Numbers.
    In In 2nd APPSEM II Workshop (APPSEM'04). Tallinn, Estonia, April.
    (2004) (BibTeX)
  2. Olivier Bournez, Felipe Cucker, Paulin Jacob{\'e} de Naurois and Jean-Yves Marion. Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures.
    In In 2nd APPSEM II Workshop (APPSEM'04). April.
    (2004) (BibTeX)
  3. Olivier Bournez and Emmanuel Hainry. An Analog Characterization of Elementarily Computable Functions Over the Real Numbers.
    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)
  4. Olivier Bournez and Emmanuel Hainry. Real Recursive Functions and Real Extentions of Recursive Functions.
    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)
  5. Olivier Bournez, Felipe Cucker, Paulin Jacob{\'e} de Naurois and Jean-Yves Marion. Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures.
    In 3rd IFIP International Conference on Theoretical Computer Science - TCS'2004. Toulouse, France, august. Kluwer Academic Press.
    (2004) (PDF) (BibTeX)
  6. Olivier Bournez, T{\'e}rence Soussan, Bertr Tavernier and . Symbolic Simulation and Formal Verification of Updatable Timed Automata using a Rewrite System.
    Technical report, LORIA.
    (2004) Get it. (BibTeX)

2003

  1. Olivier Bournez. Fuzzy Equational Theories.
    Technical report, LORIA.
    (2003) Get it. (BibTeX)
  2. Olivier Bournez, Felipe Cucker, Paulin Jacob{\'e} de Naurois and Jean-Yves Marion. Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time..
    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)
  3. Olivier Bournez, Felipe Cucker, Paulin Jacob{\'e} de Naurois and Jean-Yves Marion. Safe Recursion Over an Arbitrary Structure: PAR, PH and PH.
    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)
  4. Olivier Bournez, Guy-Marie C{\^o}me, Val{\'e}rie Conraud, H{\'e}l{\`e}ne Kirchner and Liliana Ibanescu. Automated Generation of Kinetic Chemical Mechanisms Using Rewriting.
    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) (URL) (PDF) (BibTeX)
  5. Olivier Bournez, Mohamed El Habib, Claude Kirchner, H{\'e}l{\`e}ne Kirchner, Jean-Yves Marion and Stephan Merz. The QSL Plateform at LORIA.
    In First QPQ Workshop on Deductive Software Components. Miami, Florida, July 28, pages 9-12 CADE-19 Workshop, {ftp://ftp.csl.sri.com/pub/users/shankar/QPQ03.pdf}.
    (2003) (BibTeX)
  6. Olivier Bournez, Guy-Marie C{\^o}me, Val{\'e}rie Conraud, H{\'e}l{\`e}ne Kirchner and Liliana Ibanescu. A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms..
    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) (URL) (PDF) (BibTeX)
  7. Olivier Bournez and Mathieu Hoyrup. Rewriting Logic and Probabilities.
    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)
  8. Olivier Bournez, Mathieu Hoyrup and Claude Kirchner. Logique de r\'e\'ecriture probabiliste.
    Technical report, LORIA.
    (2003) Get it. (BibTeX)
  9. Olivier Bournez. Fuzzy Equational Theories.
    Technical report, LORIA.
    (2003) (BibTeX)

2002

  1. Olivier Bournez, Paulin de Naurois and Jean-Yves Marion. Safe recursion and calculus over an arbitrary structure.
    In Implicit Computational Complexity - ICC'02. Copenhagen, Denmark, July.
    (2002) (PDF) (BibTeX)
  2. Olivier Bournez and Michael Branicky. The Mortality Problem for Matrices of Low Dimensions.
    Theory of Computing Systems, 35(4):433-448.
    (2002) (URL) (PDF) (BibTeX)
  3. Olivier Bournez. A Generalization of Equational Proof Theory?
    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)
  4. Olivier Bournez and Claude Kirchner. Probabilistic rewrite strategies: Applications to ELAN.
    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

  1. Emmanuel Beffara, Olivier Bournez, Hassen Kacem and Claude Kirchner. Verification of timed automata using rewrite rules and strategies.
    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)
  2. Vincent D. Blondel, Olivier Bournez, Pascal Koiran and John Tsitsiklis. The stability of saturated linear dynamical systems is undecidable.
    Journal of Computer and System Science, 62(3):442-462.
    (2001) (URL) (PDF) (BibTeX)
  3. Vincent Blondel, Olivier Bournez, Pascal Koiran, Christos Papadimitriou and John Tsitsiklis. Deciding Stability and Mortality of Piecewise Affine Dynamical Systems.
    Theoretical Computer Science A, 1--2(255):687-696.
    (2001) (URL) (PDF) (BibTeX)
  4. Emmanuel Beffara, Olivier Bournez, Hassen Kacem and Claude Kirchner. Verification of timed automata using rewrite rules and strategies.
    In Sixth Annual Workshop of the ERCIM Working Group on Constraints. Prague, jun # {18--20,}.
    (2001) (PDF) (BibTeX)

2000

  1. Eugene Asarin, Olivier Bournez, Thao Dang and Oded Maler. Approximate reachability analysis of piecewise-linear dynamical systems.
    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) (URL) (PDF) (BibTeX)
  2. Eugene Asarin, Olivier Bournez, Thao Dang, Oded Maler and Amir Pnueli. Effective Synthesis of Switching Controllers for Linear Systems.
    Proceedings of the IEEE, Special Issue on `Hybrid Systems'', 88(7):1011-1025.
    (2000) (PDF) (BibTeX)
  3. Vincent D. Blondel, Olivier Bournez, Pascal Koiran and John N. Tsitsiklis. The stability of saturated linear dynamical systems is undecidable.
    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) (URL) (PDF) (BibTeX)
  4. Olivier Bournez and Oded Maler. On the representation of timed polyhedra.
    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) (URL) (PDF) (BibTeX)

1999

  1. Olivier Bournez, Oded Maler and Amir Pnueli. Orthogonal polyhedra: Representation and Computation.
    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) (URL) (PDF) (BibTeX)
  2. Olivier Bournez. Some bounds on the computational power of Piecewise Constant Derivative systems.
    Theory of Computing Systems, 32(1):35-67.
    (1999) (PDF) (BibTeX)
  3. Olivier Bournez. Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy.
    Theoretical Computer Science, 210(1):21-71.
    (1999) (PDF) (BibTeX)
  4. Olivier Bournez. Complexit\'e Algorithmique des Syst\`emes Dynamiques Continus et Hybrides.
    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

  1. Olivier Bournez and Michael B. Branicky. On matrix mortality in low dimensions.
    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)
  2. Patrick Gros, Olivier Bournez and Edmond Boyer. Using Local Planar Geometric invariants to Match and Model Images of Line Segments.
    Computer Vision and Image Understanding: CVIU, 69(2):135-155.
    (1998) (URL) (PDF) (BibTeX)

1997

  1. O. Bournez. Some Bounds on the Computational Power of Piecewise Constant Derivative Systems.
    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

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

1994

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