Следене
Amaury Pouly
Amaury Pouly
CNRS/IRIF
Потвърден имейл адрес: irif.fr - Начална страница
Заглавие
Позовавания
Позовавания
Година
Strong turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs
F Fages, GL Guludec, O Bournez, A Pouly
International conference on computational methods in systems biology, 108-127, 2017
542017
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
372018
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
342017
Continuous models of computation: from computability to complexity
A Pouly
PhD thesis, Ecole Polytechnique, 2015
262015
Computational complexity of solving polynomial differential equations over unbounded domains
A Pouly, DS Graça
Theoretical Computer Science 626, 67-82, 2016
232016
A survey on analog models of computation
O Bournez, A Pouly
Handbook of Computability and Complexity in Analysis, 173-226, 2021
182021
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 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
172019
Explicit error bounds for carleman linearization
M Forets, A Pouly
arXiv preprint arXiv:1711.02552, 2017
172017
Solving analytic differential equations in polynomial time over unbounded domains
O Bournez, DS Graça, A Pouly
International Symposium on Mathematical Foundations of Computer Science, 170-181, 2011
172011
On the functions generated by the general purpose analog computer
O Bournez, D Graça, A Pouly
Information and Computation 257, 34-57, 2017
132017
A universal ordinary differential equation
O Bournez, A Pouly
arXiv preprint arXiv:1702.08328, 2017
112017
Computing with polynomial ordinary differential equations
O Bournez, D Graça, A Pouly
Journal of Complexity 36, 106-140, 2016
102016
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
92018
Turing machines can be efficiently simulated by the general purpose analog computer
O Bournez, DS Graça, A Pouly
International Conference on Theory and Applications of Models of Computation …, 2013
82013
On the Monniaux problem in abstract interpretation
N Fijalkow, E Lefaucheux, P Ohlmann, J Ouaknine, A Pouly, J Worrell
International Static Analysis Symposium, 162-180, 2019
72019
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
Conference on Computability in Europe, 12-21, 2013
72013
Handbook of Computability and Complexity in Analysis, chapter a survey on analog models of computation
O Bournez, A Pouly
Springer in cooperation with the Association Computability in Europe, 2018
62018
On the complexity of bounded time reachability for piecewise affine systems
H Bazille, O Bournez, W Gomaa, A Pouly
International Workshop on Reachability Problems, 20-31, 2014
62014
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20