Polynomial differential equations compute all real computable functions on computable compact intervals O Bournez, ML Campagnolo, DS Graça, E Hainry Journal of Complexity 23 (3), 317-335, 2007 | 111 | 2007 |
The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation O Bournez, ML Campagnolo, DS Graça, E Hainry International Conference on Theory and Applications of Models of Computation …, 2006 | 69 | 2006 |
Reachability in linear dynamical systems E Hainry Logic and Theory of Algorithms: 4th Conference on Computability in Europe …, 2008 | 48 | 2008 |
Elementarily computable functions over the real numbers and R-sub-recursive functions O Bournez, E Hainry Theoretical Computer Science 348 (2-3), 130-147, 2005 | 40 | 2005 |
Recursive analysis characterized as a class of real recursive functions O Bournez, E Hainry Fundamenta Informaticae 74 (4), 409-434, 2006 | 38 | 2006 |
An analog characterization of elementarily computable functions over the real numbers O Bournez, E Hainry Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004 | 27 | 2004 |
Real recursive functions and real extensions of recursive functions O Bournez, E Hainry Machines, Computations, and Universality: 4th International Conference, MCU …, 2005 | 25 | 2005 |
Decidability and undecidability in dynamical systems E Hainry | 16 | 2009 |
Computation with perturbed dynamical systems O Bournez, DS Graça, E Hainry Journal of Computer and System Sciences 79 (5), 714-724, 2013 | 14 | 2013 |
Type-based complexity analysis for fork processes E Hainry, JY Marion, R Péchoux Foundations of Software Science and Computation Structures: 16th …, 2013 | 14 | 2013 |
Modèles de calcul sur les réels, résultats de comparaison E Hainry Institut National Polytechnique de Lorraine-INPL, 2006 | 13* | 2006 |
A type-based complexity analysis of Object Oriented programs E Hainry, R Péchoux Information and Computation 261, 78-115, 2018 | 12 | 2018 |
Interpretation of stream programs: characterizing type 2 polynomial time complexity H Férée, E Hainry, M Hoyrup, R Péchoux Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010 | 12 | 2010 |
Robust computations with dynamical systems O Bournez, DS Graça, E Hainry Mathematical Foundations of Computer Science 2010: 35th International …, 2010 | 11 | 2010 |
Programmation par règles et stratégies pour la génération automatique de mécanismes de combustion d'hydrocarbures polycycliques L Ibanescu, F Blanqui, PE Moreau, O Zendra, A Martins Moreira, ... 15th International Conference on Rewriting Techniques and Applications-RTA …, 2004 | 11 | 2004 |
Programmation par règles et stratégies pour la génération automatique de mécanismes de combustion d'hydrocarbures polycycliques L Ibanescu, F Blanqui, PE Moreau, O Zendra, A Martins Moreira, ... 15th International Conference on Rewriting Techniques and Applications-RTA …, 2004 | 11 | 2004 |
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs E Hainry, E Jeandel, R Péchoux, O Zeyen Theoretical Aspects of Computing–ICTAC 2021: 18th International Colloquium …, 2021 | 7 | 2021 |
Characterizing polynomial time complexity of stream programs using interpretations H Férée, E Hainry, M Hoyrup, R Péchoux Theoretical Computer Science 585, 41-54, 2015 | 7 | 2015 |
Objects in polynomial time E Hainry, R Péchoux Programming Languages and Systems: 13th Asian Symposium, APLAS 2015, Pohang …, 2015 | 7 | 2015 |
A tier-based typed programming language characterizing Feasible Functionals E Hainry, BM Kapron, JY Marion, R Péchoux Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 6 | 2020 |