Amaury Pouly
Orcid: 0000-0002-2549-951X
According to our database1,
Amaury Pouly
authored at least 39 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024
2023
A continuous characterization of PSPACE using polynomial ordinary differential equations.
J. Complex., August, 2023
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
2022
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022
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.
CoRR, 2021
On the decidability of reachability in continuous time linear time-invariant systems.
Proceedings of the HSCC '21: 24th ACM International Conference on Hybrid Systems: Computation and Control, 2021
2020
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
Proceedings of the 31st International Conference on Concurrency Theory, 2020
2019
Theory Comput. Syst., 2019
Proceedings of the Static Analysis - 26th International Symposium, 2019
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.
Theor. Comput. Sci., 2018
Log. Methods Comput. Sci., 2018
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.
J. ACM, 2017
Inf. Comput., 2017
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.
Proceedings of the Computational Methods in Systems Biology, 2017
2016
Computational complexity of solving polynomial differential equations over unbounded domains.
Theor. Comput. Sci., 2016
Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients.
CoRR, 2016
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version).
CoRR, 2016
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.
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é).
PhD thesis, 2015
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015
2014
Computational complexity of solving elementary differential equations over unbounded domains.
CoRR, 2014
Proceedings of the Reachability Problems - 8th International Workshop, 2014
2013
Proceedings of the Theory and Applications of Models of Computation, 2013
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011