Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Pouly, Amaury
82  Ergebnisse:
Personensuche X
?
1

Provable Dual Attacks on Learning with Errors:

, In: Lecture Notes in Computer Science; Advances in Cryptology – EUROCRYPT 2024,
Pouly, Amaury ; Shen, Yixin - p. 256-285 , 2024
Link: https://doi.org/10.1007/..
 
?
2

A continuous characterization of PSPACE using polynomial or..:

Bournez, Olivier ; Gozzi, Riccardo ; Graça, Daniel S..
Journal of Complexity.  77 (2023)  - p. 101755 , 2023
Link: https://doi.org/10.1016/..
 
?
3

On Strongest Algebraic Program Invariants:

Hrushovski, Ehud ; Ouaknine, Joël ; Pouly, Amaury.
Journal of the ACM.  70 (2023)  5 - p. 1-22 , 2023
Link: https://doi.org/10.1145/..
 
?
4

The Membership Problem for Hypergeometric Sequences with Ra..:

, In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation,
Nosan, Klara ; Pouly, Amaury ; Shirmohammadi, Mahsa. - p. 381-389 , 2022
Link: https://dl.acm.org/doi/1..
 
?
5

On the Computation of the Zariski Closure of Finitely Gener..:

, In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation,
Nosan, Klara ; Pouly, Amaury ; Schmitz, Sylvain.. - p. 129-138 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

On the decidability of reachability in continuous time line..:

, In: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control,
Dantam, Mohan ; Pouly, Amaury - p. 1-12 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

A Survey on Analog Models of Computation:

, In: Theory and Applications of Computability; Handbook of Computability and Complexity in Analysis,
Bournez, Olivier ; Pouly, Amaury - p. 173-226 , 2021
Link: https://doi.org/10.1007/..
 
?
8

On the Decidability of Membership in Matrix-exponential Sem..:

Ouaknine, Joël ; Pouly, Amaury ; Sousa-Pinto, João.
Journal of the ACM (JACM).  66 (2019)  3 - p. 1-24 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

On the decidability of reachability in linear time-invarian..:

, In: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control,
Fijalkow, Nathanaël ; Ouaknine, Joël ; Pouly, Amaury.. - p. 77-86 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

Complete Semialgebraic Invariant Synthesis for the Kannan-L..:

Fijalkow, Nathanaël ; Ohlmann, Pierre ; Ouaknine, Joël..
Theory of Computing Systems.  63 (2019)  5 - p. 1027-1048 , 2019
Link: https://doi.org/10.1007/..
 
?
11

On the Monniaux Problem in Abstract Interpretation:

, In: Static Analysis; Lecture Notes in Computer Science,
Fijalkow, Nathanaël ; Lefaucheux, Engel ; Ohlmann, Pierre... - p. 162-180 , 2019
Link: https://doi.org/10.1007/..
 
?
12

On the Decidability of Membership in Matrix-exponential Sem..:

Ouaknine, Joël ; Pouly, Amaury ; Sousa-Pinto, João.
Journal of the ACM.  66 (2019)  3 - p. 1-24 , 2019
Link: https://doi.org/10.1145/..
 
?
13

On the complexity of bounded time and precision reachabilit..:

Bazille, Hugo ; Bournez, Olivier ; Gomaa, Walid.
Theoretical Computer Science.  735 (2018)  - p. 132-146 , 2018
Link: https://doi.org/10.1016/..
 
?
14

Polynomial Invariants for Affine Programs:

, In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
Hrushovski, Ehud ; Ouaknine, Joël ; Pouly, Amaury. - p. 530-539 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Polynomial Time Corresponds to Solutions of Polynomial Ordi..:

Bournez, Olivier ; Graça, Daniel S. ; Pouly, Amaury
Journal of the ACM (JACM).  64 (2017)  6 - p. 1-76 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15