Следене
Emmanuel Hainry
Emmanuel Hainry
Потвърден имейл адрес: loria.fr - Начална страница
Заглавие
Позовавания
Позовавания
Година
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
1022007
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
632006
Reachability in linear dynamical systems
E Hainry
Conference on computability in Europe, 241-250, 2008
412008
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
392005
Recursive analysis characterized as a class of real recursive functions
O Bournez, E Hainry
Fundamenta Informaticae 74 (4), 409-434, 2006
382006
Real recursive functions and real extensions of recursive functions
O Bournez, E Hainry
International Conference on Machines, Computations, and Universality, 116-127, 2004
262004
An analog characterization of elementarily computable functions over the real numbers
O Bournez, E Hainry
International Colloquium on Automata, Languages, and Programming, 269-280, 2004
242004
Interpretation of stream programs: characterizing type 2 polynomial time complexity
H Férée, E Hainry, M Hoyrup, R Péchoux
International Symposium on Algorithms and Computation, 291-303, 2010
132010
Decidability and undecidability in dynamical systems
E Hainry
132009
A type-based complexity analysis of Object Oriented programs
E Hainry, R Péchoux
Information and Computation 261, 78-115, 2018
122018
Type-based complexity analysis for fork processes
E Hainry, JY Marion, R Péchoux
International Conference on Foundations of Software Science and …, 2013
122013
Modèles de calcul sur les réels, résultats de comparaison
E Hainry
Institut National Polytechnique de Lorraine, 2006
11*2006
Computation with perturbed dynamical systems
O Bournez, DS Graça, E Hainry
Journal of Computer and System Sciences 79 (5), 714-724, 2013
102013
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
102004
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
102004
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
92015
Objects in polynomial time
E Hainry, R Péchoux
Asian Symposium on Programming Languages and Systems, 387-404, 2015
82015
Algebraic characterizations of complexity-theoretic classes of real functions
O Bournez, W Gomaa, E Hainry
72009
Robust computations with dynamical systems
O Bournez, DS Graça, E Hainry
International Symposium on Mathematical Foundations of Computer Science, 198-208, 2010
62010
Polynomial time over the reals with parsimony
E Hainry, D Mazza, R Péchoux
International Symposium on Functional and Logic Programming, 50-65, 2020
42020
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20