You can find my publications below, or alternatively look on DBLP. You can find notes and addentum at the bottom of the page.

- Under Revision
- On the Functions Generated by the General Purpose Analog Computer

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

- Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

- 2017
- A Universal Ordinary Differential Equation

Olivier Bournez and Amaury Pouly

International Colloquium on Automata, Languages and Programming (ICALP), 2017

- Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Nathanaël Fijalkow, Pierre Ohlmann, Joel Ouaknine, Amaury Pouly and James Worrell

International Symposium on Theoretical Aspects of Computer Science (STACS), 2017

- 2016
- Computational complexity of solving polynomial differential equations over unbounded domains (Elsevier)

Daniel Silva Graça and Amaury Pouly

Theoretical Computer Science (TCS), 626:67-82, 2016

ERRATA**The published version contains two minor mistakes which have been fixed in the arXiv version.**

ADDENTUM Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients

- Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Schloss Dagstuhl) (Slides)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

International Colloquium on Automata, Languages and Programming (ICALP), 2016

Leibniz International Proceedings in Informatics (LIPIcs), 55:109:1-109:15, 2016

Best Paper Award!

- Solvability of Matrix-Exponential Equations (ACM) (Slides)

Joel Ouaknine, Amaury Pouly, João Sousa-Pinto and James Worrell

Logic in Computer Science (LICS), 2016

- Computing with Polynomial Ordinary Differential Equations (Elsevier)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

Journal of Complexity, 36:106-140, 2016

- On The Complexity of Bounded Time and Precision Reachability for Piecewise Affine Systems (Elsevier)

Hugo Bazille, Olivier Bournez, Walid Gomaa and Amaury Pouly

Theoretical Computer Science (TCS), 2016

- Model Checking Flat Freeze LTL on One-Counter Automata (Schloss Dagstuhl)

Antonia Lechner, Richard Mayr, Joel Ouaknine, Amaury Pouly and James Worrell

International Conference on Concurrency Theory (CONCUR), 2016

Leibniz International Proceedings in Informatics (LIPIcs), 59:29:1-29:14, 2016

- 2015
- Continuous models of computation: from computability to complexity

Amaury Pouly

PhD ThesisPrix de thèse de l’Ecole Polytechnique 2016

- Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains (Springer) (Slides)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

Mathematical Aspects of Computer and Information Sciences (MACIS), 2015

Lecture Notes in Computer Science (LNCS), 9582:469-473, 2016

- 2014
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (Springer) (Slides)

Hugo Bazille, Olivier Bournez, Walid Gomaa and Amaury Pouly

Reachability Problems (RP), 2014

Lecture Notes in Computer Science (LNCS), 8762:20-31, 2014

NOTE**arXiv link points to the (submitted) journal version of the paper.**

- 2013
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Springer)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

Theory and Applications of Models of Computation (TAMC), 2013

Lecture Notes in Computer Science (LNCS), 7876:169-180, 2013

- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Springer)

Olivier Bournez, Daniel Silva Graça, Ning Zhong and Amaury Pouly

Computability in Europe (CiE), 2013

Lecture Notes in Computer Science (LNCS), 7921:12-21, 2013

- 2012
- Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains (Springer)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

Mathematical Foundations of Computer Science (MFCS), 2012

Lecture Notes in Computer Science (LNCS), 6907:170-181, 2012

- On the complexity of solving initial value problems (ACM)

Olivier Bournez, Daniel Silva Graça and Amaury Pouly

International Symposium on Symbolic and Algebraic Computation (ISSAC), 2012

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 7876:115-121, 2012

- Notes and Addentum
- Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients

Amaury Pouly