| 2026 | EuroCrypt | Solving the Shortest Vector Problem in 2 | Amaury Pouly, Yixin Shen |
| 2025 | PQCrypto | Discrete Gaussian Sampling for BKZ-Reduced Basis. | Amaury Pouly, Yixin Shen |
| 2024 | EuroCrypt | Provable Dual Attacks on Learning with Errors. | Amaury Pouly, Yixin Shen |
| 2023 | MFCS | On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). | Christoph Haase, Alessio Mansutti, Amaury Pouly |
| 2022 | ISSAC | The Membership Problem for Hypergeometric Sequences with Rational Parameters. | Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell |
| 2022 | ISSAC | On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. | Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell |
| 2020 | CONCUR | Algebraic Invariants for Linear Hybrid Automata. | Rupak Majumdar, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2019 | SAS | On the Monniaux Problem in Abstract Interpretation. | Nathanal Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2018 | LICS | Polynomial Invariants for Affine Programs. | Ehud Hrushovski, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2017 | ICALP | A Universal Ordinary Differential Equation. | Olivier Bournez, Amaury Pouly |
| 2017 | STACS | Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. | Nathanal Fijalkow, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2016 | CONCUR | Model Checking Flat Freeze LTL on One-Counter Automata. | Antonia Lechner, Richard Mayr, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2016 | ICALP | 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 Graa, Amaury Pouly |
| 2016 | LICS | Solvability of Matrix-Exponential Equations. | Jol Ouaknine, Amaury Pouly, Joo Sousa Pinto, James Worrell |
| 2013 | CiE | Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly, Ning Zhong |
| 2013 | TAMC | Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2012 | ISSAC | On the complexity of solving initial value problems. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2011 | MFCS | Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |