Amaury Pouly

65 papers A* 4A 1B 8C 2Journal 41Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories.
Log. Methods Comput. Sci.
Christoph Haase, Alessio Mansutti, Amaury Pouly
2026 J jnl
Solving SIS in any norm via Gaussian sampling.
IACR Cryptol. ePrint Arch.
Maiara F. Bollauf, Amaury Pouly, Yixin Shen
2025 — conf
Discrete Gaussian Sampling for BKZ-Reduced Basis.
PQCrypto (2)
Amaury Pouly, Yixin Shen
2025 J jnl
On the Monniaux Problem in Abstract Interpretation.
J. ACM
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2024 J jnl
Discrete gaussian sampling for BKZ-reduced basis.
IACR Cryptol. ePrint Arch.
Amaury Pouly, Yixin Shen
2024 J jnl
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories.
CoRR
Christoph Haase, Alessio Mansutti, Amaury Pouly
2024 — conf
Provable Dual Attacks on Learning with Errors.
EUROCRYPT (6)
Amaury Pouly, Yixin Shen
2024 J jnl
Smoothing Parameter and Shortest Vector Problem on Random Lattices.
IACR Cryptol. ePrint Arch.
Amaury Pouly, Yixin Shen
2023 J jnl
A continuous characterization of PSPACE using polynomial ordinary differential equations.
J. Complex.
Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly
2023 B conf
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).
MFCS
Christoph Haase, Alessio Mansutti, Amaury Pouly
2023 J jnl
On Strongest Algebraic Program Invariants.
J. ACM
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
2023 J jnl
Provable Dual Attacks on Learning with Errors.
IACR Cryptol. ePrint Arch.
Amaury Pouly, Yixin Shen
2022 B conf
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.
ISSAC
Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell
2022 B conf
The Membership Problem for Hypergeometric Sequences with Rational Parameters.
ISSAC
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell
2022 J jnl
The Membership Problem for Hypergeometric Sequences with Rational Parameters.
CoRR
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell
2021 J jnl
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices.
CoRR
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell
2021 — conf
On the decidability of reachability in continuous time linear time-invariant systems.
HSCC
Mohan Dantam, Amaury Pouly
2020 J jnl
A Universal Ordinary Differential Equation.
Log. Methods Comput. Sci.
Olivier Bournez, Amaury Pouly
2020 B conf
Algebraic Invariants for Linear Hybrid Automata.
CONCUR
Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell
2020 J jnl
On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems.
CoRR
Mohan Dantam, Amaury Pouly
2020 — conf
Reachability in Dynamical Systems with Rounding.
FSTTCS
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland
2020 J jnl
Reachability in Dynamical Systems with Rounding.
CoRR
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland
2019 J jnl
Algebraic Invariants for Linear Hybrid Automata.
CoRR
Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell
2019 J jnl
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.
Theory Comput. Syst.
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019 J jnl
On the Decidability of Membership in Matrix-exponential Semigroups.
J. ACM
Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2019 B conf
On the Monniaux Problem in Abstract Interpretation.
SAS
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019 J jnl
On the Monniaux Problem in Abstract Interpretation.
CoRR
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019 — conf
On the decidability of reachability in linear time-invariant systems.
HSCC
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2018 J jnl
A Survey on Analog Models of Computation.
CoRR
Olivier Bournez, Amaury Pouly
2018 J jnl
Model Checking Flat Freeze LTL on One-Counter Automata.
Log. Methods Comput. Sci.
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
2018 J jnl
On the Decidability of Reachability in Linear Time-Invariant Systems.
CoRR
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2018 J jnl
On the complexity of bounded time and precision reachability for piecewise affine systems.
Theor. Comput. Sci.
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
2018 A* conf
Polynomial Invariants for Affine Programs.
LICS
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
2018 J jnl
Polynomial Invariants for Affine Programs.
CoRR
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
2017 A* conf
A Universal Ordinary Differential Equation.
ICALP
Olivier Bournez, Amaury Pouly
2017 J jnl
A Universal Ordinary Differential Equation.
CoRR
Olivier Bournez, Amaury Pouly
2017 J jnl
Explicit Error Bounds for Carleman Linearization.
CoRR
Marcelo Forets, Amaury Pouly
2017 J jnl
On the functions generated by the general purpose analog computer.
Inf. Comput.
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2017 J jnl
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.
J. ACM
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2017 A conf
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.
STACS
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2017 J jnl
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.
CoRR
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2017 — conf
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs.
CMSB
François Fages, Guillaume Le Guludec, Olivier Bournez, Amaury Pouly
2016 J jnl
Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients.
CoRR
Amaury Pouly
2016 J jnl
Computational complexity of solving polynomial differential equations over unbounded domains.
Theor. Comput. Sci.
Amaury Pouly, Daniel Silva Graça
2016 J jnl
Computing with Polynomial Ordinary Differential Equations.
CoRR
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016 J jnl
Computing with polynomial ordinary differential equations.
J. Complex.
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016 B conf
Model Checking Flat Freeze LTL on One-Counter Automata.
CONCUR
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
2016 J jnl
Model Checking Flat Freeze LTL on One-Counter Automata.
CoRR
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
2016 J jnl
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.
CoRR
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
2016 J jnl
On the Functions Generated by the General Purpose Analog Computer.
CoRR
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016 J jnl
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version).
CoRR
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016 A* conf
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.
ICALP
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016 J jnl
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length.
CoRR
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2016 A* conf
Solvability of Matrix-Exponential Equations.
LICS
Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2016 J jnl
Solvability of Matrix-Exponential Equations.
CoRR
Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2015 — —
Continuous models of computation: from computability to complexity. (Modèles de calculs à temps continu: de la calculabilité à la complexité).
Amaury Pouly
2015 — conf
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.
MACIS
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2014 J jnl
Computational complexity of solving elementary differential equations over unbounded domains.
CoRR
Amaury Pouly, Daniel Silva Graça
2014 — conf
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems.
RP
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly
2013 C conf
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.
CiE
Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong
2013 C conf
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer.
TAMC
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012 J jnl
On the complexity of solving initial value problems
CoRR
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012 B conf
On the complexity of solving initial value problems.
ISSAC
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
2012 J jnl
Turing machines can be efficiently simulated by the General Purpose Analog Computer.
CoRR
Amaury Pouly, Olivier Bournez, Daniel Silva Graça
2011 B conf
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains.
MFCS
Olivier Bournez, Daniel Silva Graça, Amaury Pouly