Obserwuj
Amaury Pouly
Amaury Pouly
CNRS/IRIF
Zweryfikowany adres z irif.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Strong turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs
F Fages, G Le Guludec, O Bournez, A Pouly
Computational Methods in Systems Biology: 15th International Conference …, 2017
622017
Polynomial invariants for affine programs
E Hrushovski, J Ouaknine, A Pouly, J Worrell
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
442018
Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length
O Bournez, DS Graça, A Pouly
Journal of the ACM (JACM) 64 (6), 1-76, 2017
412017
Continuous models of computation: from computability to complexity
A Pouly
PhD thesis, Ecole Polytechnique, 2015
282015
A survey on analog models of computation
O Bournez, A Pouly
Handbook of Computability and Complexity in Analysis, 173-226, 2021
272021
Computational complexity of solving polynomial differential equations over unbounded domains
A Pouly, DS Graça
Theoretical Computer Science 626, 67-82, 2016
252016
Explicit error bounds for Carleman linearization
M Forets, A Pouly
arXiv preprint arXiv:1711.02552, 2017
222017
On the decidability of reachability in linear time-invariant systems
N Fijalkow, J Ouaknine, A Pouly, J Sousa-Pinto, J Worrell
Proceedings of the 22nd ACM International Conference on Hybrid Systems …, 2019
212019
Solving analytic differential equations in polynomial time over unbounded domains
O Bournez, DS Graça, A Pouly
Mathematical Foundations of Computer Science 2011: 36th International …, 2011
192011
On the complexity of solving initial value problems
O Bournez, DS Graça, A Pouly
Proceedings of the 37th International Symposium on Symbolic and Algebraic …, 2012
182012
On the functions generated by the general purpose analog computer
O Bournez, D Graça, A Pouly
Information and Computation 257, 34-57, 2017
152017
A universal ordinary differential equation
O Bournez, A Pouly
arXiv preprint arXiv:1702.08328, 2017
132017
Computing with polynomial ordinary differential equations
O Bournez, D Graça, A Pouly
Journal of Complexity 36, 106-140, 2016
122016
Model checking flat freeze LTL on one-counter automata
J Worrell, A Pouly, J Ouaknine, R Mayr, A Lechner
Logical Methods in Computer Science 14, 2018
102018
On the Monniaux problem in abstract interpretation
N Fijalkow, E Lefaucheux, P Ohlmann, J Ouaknine, A Pouly, J Worrell
Static Analysis: 26th International Symposium, SAS 2019, Porto, Portugal …, 2019
92019
Turing machines can be efficiently simulated by the general purpose analog computer
O Bournez, DS Graça, A Pouly
Theory and Applications of Models of Computation: 10th International …, 2013
82013
Semialgebraic invariant synthesis for the kannan-lipton orbit problem
N Fijalkow, P Ohlmann, J Ouaknine, A Pouly, J Worrell
arXiv preprint arXiv:1701.02162, 2017
72017
Computability and computational complexity of the evolution of nonlinear dynamical systems
O Bournez, DS Graça, A Pouly, N Zhong
The Nature of Computation. Logic, Algorithms, Applications: 9th Conference …, 2013
72013
On the complexity of bounded time reachability for piecewise affine systems
H Bazille, O Bournez, W Gomaa, A Pouly
Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014
62014
Complete semialgebraic invariant synthesis for the kannan-lipton orbit problem
N Fijalkow, P Ohlmann, J Ouaknine, A Pouly, J Worrell
Theory of Computing Systems 63, 1027-1048, 2019
52019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20