Publications (organized by types)

THESE NEWS NEED TO BE UPDATED. SORRY

NEW: Our article "Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs » got the award of journal « La Recherche » 2019

NEW: Our survey on Analog Models of Computations is OUT and available HERE.

To appear as as a chapter of "Handbook of Computability and Complexity in Analysis ". Springer. Editors: Vasco Brattka and Peter Hertling, Bibitem

NEW: Our paper at CSMB'2017 received the Best paper award

NEW: Our paper at ICALP'2016 is the winner of the ICALP Best paper award (track B)

NEW: Our paper at CIE' 2016 is the winner of the CIE Best paper award

See here for an organization by topics. See here for an organization by year / See also DBLP entry

Edited proceedings, edited volumes

1. Reachability Problems - 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings.
   (Olivier Bournez and Enrico Formenti and Igor Potapov, Eds.)volume 14235 of Lecture Notes in Computer Science, Springer.
   (2023) (URL) (BibTeX)
   
2. Olivier Bournez and Igor Potapov. Reachability Problems (RP 2009) Special Issue.
   volume 22 of International Journal of Foundations of Computer Science.
   (2011) (BibTeX)
   
3. Olivier Bournez and Igor Potapov. Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings.
   (Bournez, Olivier and Potapov, Igor, Eds.)volume 5797 of Lecture Notes in Computer Science, Springer.
   (2009) (BibTeX)
   

Selected submissions currently under review

1. Manon Blanc and Olivier Bournez. Measuring robustness of dynamical systems. Relating time and space to length and precision.
   Technical report.
   (2023) (URL) (BibTeX)
   
2. Olivier Bournez and Quentin Guilmant. Surreal fields stable under exponential and logarithmic functions.
   Submitted.
   (2022) (arXiv version) (BibTeX)
   

Journals, Book Chapters, Proceedings

1. Manon Blanc and Olivier Bournez. A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations.
   International Journal of Foundations of Computer Science To appear. Journal version of \cite{BlancBournezMCU22vantardise}. Preliminary version available on \url{https://arxiv.org/abs/2209.13599}.
   (2024) (BibTeX)
   
2. Nathalie Aubrun, Manon Blanc and Olivier Bournez. The domino problem is decidable for robust tilesets.
   arXiv preprint arXiv:2402.04438.
   (2024) (BibTeX)
   
3. Olivier Bournez , Riccardo Gozzi , Daniel Silva Gra{\c{c}}a and Amaury Pouly. A continuous characterization of PSPACE using polynomial ordinary differential equations.
   Journal of Complexity, 77:101755.
   (2023) (URL) (BibTeX)
   
4. Olivier Bournez , Arnaud Dur and . A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations.
   Computational Complexity, 32(2):7.
   (2023) (URL) (BibTeX)
   
5. Manon Blanc and Olivier Bournez. Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations.
   CoRR, abs/2307.11747.
   (2023) (URL) (BibTeX)
   
6. Olivier Bournez and Amaury Pouly. A Universal Ordinary Differential Equation.
   Logical Methods in Computer Science, 16(1).
   (2020) (URL) (BibTeX)
   
7. Olivier Bournez and Sabrina Ouazzani. Continuous Ordinary Differential Equations and Transfinite Computations.
   ArXiv e-prints.
   (2019) (BibTeX)
   
8. Olivier Bournez. La revanche du calcul analogique.
   Blog 'Binaire' du journal 'Le Monde'.
   (2019) (URL) (BibTeX)
   
9. Hugo Bazille , Olivier Bournez , Walid Gomaa and Amaury Pouly. On the complexity of bounded time and precision reachability for piecewise affine systems.
   Theoretical Computer Science, 735:132-146.
   (2018) (URL) (BibTeX)
   
10. Olivier Bournez , Johanne Cohen and Mika{\"{e}}l Rabie. Homonym Population Protocols.
    Theory of Computing Systems, 62(5):1318-1346.
    (2018) (URL) (BibTeX)
    
11. Olivier Bournez , Oleksiy Kurganskyy and Igor Potapov. Reachability Problems for One-Dimensional Piecewise Affine Maps.
    Int. J. Found. Comput. Sci., 29(4):529-549.
    (2018) (URL) (BibTeX)
    
12. Olivier Bournez , Arnaud Dur, and Sabrina Ouazzani. Recursion schemes, discrete differential equations and characterization of polynomial time computation.
    CoRR, abs/1810.02241.
    (2018) (arXiv version) (BibTeX)
    
13. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.
    Journal of the ACM, 64(6):38:1-38:76.
    (2017) (URL) (BibTeX)
    
14. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. On the functions generated by the general purpose analog computer.
    Information and Computation, 257:34-57.
    (2017) (URL) (BibTeX)
    
15. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.
    CoRR, abs/1601.05360.
    (2016) (arXiv version) (BibTeX)
    
16. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. Computing with polynomial ordinary differential equations.
    Journal of Complexity, 36:106-140.
    (2016) (URL) (PDF) (BibTeX)
    
17. Olivier Bournez, Gilles Dowek, R{\'e}mi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix and Sophie Tison. Informatique th\'eorique : complexit\'e, automates et au-del\`a.
    In {L'I.A. fronti{\`e}res et Applications}. (Marquis, Pierre and Papini, Odile and Prades, Henri, Eds.). http://www.cepadues.com/, C{\'e}padu{\`e}s Editions.
    (2014) (URL) (BibTeX)
    
18. Olivier Bournez, Gilles Dowek, R{\'e}mi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix and Sophie Tison. Informatique th\'eorique : calculabilit\'e, d\'ecidabilit\'e et logique.
    In {L'I.A. fronti{\`e}res et Applications}. (Marquis, Pierre and Papini, Odile and Prades, Henri, Eds.). http://www.cepadues.com/, C{\'e}padu{\`e}s Editions.
    (2014) (URL) (BibTeX)
    
19. Olivier Bournez, J{\'e}r{\'e}mie Chalopin, Johanne Cohen, Xavier Koegler and Rabie Mika{\"e}l. Population Protocols that Correspond to Symmetric Games.
    International Journal of Unconventional Computation, 9(1--2):5-36.
    (2013) (URL) (BibTeX)
    
20. Olivier Bournez, Daniel S. Gra\c{c}a and Emmanuel Hainry. Computation with perturbed dynamical systems.
    Journal of Computer System Science, 79(5):714-724.
    (2013) (BibTeX)
    
21. Olivier Bournez and Gilles Dowek. Physics and Computation Special Issue.
    Natural Computing, 11(1):1.
    (2012) (BibTeX)
    
22. Olivier Bournez, Walid Gomaa and Emmanuel Hainry. Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions.
    IJUC, 7(5):331-351.
    (2011) (URL) (BibTeX)
    
23. Guillaume Aupy and Olivier Bournez. On the number of binary-minded individuals required to compute sqrt(1/2).
    Theoretical Computer Science, 412(22):2262-2267.
    (2011) (URL) (BibTeX)
    
24. Olivier Bournez, Philippe Chassaing, Johanne Cohen, Lucas Gerin and Xavier Koegler. On the Convergence of Population Protocols When Population Goes to Infinity.
    Applied Mathematics and Computation, 215(4):1340-1350.
    (2009) (PDF) (BibTeX)
    
25. Dominique Barth, Olivier Bournez, Octave Boussaton and Johanne Cohen. Distributed Learning of Equilibria in a Routing Game.
    Parallel Processing Letters, 19:189-204.
    (2009) (URL) (PDF) (BibTeX)
    
26. 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)
    
27. 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)
    
28. 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)
    
29. 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)
    
30. Olivier Bournez and Emmanuel Hainry. Recursive Analysis Characterized as a Class of Real Recursive Functions.
    Fundamenta Informaticae, 74(4):409-433.
    (2006) (URL) (PDF) (BibTeX)
    
31. Olivier Bournez. How much can analog and hybrid systems be proved (super-)Turing.
    Applied Mathematics and Computation, 178(1):58-71.
    (2006) (PDF) (BibTeX)
    
32. 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)
    
33. 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)
    
34. 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)
    
35. 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)
    
36. 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)
    
37. 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)
    
38. Olivier Bournez. Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy.
    Theoretical Computer Science, 210(1):21-71.
    (1999) (PDF) (BibTeX)
    
39. Olivier Bournez. Some bounds on the computational power of Piecewise Constant Derivative systems.
    Theory of Computing Systems, 32(1):35-67.
    (1999) (PDF) (BibTeX)
    
40. 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)
    
41. 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)
    
42. 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)
    
43. Olivier Bournez. Le Calcul Analogique.
    In Informatique Math{\'e}matique Une photographie en 2022. Cours donn{\'e}s {\`a} l'Ecole Jeunes Chercheurs en Informatique Math{\'e}matiques...
    (PDF) (BibTeX)
    

Conferences (Final Versions)

1. Olivier Bournez and Riccardo Gozzi. Solving discontinuous initial value problems with unique solutions is equivalent to computing over the transfinite.
   In Symposium on Theoretical Aspects of Computer Science (STACS), Clermont-Ferrand, France..
   (2024) (BibTeX)
   
2. Manon Blanc and Olivier Bournez. The complexity of computing in continuous time: space complexity is precision.
   In ICALP: Annual International Colloquium on Automata, Languages and Programming 2024 (ICALP'2024). July. (Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, Eds.) LIPICS.
   (2024) (BibTeX)
   
3. Manon Blanc and Olivier Bournez. Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision.
   In 32nd {EACSL} Annual Conference on Computer Science Logic, {CSL} 2024, February 19-23, 2024, Naples, Italy. Dagstuhl, Germany. (Aniello Murano and Alexandra Silva, Eds.) Volume 288 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, pages 17:1-17:20.
   (2024) (URL) (BibTeX)
   
4. Olivier Bournez , Johanne Cohen and Valentin Dardilhac. On the $\delta$-decidability of decision problems for neural network questions.
   In Twentieth International Conference on Computability and Complexity in Analysis CCA'23. Dubronik, Croatia, September.
   (2023) (BibTeX)
   
5. Olivier Bournez and Riccardo Gozzi. Discontinuous IVPs with unique solutions.
   In Continuity, Computability, Constructivity. From Logic to Algorithms. CCC'23. Kyoto, Japan, September.
   (2023) (BibTeX)
   
6. Olivier Bournez and Riccardo Gozzi. Discontinuous IVPs with unique solutions.
   In Twentieth International Conference on Computability and Complexity in Analysis CCA'23. Dubronik, Croatia, September.
   (2023) (BibTeX)
   
7. Olivier Bournez , Johanne Cohen and Valentin Dardilhac. On the $\delta$-decidability of decision problems for neural network questions.
   In Computability, Continuity, Constructivity - from Logic to Algorithms CCC'23..
   (2023) (BibTeX)
   
8. Manon Blanc and Olivier Bournez. Characterisations of polynomial-time and -space complexity classes over the reals Characterisations of polynomial-time and -space complexity classes over the reals.
   In Continuity, Computability, Constructivity. From Logic to Algorithms. CCC'23. Kyoto, Japan, September.
   (2023) (BibTeX)
   
9. Manon Blanc and Olivier Bournez. Characterisations of polynomial-time and -space complexity classes over the reals Characterisations of polynomial-time and -space complexity classes over the reals.
   In Twentieth International Conference on Computability and Complexity in Analysis CCA'23. Dubronik, Croatia, September.
   (2023) (BibTeX)
   
10. Manon Blanc and Olivier Bournez. A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs.
    In 48th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France. (J{\'{e}}r{\^{o}}me Leroux and Sylvain Lombardy and David Peleg, Eds.) Volume 272 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, pages 21:1-21:15, . Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik.
    (2023) (URL) (BibTeX)
    
11. Manon Blanc and Olivier Bournez. Measuring the robustness of the dynamical systems. Relating time and space to length and precision.
    In 7th International Workshop "Women in Logic" Wil'2023. Rome, Italy, July.
    (2023) (BibTeX)
    
12. Manon Blanc and Olivier Bournez. A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.
    In Machines, Computations, and Universality - 9th International Conference, {MCU} 2022, Debrecen, Hungary, August 31 - September 2, 2022, Proceedings. (J{\'{e}}r{\^{o}}me Durand{-}Lose and Gy{\"{o}}rgy Vaszil, Eds.) Volume 13419 of Lecture Notes in Computer Science. Springer, pages 58-74.
    (2022) (URL) (BibTeX)
    
13. Olivier Bournez. Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language.
    In Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings. (Ulrich Berger and Johanna N. Y. Franklin and Florin Manea and Arno Pauly, Eds.) Volume 13359 of Lecture Notes in Computer Science. Springer, pages 39-51.
    (2022) (URL) (BibTeX)
    
14. Olivier Bournez. Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk).
    In 37th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2020, March 10-13, 2020, Montpellier, France. (Christophe Paul and Markus Bl{\"{a}}ser, Eds.) Volume 154 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, pages 3:1-3:13, . Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik.
    (2020) (URL) (BibTeX)
    
15. Olivier Bournez , Arnaud Dur and . Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations.
    In 44th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany. (Peter Rossmanith and Pinar Heggernes and Joost{-}Pieter Katoen, Eds.) Volume 138 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, pages 23:1-23:14.
    (2019) (URL) (BibTeX)
    
16. Olivier Bournez and Sabrina Ouazzani. Cheap Non-Standard Analysis and Computability: Some Applications.
    In 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, {SYNASC} 2018, Timisoara, Romania, September 20-23, 2018. {IEEE}, pages 149-156.
    (2018) (URL) (BibTeX)
    
17. Olivier Bournez. Ordinary Differential Equations \& Computability.
    In 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, {SYNASC} 2018, Timisoara, Romania, September 20-23, 2018. {IEEE}, pages 3-5.
    (2018) (URL) (BibTeX)
    
18. Fran{\c{c}}ois Fages , Guillaume Le Guludec , Olivier Bournez and Amaury Pouly. Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs.
    In Computational Methods in Systems Biology - 15th International Conference, {CMSB} 2017, Darmstadt, Germany, September 27-29, 2017, Proceedings. (J{\'{e}}r{\^{o}}me Feret and Heinz Koeppl, Eds.) Volume 10545 of Lecture Notes in Computer Science. Springer, pages 108-127.
    (2017) (URL) (BibTeX)
    
19. Olivier Bournez and Amaury Pouly. A Universal Ordinary Differential Equation.
    In 44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland. (Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl, Eds.) Volume 80 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, pages 116:1-116:14.
    (2017) (URL) (BibTeX)
    
20. Olivier Bournez , Nachum Dershowitz and Pierre N{\'{e}}ron. Axiomatizing Analog Algorithms.
    In Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings. (Arnold Beckmann and Laurent Bienvenu and Natasa Jonoska, Eds.) Volume 9709 of Lecture Notes in Computer Science. Springer, pages 215-224.
    (2016) (URL) (PDF) (BibTeX)
    
21. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations.
    In 43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy. (Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi, Eds.) Volume 55 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, pages 109:1-109:15.
    (2016) (URL) (PDF) (BibTeX)
    
22. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.
    In Mathematical Aspects of Computer and Information Sciences - 6th International Conference, {MACIS} 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers. (Ilias S. Kotsireas and Siegfried M. Rump and Chee K. Yap, Eds.) Volume 9582 of Lecture Notes in Computer Science. Springer, pages 469-473.
    (2015) (URL) (PDF) (BibTeX)
    
23. Olivier Bournez , Johanne Cohen and Mika{\"{e}}l Rabie. Homonym Population Protocols.
    In Networked Systems - Third International Conference, {NETYS} 2015, Agadir, Morocco, May 13-15, 2015, Revised Selected Papers. (Ahmed Bouajjani and Hugues Fauconnier, Eds.) Volume 9466 of Lecture Notes in Computer Science. Springer, pages 125-139.
    (2015) (URL) (BibTeX)
    
24. Hugo Bazille , Olivier Bournez , Walid Gomaa and Amaury Pouly. On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.
    In Reachability Problems - 8th International Workshop, {RP} 2014, Oxford, UK, September 22-24, 2014. Proceedings. (Jo{\"{e}}l Ouaknine and Igor Potapov and James Worrell, Eds.) Volume 8762 of Lecture Notes in Computer Science. Springer, pages 20-31.
    (2014) (URL) (BibTeX)
    
25. Olivier Bournez and Jonas Lef{\`e}vre. Population Protocols on Graphs: A Hierarchy.
    In Spatial Computing Workship (SCW'2013). (Mauri, Giancarlo and Dennunzio, Alberto and Manzoni, Luca and Porreca, Antonio E., Eds.) Springer.
    (2013) (BibTeX)
    
26. Olivier Bournez, Daniel S. Gra\c{c}a and Amaury Pouly. Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer.
    In Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings (TAMC'2013). (Chan, T.-H. Hubert and Lau, Lap Chi and Trevisan, Luca, Eds.) Springer, pages 169-180.
    (2013) (BibTeX)
    
27. Olivier Bournez , Jonas Lef{\`{e}}vre and Mika{\"{e}}l Rabie. Trustful Population Protocols.
    In Distributed Computing - 27th International Symposium, {DISC} 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings. (Yehuda Afek, Eds.) Volume 8205 of Lecture Notes in Computer Science. Springer, pages 447-461.
    (2013) (URL) (BibTeX)
    
28. Olivier Bournez , Daniel Silva Gra{\c{c}}a , Amaury Pouly and Ning Zhong. Computability and computational complexity of the evolution of nonlinear dynamical systems.
    In The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings. (Paola Bonizzoni and Vasco Brattka and Benedikt L{\"{o}}we, Eds.) Volume 7921 of Lecture Notes in Computer Science. Springer, pages 12-21.
    (2013) (URL) (BibTeX)
    
29. Olivier Bournez, Nachum Dershowitz and Evgenia Falkovich. Towards an Axiomatization of Simple Analog Algorithms.
    In Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. (Agrawal, Manindra and Cooper, S. Barry and Li, Angsheng, Eds.) Volume 7287 of Lecture Notes in Computer Science. Spinger-Verlag, pages 525-536.
    (2012) (BibTeX)
    
30. Olivier Bournez , Pierre Fraigniaud and Xavier Koegler. Computing with Large Populations Using Interactions.
    In Mathematical Foundations of Computer Science 2012 - 37th International Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. (Branislav Rovan and Vladimiro Sassone and Peter Widmayer, Eds.) Volume 7464 of Lecture Notes in Computer Science. Springer, pages 234-246.
    (2012) (URL) (BibTeX)
    
31. Olivier Bournez , Daniel Silva Gra{\c{c}}a and Amaury Pouly. On the complexity of solving initial value problems.
    In International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012. (Joris van der Hoeven and Mark van Hoeij, Eds.) {ACM}, pages 115-121.
    (2012) (URL) (BibTeX)
    
32. Olivier Bournez, J{\'e}r{\'e}mie Chalopin, Johanne Cohen, Xavier Koegler and Mika{\"e}l Rabie. Computing with Pavlovian Populations.
    In Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings. Volume 7109 of Lecture Notes in Computer Science. Springer, pages 409-420.
    (2011) (BibTeX)
    
33. Daniel Gra{\~A}{\S}a, Amaury Pouly Olivier Bournez. Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains.
    In Mathematical Foundations of Computer Science, MFCS'11. Volume 6907 of Lecture Notes in Computer Science, pages 170-181.
    (2011) (BibTeX)
    
34. Olivier Bournez, Daniel S. Gra\c{c}a and Emmanuel Hainry. Robust Computations with Dynamical Systems.
    In Mathematical Foundations of Computer Science, MFCS'2010. Volume 6281 of Lecture Notes in Computer Science. Springer, pages 198-208.
    (2010) (URL) (BibTeX)
    
35. Dominique Barth , Olivier Bournez , Octave Boussaton and Johanne Cohen. A dynamic approach for load balancing.
    In 4th International Conference on Performance Evaluation Methodologies and Tools, {VALUETOOLS} '09, Pisa, Italy, October 20-22, 2009. Pisa, Italy, October. (Giovanni Stea and Jean Mairesse and Jos{\'{e}} Mendes, Eds.) {ICST/ACM}, page 60.
    (2009) (URL) (BibTeX)
    
36. Walid Gomaa Olivier Bournez and Emmanuel Hainry. Implicit complexity in recursive analysis.
    In Logic and Computational Complexity..
    (2009) (BibTeX)
    
37. 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)
    
38. 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)
    
39. Olivier Bournez , J{\'{e}}r{\'{e}}mie 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 and Damien Woods and Anthony Karel Seda and Niall Murphy, Eds.) Volume 1 of {EPTCS}, pages 3-15.
    (2008) (arXiv version) (PDF) (BibTeX)
    
40. 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)
    
41. 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)
    
42. 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)
    
43. 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)
    
44. 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{\"{u}}rgen Giesl, Eds.) Volume 3467 of Lecture Notes in Computer Science. Springer, pages 323-337.
    (2005) (URL) (PDF) (BibTeX)
    
45. Olivier Bournez , Liliana Ibanescu and H{\'{e}}l{\`{e}}ne 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.) Volume 147 of Electronic Notes in Theoretical Computer Science. Elsevier, pages 113-134.
    (2005) (URL) (BibTeX)
    
46. 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)
    
47. 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)
    
48. 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{\'{e}}vy and Ernst W. Mayr and John C. Mitchell, Eds.) Volume 155 of {IFIP}. Kluwer/Springer, pages 409-422.
    (2004) (URL) (PDF) (BibTeX)
    
49. 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)
    
50. 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)
    
51. 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)
    
52. 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)
    
53. 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)
    
54. 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)
    
55. 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)
    
56. 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)
    
57. 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)
    
58. Olivier Bournez and Claude Kirchner. Probabilistic rewrite strategies: Applications to ELAN.
    In Rewriting Techniques and Applications. jul22-24. (Tison, Sophie, Eds.) Volume 2378 of Lecture Notes in Computer Science. Springer-Verlag, pages 252-266.
    (2002) (PDF) (BibTeX)
    
59. Olivier Bournez. 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.) Volume 2399 of Lecture Notes in Computer Science. Springer-Verlag, pages 208-209.
    (2002) (PDF) (BibTeX)
    
60. 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)
    
61. 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, jun18--20,.
    (2001) (PDF) (BibTeX)
    
62. 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, jun25--27,. (Dershowitz, Nachum and Frank, Ariel, Eds.).
    (2001) (PDF) (BibTeX)
    
63. 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)
    
64. 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)
    
65. 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)
    
66. Olivier Bournez, Oded Maler and Amir Pnueli. Orthogonal polyhedra: Representation and Computation.
    In Hybrid Systems: Computation and Control - HSCC'99. Nijmegen, Pays-Bas, 29--31mar. Volume 1569 of Lecture Notes in Computer Science, pages 46-60.
    (1999) (URL) (PDF) (BibTeX)
    
67. 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 and Roberto Gorrieri and Alberto Marchetti{-}Spaccamela, Eds.) Volume 1256 of Lecture Notes in Computer Science. Springer, pages 143-153.
    (1997) (URL) (PDF) (BibTeX)
    
68. Joseph L. Mundy , Rupert W. Curwen , Jane Liu , Charlie Rothwell , Andrew Zisserman and David A. Forsyth. MORSE: An Architecture for 3D Object Recognition Based on Invariants.
    In Recent Developments in Computer Vision, Second Asian Conference on Computer Vision, {ACCV} '95, Singapore, December 5-8, 1995, Invited Session Papers. Monterey (CA), USA, 13--16nov. (Stan Z. Li and Dinesh P. Mital and Eam Khwang Teoh and Han Wang, Eds.) Volume 1035 of Lecture Notes in Computer Science. Springer, pages 425-434.
    (1995) (URL) (PDF) (BibTeX)
    

Selected Research Reports (related to other works):

1. Nathalie Aubrun, Manon Blanc and Olivier Bournez. The domino problem is decidable for robust tilesets.
   arXiv preprint arXiv:2402.04438.
   (2024) (BibTeX)
   
2. 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)
   
3. 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)
   
4. 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)
   
5. Olivier Bournez, Terence Soussan, Bertr Tavernier and . Symbolic Simulation and Formal Verification of Updatable Timed Automata.
   Technical report, LORIA.
   (2005) Get it. (BibTeX)
   
6. 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)
   
7. 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)
   
8. Olivier Bournez. Fuzzy Equational Theories.
   Technical report, LORIA.
   (2003) (BibTeX)
   
9. Olivier Bournez, Mathieu Hoyrup and Claude Kirchner. Logique de r\'e\'ecriture probabiliste.
   Technical report, LORIA.
   (2003) Get it. (BibTeX)
   

Theses

1. 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)
   
2. 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)