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

 #Olivier Bournez, J\'er\'emie Chalopin, Johanne Cohen and Xavier Koegler.   Playing With Population Protocols.
 In Proceedings International Workshop on The Complexity of Simple Programs, {CSP} 2008, Cork, Ireland, 6-7th December 2008. Cork, Irland, December 6-7th. (Turlough Neary, Damien Woods, Anthony Karel Seda and Niall Murphy, Eds.) Pages 3-15.  (BibTeX)
  1. Barth, Dominique, Bournez, Olivier, Boussaton, Octave and Cohen, Johanne. Distributed Learning of Wardrop Equilibria.
    In Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28. Springer, pages 19-32. (BibTeX)
  2. Bournez, Olivier, Chassaing, Philippe, Cohen, Johanne, Gerin, Lucas and Koegler, Xavier. 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. (BibTeX)
  3. Bournez, Olivier and Garnier, Florent. 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. (BibTeX)
  4. Bournez, Olivier and Garnier, Florent. 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. (BibTeX)
  5. Barth, Dominique, Bournez, Olivier, Boussaton, Octave and Cohen, Johanne. 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}. (BibTeX)
  6. 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., L\"owe, B. and Sorbi, A., Eds.). New York, Springer-Verlag, pages 383-423. (BibTeX)

2007

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

2006

  1. Sylvie Dela\"et, Dominique Barth, Olivier Bournez Johanne Cohen Loubna Echabbi. Existence of a Nash Equilibria in a pricing game adapted to BGP.
    Technical report, LRI. (BibTeX)
  1. Bournez, Olivier, Cucker, Felipe, de Naurois, Paulin Jacob\'e and Marion, Jean-Yves. Implicit Complexity over an Arbitrary Structure: Quantifier Alternations.
    Information and Computation, 202(2):210-230. (BibTeX)
  2. Bournez, Olivier and Hainry, Emmanuel. Recursive Analysis Characterized as a Class of Real Recursive Functions.
    Fundamenta Informaticae, 74(4):409-433. (BibTeX)
  3. Bournez, Olivier. How much can analog and hybrid systems be proved (super-)Turing.
    Applied Mathematics and Computation, 178(1):58-71. (BibTeX)
  4. Bournez, Olivier and Garnier, Florent. Proving Positive Almost Sure Termination Under Strategies.
    In 17th International Conference on Rewriting Techniques and Applications (RTA'2006). Seattle, WA, USA. (Pfenning, Frank, Eds.) Springer, pages 357-371. (BibTeX)
  5. Bournez, Olivier, Campagnolo, Manuel L., Gra\c ca, Daniel S. and Hainry, Emmanuel. 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, Cooper, S. Barry and Li, Angsheng, Eds.) Springer, pages 631-643. (BibTeX)
  6. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)
  7. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)
  8. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)
  9. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)
  10. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)
  11. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)
  12. Bournez, Olivier. Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee.
    PhD thesis. (BibTeX)

2005

  1. Bournez, Olivier, Garnier, Florent and Kirchner, Claude. Termination in finite mean time of a CSMA/CA rule-based model.
    Technical report, LORIA, Nancy. (BibTeX)
  1. Bournez, Olivier, Soussan, Terence and Tavernier, Bertrand. Symbolic Simulation and Formal Verification of Updatable Timed Automata.
    Technical report, LORIA. (BibTeX)
  2. Bournez, Olivier, Cucker, Felipe, de Naurois, Paulin Jacob\'e and Marion, Jean-Yves. 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.}.. (BibTeX)
  3. Bournez, Olivier and Hainry, Emmanuel. Elementarily Computable Functions Over the Real Numbers and $\mathbbR$-Sub-Recursive Functions.
    Theoretical Computer Science, 348(2--3):130-147. (BibTeX)
  4. Bournez, Olivier, Cucker, Felipe, de Naurois, Paulin Jacob\'e and Marion, Jean-Yves. Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
    Journal of Logic and Computation, 15(1):41-58. (BibTeX)
  5. Olivier Bournez and Florent Garnier. Proving Positive Almost-Sure Termination.
    In Term Rewriting and Applications, 16th International Conference, {RTA} 2005, Nara, Japan, April 19-21, 2005, Proceedings. Nara, Japan. (J\"urgen Giesl, Eds.) Springer, pages 323-337. (BibTeX)
  6. Olivier Bournez, Liliana Ibanescu and H\'el\`ene Kirchner. From Chemical Rules to Term Rewriting.
    In Proceedings of the 6th International Workshop on Rule-Based Programming, RULE@RDP 2005, Nara, Japan, April 23, 2005. Nara, Japan, April. (Horatiu Cirstea and Narciso Mart\'\i-Oliet, Eds.) Elsevier, pages 113-134. (BibTeX)

2004

  1. Bournez, Olivier and Hainry, Emmanuel. An Analog Characterization of Elementarily Computable Functions Over the Real Numbers.
    In In 2nd APPSEM II Workshop (APPSEM'04). Tallinn, Estonia, April. (BibTeX)
  1. Bournez, Olivier, Cucker, Felipe, de Naurois, Paulin Jacob\'e and Marion, Jean-Yves. Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures.
    In In 2nd APPSEM II Workshop (APPSEM'04). April. (BibTeX)
  2. Bournez, Olivier and Hainry, Emmanuel. An Analog Characterization of Elementarily Computable Functions Over the Real Numbers.
    In 31th International Colloquium on Automata Languages and Programming (ICALP'04). Turku, Finland. Springer, pages 269-280. (BibTeX)
  3. Bournez, Olivier and Hainry, Emmanuel. Real Recursive Functions and Real Extentions of Recursive Functions.
    In Machines, Computations and Universality (MCU'2004). Saint-Petersburg, Russia, September. (Margenstern, Maurice, Eds.). (BibTeX)
  4. 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 Exploring New Frontiers of Theoretical Informatics, {IFIP} 18th World Computer Congress, {TC1} 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France. Toulouse, France, august. (Jean-Jacques L\'evy, Ernst W. Mayr and John C. Mitchell, Eds.) Kluwer/Springer, pages 409-422. (BibTeX)
  5. Bournez, Olivier, Soussan, T\'erence and Tavernier, Bertrand. Symbolic Simulation and Formal Verification of Updatable Timed Automata using a Rewrite System.
    Technical report, LORIA. (BibTeX)

2003

  1. Bournez, Olivier. Fuzzy Equational Theories.
    Technical report, LORIA. (BibTeX)
  1. Bournez, Olivier, Cucker, Felipe, de Naurois, Paulin Jacob\'e and Marion, Jean-Yves. 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.) Springer, pages 185-199. (BibTeX)
  2. Bournez, Olivier, Cucker, Felipe, de Naurois, Paulin Jacob\'e and Marion, Jean-Yves. 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.). (BibTeX)
  3. Bournez, Olivier, C\^ome, Guy-Marie, Conraud, Val\'erie, Kirchner, H\'el\`ene and Ibanescu, Liliana. 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., Abramson, D., Bogdanov, A.V., Dongarra, J.J., Zomaya, A.Y. and Gorbachev, Y.E., Eds.) Springer, pages 367-376. (BibTeX)
  4. Bournez, Olivier, Habib, Mohamed El, Kirchner, Claude, Kirchner, H\'el\`ene, Marion, Jean-Yves and Merz, Stephan. 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}. (BibTeX)
  5. Bournez, Olivier, C\^ome, Guy-Marie, Conraud, Val\'erie, Kirchner, H\'el\`ene and Ibanescu, Liliana. 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.) Springer, pages 30-45. (BibTeX)
  6. Bournez, Olivier and Hoyrup, Mathieu. 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.) Springer, pages 61-75. (BibTeX)
  7. Bournez, Olivier, Hoyrup, Mathieu and Kirchner, Claude. Logique de r\'e\'ecriture probabiliste.
    Technical report, LORIA. (BibTeX)
  8. Bournez, Olivier. Fuzzy Equational Theories.
    Technical report, LORIA. (BibTeX)

2002

  1. Bournez, Olivier, de Naurois, Paulin and Marion, Jean-Yves. Safe recursion and calculus over an arbitrary structure.
    In Implicit Computational Complexity - ICC'02. Copenhagen, Denmark, July. (BibTeX)
  1. Bournez, Olivier and Branicky, Michael. The Mortality Problem for Matrices of Low Dimensions.
    Theory of Computing Systems, 35(4):433-448. (BibTeX)
  2. Bournez, Olivier. A Generalization of Equational Proof Theory?.
    In Process Algebra and Probabilistic Methods : Performance Modeling and Verification, 2nd Joint International Workshop. jul25--26. (Hermanns, Holger and Segala, Roberto, Eds.) Springer-Verlag, pages 208-209. (BibTeX)
  3. Bournez, Olivier and Kirchner, Claude. Probabilistic rewrite strategies: Applications to ELAN.
    In Rewriting Techniques and Applications. jul22-24. (Tison, Sophie, Eds.) Springer-Verlag, pages 252-266. (BibTeX)

2001

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

2000

  1. Asarin, Eugene, Bournez, Olivier, Dang, Thao and Maler, Oded. Approximate reachability analysis of piecewise-linear dynamical systems.
    In {Hybrid Systems\,: Computation and Control (HSCC'00), Pittsburgh (USA)}. March 23-25 2000. Springer-Verlag, pages 20-31. (BibTeX)
  1. Asarin, Eugene, Bournez, Olivier, Dang, Thao, Maler, Oded and Pnueli, Amir. Effective Synthesis of Switching Controllers for Linear Systems.
    Proceedings of the IEEE, Special Issue on `Hybrid Systems'', 88(7):1011-1025. (BibTeX)
  2. Blondel, Vincent D., Bournez, Olivier, Koiran, Pascal and Tsitsiklis, John N.. 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.) Springer-Verlag, pages 479-490. (BibTeX)
  3. Bournez, Olivier and Maler, Oded. On the representation of timed polyhedra.
    In International Colloquium on Automata Languages and Programming (ICALP'00). Geneva, Switzerland, 9--15~jul. Springer, pages 793-807. (BibTeX)

1999

  1. Bournez, Olivier, Maler, Oded and Pnueli, Amir. Orthogonal polyhedra: Representation and Computation.
    In Hybrid Systems: Computation and Control - HSCC'99. Nijmegen, Pays-Bas, 29--31mar, pages 46-60. (BibTeX)
  1. Bournez, Olivier. Some bounds on the computational power of Piecewise Constant Derivative systems.
    Theory of Computing Systems, 32(1):35-67. (BibTeX)
  2. Bournez, Olivier. Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy.
    Theoretical Computer Science, 210(1):21-71. (BibTeX)
  3. Bournez, Olivier. Complexit\'e Algorithmique des Syst\`emes Dynamiques Continus et Hybrides.
    PhD thesis. (BibTeX)

1998

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

1997

  1. Olivier Bournez. Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract).
    In Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings. Bologne, Italie, 7--11~jul. (Pierpaolo Degano, Roberto Gorrieri and Alberto Marchetti-Spaccamela, Eds.) Springer, pages 143-153. (BibTeX)

1996

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

1994