default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmaury Pouly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Amaury Pouly
, Yixin Shen:
Provable Dual Attacks on Learning with Errors. EUROCRYPT (6) 2024: 256-285- [i26]Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. CoRR abs/2407.18420 (2024) - [i25]Amaury Pouly, Yixin Shen:
Discrete gaussian sampling for BKZ-reduced basis. IACR Cryptol. ePrint Arch. 2024: 1791 (2024) - 2023
- [j11]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
On Strongest Algebraic Program Invariants. J. ACM 70(5): 29:1-29:22 (2023) - [j10]Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly:
A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. 77: 101755 (2023) - [c21]Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS 2023: 52:1-52:14 - [i24]Amaury Pouly, Yixin Shen:
Provable Dual Attacks on Learning with Errors. IACR Cryptol. ePrint Arch. 2023: 1508 (2023) - 2022
- [c20]Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. ISSAC 2022: 129-138 - [c19]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. ISSAC 2022: 381-389 - [i23]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. CoRR abs/2202.07416 (2022) - 2021
- [c18]Mohan Dantam, Amaury Pouly:
On the decidability of reachability in continuous time linear time-invariant systems. HSCC 2021: 15:1-15:12 - [i22]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. CoRR abs/2106.01853 (2021) - 2020
- [j9]Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. Log. Methods Comput. Sci. 16(1) (2020) - [c17]Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell:
Algebraic Invariants for Linear Hybrid Automata. CONCUR 2020: 32:1-32:17 - [c16]Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland:
Reachability in Dynamical Systems with Rounding. FSTTCS 2020: 36:1-36:17 - [i21]Mohan Dantam, Amaury Pouly:
On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems. CoRR abs/2006.09132 (2020) - [i20]Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland:
Reachability in Dynamical Systems with Rounding. CoRR abs/2009.13353 (2020)
2010 – 2019
- 2019
- [j8]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the Decidability of Membership in Matrix-exponential Semigroups. J. ACM 66(3): 15:1-15:24 (2019) - [j7]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63(5): 1027-1048 (2019) - [c15]Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the decidability of reachability in linear time-invariant systems. HSCC 2019: 77-86 - [c14]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. SAS 2019: 162-180 - [i19]Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell:
Algebraic Invariants for Linear Hybrid Automata. CoRR abs/1902.10452 (2019) - [i18]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. CoRR abs/1907.08257 (2019) - 2018
- [j6]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. Log. Methods Comput. Sci. 14(4) (2018) - [j5]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On the complexity of bounded time and precision reachability for piecewise affine systems. Theor. Comput. Sci. 735: 132-146 (2018) - [c13]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
Polynomial Invariants for Affine Programs. LICS 2018: 530-539 - [i17]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
Polynomial Invariants for Affine Programs. CoRR abs/1802.01810 (2018) - [i16]Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the Decidability of Reachability in Linear Time-Invariant Systems. CoRR abs/1802.06575 (2018) - [i15]Olivier Bournez, Amaury Pouly:
A Survey on Analog Models of Computation. CoRR abs/1805.05729 (2018) - 2017
- [j4]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the functions generated by the general purpose analog computer. Inf. Comput. 257: 34-57 (2017) - [j3]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM 64(6): 38:1-38:76 (2017) - [c12]François Fages, Guillaume Le Guludec, Olivier Bournez, Amaury Pouly:
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs. CMSB 2017: 108-127 - [c11]Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. ICALP 2017: 116:1-116:14 - [c10]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS 2017: 29:1-29:13 - [i14]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR abs/1701.02162 (2017) - [i13]Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. CoRR abs/1702.08328 (2017) - [i12]Marcelo Forets, Amaury Pouly:
Explicit Error Bounds for Carleman Linearization. CoRR abs/1711.02552 (2017) - 2016
- [j2]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Computing with polynomial ordinary differential equations. J. Complex. 36: 106-140 (2016) - [j1]Amaury Pouly, Daniel Silva Graça:
Computational complexity of solving polynomial differential equations over unbounded domains. Theor. Comput. Sci. 626: 67-82 (2016) - [c9]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR 2016: 29:1-29:14 - [c8]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
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 2016: 109:1-109:15 - [c7]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
Solvability of Matrix-Exponential Equations. LICS 2016: 798-806 - [i11]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
Solvability of Matrix-Exponential Equations. CoRR abs/1601.05002 (2016) - [i10]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. CoRR abs/1601.05353 (2016) - [i9]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR abs/1601.05360 (2016) - [i8]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Computing with Polynomial Ordinary Differential Equations. CoRR abs/1601.05683 (2016) - [i7]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the Functions Generated by the General Purpose Analog Computer. CoRR abs/1602.00546 (2016) - [i6]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CoRR abs/1606.02643 (2016) - [i5]Amaury Pouly:
Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients. CoRR abs/1608.00135 (2016) - [i4]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR abs/1609.08059 (2016) - 2015
- [b1]Amaury Pouly:
Continuous models of computation: from computability to complexity. (Modèles de calculs à temps continu: de la calculabilité à la complexité). École Polytechnique, Palaiseau, France, 2015 - [c6]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS 2015: 469-473 - 2014
- [c5]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. RP 2014: 20-31 - [i3]Amaury Pouly, Daniel Silva Graça:
Computational complexity of solving elementary differential equations over unbounded domains. CoRR abs/1409.0451 (2014) - 2013
- [c4]Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong:
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE 2013: 12-21 - [c3]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC 2013: 169-180 - 2012
- [c2]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the complexity of solving initial value problems. ISSAC 2012: 115-121 - [i2]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
On the complexity of solving initial value problems. CoRR abs/1202.4407 (2012) - [i1]Amaury Pouly, Olivier Bournez, Daniel Silva Graça:
Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR abs/1203.4667 (2012) - 2011
- [c1]Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS 2011: 170-181
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
