Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (MFCS, 2011)

On the complexity of solving initial value problems. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (ISSAC, 2012)

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly; Ning Zhong 002 (CiE, 2013)

Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (TAMC, 2013)

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. - Hugo Bazille; Olivier Bournez; Walid Gomaa 001; Amaury Pouly (RP, 2014)

Computational complexity of solving elementary differential equations over unbounded domains. - Amaury Pouly; Daniel Silva Graça (CoRR, 2014)

Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (MACIS, 2015)

Continuous models of computation: from computability to complexity. (Modèles de calculs à temps continu: de la calculabilité à la complexité). - Amaury Pouly (2015)

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. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (ICALP, 2016)

Solvability of Matrix-Exponential Equations. - Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (LICS, 2016)

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (CoRR, 2016)

Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients. - Amaury Pouly (CoRR, 2016)

Computing with polynomial ordinary differential equations. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (J. Complex., 2016)

Computational complexity of solving polynomial differential equations over unbounded domains. - Amaury Pouly; Daniel Silva Graça (Theor. Comput. Sci., 2016)

Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs. - François Fages; Guillaume Le Guludec; Olivier Bournez; Amaury Pouly (CMSB, 2017)

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (STACS, 2017)

Explicit Error Bounds for Carleman Linearization. - Marcelo Forets; Amaury Pouly (CoRR, 2017)

On the functions generated by the general purpose analog computer. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (Inf. Comput., 2017)

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (J. ACM, 2017)

Polynomial Invariants for Affine Programs. - Ehud Hrushovski; Joël Ouaknine; Amaury Pouly; James Worrell 001 (LICS, 2018)

A Survey on Analog Models of Computation. - Olivier Bournez; Amaury Pouly (CoRR, 2018)

Model Checking Flat Freeze LTL on One-Counter Automata. - Antonia Lechner; Richard Mayr; Joël Ouaknine; Amaury Pouly; James Worrell 001 (Log. Methods Comput. Sci., 2018)

On the complexity of bounded time and precision reachability for piecewise affine systems. - Hugo Bazille; Olivier Bournez; Walid Gomaa 001; Amaury Pouly (Theor. Comput. Sci., 2018)

On the decidability of reachability in linear time-invariant systems. - Nathanaël Fijalkow; Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (HSCC, 2019)

On the Decidability of Membership in Matrix-exponential Semigroups. - Joël Ouaknine; Amaury Pouly; João Sousa Pinto; James Worrell 001 (J. ACM, 2019)

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. - Nathanaël Fijalkow; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (Theory Comput. Syst., 2019)

Algebraic Invariants for Linear Hybrid Automata. - Rupak Majumdar; Joël Ouaknine; Amaury Pouly; James Worrell 001 (CONCUR, 2020)

Reachability in Dynamical Systems with Rounding. - Christel Baier; Florian Funke 002; Simon Jantsch; Toghrul Karimov; Engel Lefaucheux; Joël Ouaknine; Amaury Pouly; David Purser; Markus A. Whiteland (FSTTCS, 2020)

A Universal Ordinary Differential Equation. - Olivier Bournez; Amaury Pouly (Log. Methods Comput. Sci., 2020)

On the decidability of reachability in continuous time linear time-invariant systems. - Mohan Dantam; Amaury Pouly (HSCC, 2021)

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. - Klara Nosan; Amaury Pouly; Mahsa Shirmohammadi; James Worrell 001 (CoRR, 2021)

The Membership Problem for Hypergeometric Sequences with Rational Parameters. - Klara Nosan; Amaury Pouly; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2022)

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. - Klara Nosan; Amaury Pouly; Sylvain Schmitz; Mahsa Shirmohammadi; James Worrell 001 (ISSAC, 2022)

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). - Christoph Haase; Alessio Mansutti; Amaury Pouly (MFCS, 2023)

Provable Dual Attacks on Learning with Errors. - Amaury Pouly; Yixin Shen (IACR Cryptol. ePrint Arch., 2023)

A continuous characterization of PSPACE using polynomial ordinary differential equations. - Olivier Bournez; Riccardo Gozzi; Daniel Silva Graça; Amaury Pouly (J. Complex., 2023)

On Strongest Algebraic Program Invariants. - Ehud Hrushovski; Joël Ouaknine; Amaury Pouly; James Worrell 001 (J. ACM, 2023)

Provable Dual Attacks on Learning with Errors. - Amaury Pouly; Yixin Shen 001 (EUROCRYPT (6), 2024)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. - Christoph Haase; Alessio Mansutti; Amaury Pouly (CoRR, 2024)

Discrete gaussian sampling for BKZ-reduced basis. - Amaury Pouly; Yixin Shen (IACR Cryptol. ePrint Arch., 2024)

Smoothing Parameter and Shortest Vector Problem on Random Lattices. - Amaury Pouly; Yixin Shen (IACR Cryptol. ePrint Arch., 2024)

Discrete Gaussian Sampling for BKZ-Reduced Basis. - Amaury Pouly; Yixin Shen 001 (PQCrypto (2), 2025)

On the Monniaux Problem in Abstract Interpretation. - Nathanaël Fijalkow; Engel Lefaucheux; Pierre Ohlmann; Joël Ouaknine; Amaury Pouly; James Worrell 001 (J. ACM, 2025)