| 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 | 90 | 2017 |
| 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 | 74 | 2018 |
| 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 | 59 | 2017 |
| A survey on analog models of computation O Bournez, A Pouly Handbook of Computability and Complexity in Analysis, 173-226, 2021 | 45 | 2021 |
| Explicit error bounds for Carleman linearization M Forets, A Pouly arXiv preprint arXiv:1711.02552, 2017 | 33 | 2017 |
| Continuous models of computation: from computability to complexity A Pouly Ecole Doctorale Polytechnique; Universidad do Algarve, 2015 | 33 | 2015 |
| 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 | 29 | 2019 |
| Computational complexity of solving polynomial differential equations over unbounded domains A Pouly, DS Graça Theoretical Computer Science 626, 67-82, 2016 | 27 | 2016 |
| 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 | 19 | 2012 |
| 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 | 19 | 2011 |
| A universal ordinary differential equation O Bournez, A Pouly Logical Methods in Computer Science 16, 2020 | 18 | 2020 |
| On the functions generated by the general purpose analog computer O Bournez, D Graça, A Pouly Information and Computation 257, 34-57, 2017 | 17 | 2017 |
| On strongest algebraic program invariants E Hrushovski, J Ouaknine, A Pouly, J Worrell Journal of the ACM 70 (5), 1-22, 2023 | 15 | 2023 |
| Model checking flat freeze LTL on one-counter automata A Lechner, R Mayr, J Ouaknine, A Pouly, J Worrell Logical Methods in Computer Science 14, 2018 | 10 | 2018 |
| Computing with polynomial ordinary differential equations O Bournez, D Graça, A Pouly Journal of Complexity 36, 106-140, 2016 | 10 | 2016 |
| 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 | 9 | 2019 |
| 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 | 8 | 2018 |
| 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 | 8 | 2013 |
| Provable dual attacks on learning with errors A Pouly, Y Shen Annual International Conference on the Theory and Applications of …, 2024 | 7 | 2024 |
| A continuous characterization of PSPACE using polynomial ordinary differential equations O Bournez, R Gozzi, DS Graça, A Pouly Journal of Complexity 77, 101755, 2023 | 7 | 2023 |
olivier bournezProfessor of Computer Science, Ecole Polytechnique, France在 lix.polytechnique.fr 的电子邮件经过验证
