Amaury Pouly

According to our database, Amaury Pouly authored at least 41 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Discrete gaussian sampling for BKZ-reduced basis.

Amaury Pouly, Yixin Shen

IACR Cryptol. ePrint Arch., 2024

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories.

Christoph Haase, Alessio Mansutti, Amaury Pouly

CoRR, 2024

Provable Dual Attacks on Learning with Errors.

Amaury Pouly, Yixin Shen

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023

On Strongest Algebraic Program Invariants.

Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell

J. ACM, October, 2023

A continuous characterization of PSPACE using polynomial ordinary differential equations.

Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly

J. Complex., August, 2023

Provable Dual Attacks on Learning with Errors.

Amaury Pouly, Yixin Shen

IACR Cryptol. ePrint Arch., 2023

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).

Christoph Haase, Alessio Mansutti, Amaury Pouly

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.

Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

The Membership Problem for Hypergeometric Sequences with Rational Parameters.

Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices.

Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell

CoRR, 2021

On the decidability of reachability in continuous time linear time-invariant systems.

Mohan Dantam, Amaury Pouly

Proceedings of the HSCC '21: 24th ACM International Conference on Hybrid Systems: Computation and Control, 2021

2020

A Universal Ordinary Differential Equation.

Olivier Bournez, Amaury Pouly

Log. Methods Comput. Sci., 2020

Reachability in Dynamical Systems with Rounding.

Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Algebraic Invariants for Linear Hybrid Automata.

Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.

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

Theory Comput. Syst., 2019

On the Decidability of Membership in Matrix-exponential Semigroups.

Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell

J. ACM, 2019

On the Monniaux Problem in Abstract Interpretation.

Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell

Proceedings of the Static Analysis - 26th International Symposium, 2019

On the decidability of reachability in linear time-invariant systems.

Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell

Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, 2019

2018

On the complexity of bounded time and precision reachability for piecewise affine systems.

Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly

Theor. Comput. Sci., 2018

Model Checking Flat Freeze LTL on One-Counter Automata.

Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell

Log. Methods Comput. Sci., 2018

A Survey on Analog Models of Computation.

Olivier Bournez, Amaury Pouly

CoRR, 2018

Polynomial Invariants for Affine Programs.

Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

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

On the functions generated by the general purpose analog computer.

Olivier Bournez, Daniel Silva Graça, Amaury Pouly

Inf. Comput., 2017

Explicit Error Bounds for Carleman Linearization.

Marcelo Forets, Amaury Pouly

CoRR, 2017

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.

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

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

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

Proceedings of the Computational Methods in Systems Biology, 2017

2016

Computational complexity of solving polynomial differential equations over unbounded domains.

Amaury Pouly, Daniel Silva Graça

Theor. Comput. Sci., 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 with non-rational coefficients.

Amaury Pouly

CoRR, 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

Solvability of Matrix-Exponential Equations.

Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

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

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

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

Amaury Pouly

PhD thesis, 2015

Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.

Olivier Bournez, Daniel Silva Graça, Amaury Pouly

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014

Computational complexity of solving elementary differential equations over unbounded domains.

Amaury Pouly, Daniel Silva Graça

CoRR, 2014

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.

Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly

Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013

Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer.

Olivier Bournez, Daniel Silva Graça, Amaury Pouly

Proceedings of the Theory and Applications of Models of Computation, 2013

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.

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

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

On the complexity of solving initial value problems.

Olivier Bournez, Daniel Silva Graça, Amaury Pouly

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains.

Olivier Bournez, Daniel Silva Graça, Amaury Pouly

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011