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

• Submitted
• Provable Dual Attacks on Learning with Errors (Cryptology ePrint Archive)
  Amaury Pouly and Yixin Shen
  
• 2023
• On Polynomial-Time Decidability of k-Negations Fragments of {FO} Theories
  Cristoph Haase, Alessio Mansutti and Amaury Pouly
  MFCSMathematical Foundations of Computer Science (MFCS), Bordeaux, 2023
  
• On Strongest Algebraic Program Invariants
  Ehud Hrushovski, Joel Ouaknine, Amaury Pouly and James Worrell
  J. ACM (JACM)Journal of the ACM (JACM), 70:29:1--29:22, 2023
  
• A continuous characterization of PSPACE using polynomial ordinary differential equations
  Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça and Amaury Pouly
  J. ComplexityJournal of Complexity, 77, 2023
  
• 2022
• The Membership Problem for Hypergeometric Sequences with Rational Parameters (arXiv)
  Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi and James Worrell
  ISSACInternational Symposium on Symbolic and Algebraic Computation (ISSAC), Lille, 2022
  
• On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices (arXiv)
  Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi and James Worrell
  ISSACInternational Symposium on Symbolic and Algebraic Computation (ISSAC), Lille, 2022
  
• 2021
• A Survey on Analog Models of Computation (arXiv, Slides, Video)
  Olivier Bournez and Amaury Pouly
  
• On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems (arXiv)
  Mohan Dantam and Amaury Pouly
  Hybrid Systems: Computation and Control (HSCC)International Conference on Hybrid Systems: Computation and Control (HSCC), 2021
  
• 2020
• A Universal Ordinary Differential Equation (arXiv)
  Olivier Bournez and Amaury Pouly
  LMCSLogical Methods in Computer Science (LMCS), 16, 2020
  
• Reachability in Dynamical Systems with Rounding (arXiv)
  Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joel Ouaknine, Amaury Pouly, David Purser and Markus Whiteland
  FSTTCSFoundations of Software Technology and Theoretical Computer Science (FSTTCS), 2020
  LIPIcsLeibniz International Proceedings in Informatics (LIPIcs), 182:36:1--36:17, 2020
  
• Algebraic Invariants for Linear Hybrid Automata (arXiv)
  Rupak Majumdar, Joel Ouaknine, Amaury Pouly and James Worrell
  CONCURInternational Conference on Concurrency Theory (CONCUR), 2020
  
• 2019
• Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem (HAL)
  Nathanaël Fijalkow, Pierre Ohlmann, Joel Ouaknine, Amaury Pouly and James Worrell
  Theor. Comput. Sci. (TCS)Theoretical Computer Science (TCS), 63:1027-1048, 2019
  
• On the Monniaux Problem in Abstract Interpretation (arXiv)
  Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joel Ouaknine, Amaury Pouly and James Worrell
  SASStatic Analysis Symposium (SAS), Porto, 2019
  
• On the decidability of membership in matrix-exponential semigroups
  Joel Ouaknine, Amaury Pouly, João Sousa-Pinto and James Worrell
  J. ACM (JACM)Journal of the ACM (JACM), 66, 2019
  
• On the Decidability of Reachability in Linear Time-Invariant Systems (arXiv)
  Nathanaël Fijalkow, Joel Ouaknine, Amaury Pouly, João Sousa-Pinto and James Worrell
  Hybrid Systems: Computation and Control (HSCC)International Conference on Hybrid Systems: Computation and Control (HSCC), Montreal, 2019
  
• 2018
• Model Checking Flat Freeze LTL on One-Counter Automata
  Antonia Lechner, Richard Mayr, Joel Ouaknine, Amaury Pouly and James Worrell
  LMCSLogical Methods in Computer Science (LMCS), 14:4, 2018
  
• Polynomial Invariants for Affine Programs (arXiv, Slides)
  Ehud Hrushovski, Joel Ouaknine, Amaury Pouly and James Worrell
  LICSLogic in Computer Science (LICS), Oxford, 2018
  
• 2017
• Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version) (arXiv)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  J. ACM (JACM)Journal of the ACM (JACM), 64:38:1-38:76, 2017
  
• On the Functions Generated by the General Purpose Analog Computer (arXiv)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  Inform. Comput.Information and Computation, 2017
  
• Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs (HAL)
  François Fages, Guillaume Le Guludec, Olivier Bournez and Amaury Pouly
  CMSBComputational Methods in Systems Biology (CMSB), Darmstadt, 2017
  Lecture Notes in Comput. Sci. (LNCS)Lecture Notes in Computer Science (LNCS), 10545:108-127, 2017
  Best Paper Award!
  
• Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem (arXiv)
  Nathanaël Fijalkow, Pierre Ohlmann, Joel Ouaknine, Amaury Pouly and James Worrell
  STACSInternational Symposium on Theoretical Aspects of Computer Science (STACS), Hannover, 2017
  LIPIcsLeibniz International Proceedings in Informatics (LIPIcs), 66:29:1-29:13, 2017
  
• A Universal Ordinary Differential Equation (arXiv, Slides)
  Olivier Bournez and Amaury Pouly
  ICALPInternational Colloquium on Automata, Languages and Programming (ICALP), Varsaw, 2017
  LIPIcsLeibniz International Proceedings in Informatics (LIPIcs), 80:116:1-116:14, 2017
  
• 2016
• Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (arXiv, Slides)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  ICALPInternational Colloquium on Automata, Languages and Programming (ICALP), Rome, 2016
  LIPIcsLeibniz International Proceedings in Informatics (LIPIcs), 55:109:1-109:15, 2016
  Best Paper Award!
  
• Solvability of Matrix-Exponential Equations (arXiv, Slides)
  Joel Ouaknine, Amaury Pouly, João Sousa-Pinto and James Worrell
  LICSLogic in Computer Science (LICS), New York, 2016
  
• Computational complexity of solving polynomial differential equations over unbounded domains (arXiv)
  Daniel Silva Graça and Amaury Pouly
  Theor. Comput. Sci. (TCS)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
  
• Computing with Polynomial Ordinary Differential Equations (arXiv)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  J. ComplexityJournal of Complexity, 36:106-140, 2016
  
• Model Checking Flat Freeze LTL on One-Counter Automata (arXiv)
  Antonia Lechner, Richard Mayr, Joel Ouaknine, Amaury Pouly and James Worrell
  CONCURInternational Conference on Concurrency Theory (CONCUR), 2016
  LIPIcsLeibniz International Proceedings in Informatics (LIPIcs), 59:29:1-29:14, 2016
  
• On The Complexity of Bounded Time and Precision Reachability for Piecewise Affine Systems (arXiv)
  Hugo Bazille, Olivier Bournez, Walid Gomaa and Amaury Pouly
  Theor. Comput. Sci. (TCS)Theoretical Computer Science (TCS), 2016
  
• 2015
• Continuous models of computation: from computability to complexity
  Amaury Pouly
  PhD ThesisPrix de thèse de l’Ecole Polytechnique 2016Ackermann Award 2017
  
• Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains (Slides)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  MACISInternational Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), Berlin, 2015
  Lecture Notes in Comput. Sci. (LNCS)Lecture Notes in Computer Science (LNCS), 9582:469-473, 2016
  
• 2014
• On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (arXiv, Slides)
  Hugo Bazille, Olivier Bournez, Walid Gomaa and Amaury Pouly
  RPReachability Problems (RP), 2014
  Lecture Notes in Comput. Sci. (LNCS)Lecture Notes in Computer Science (LNCS), 8762:20-31, 2014
  NOTE arXiv link points to the journal version of the paper.
  
• 2013
• Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
  Olivier Bournez, Daniel Silva Graça, Ning Zhong and Amaury Pouly
  CiEComputability in Europe (CiE), 2013
  Lecture Notes in Comput. Sci. (LNCS)Lecture Notes in Computer Science (LNCS), 7921:12-21, 2013
  
• Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (arXiv)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  TAMCTheory and Applications of Models of Computation (TAMC), Hong Kong, 2013
  Lecture Notes in Comput. Sci. (LNCS)Lecture Notes in Computer Science (LNCS), 7876:169-180, 2013
  
• 2012
• On the complexity of solving initial value problems (arXiv)
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  ISSACInternational Symposium on Symbolic and Algebraic Computation (ISSAC), Grenoble, 2012
  Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 7876:115-121, 2012
  
• 2011
• Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
  Olivier Bournez, Daniel Silva Graça and Amaury Pouly
  MFCSMathematical Foundations of Computer Science (MFCS), Varsaw, 2011
  Lecture Notes in Comput. Sci. (LNCS)Lecture Notes in Computer Science (LNCS), 6907:170-181, 2012
  
• Notes and Addentum
• Explicit Error Bounds for Carleman Linearization (arXiv)
  Marcelo Forets and Amaury Pouly
  
• Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients (arXiv)
  Amaury Pouly