 |
|
|
||
|---|---|---|
|
hal-00643634v2
Article dans une revue
Olivier Bournez, Daniel Graça, Emmanuel Hainry. Computation with perturbed dynamical systems Journal of Computer and System Sciences, Elsevier, 2013, 79 (5), pp.714-724. <10.1016/j.jcss.2013.01.025> |
||
|
inria-00102947v2
Article dans une revue
Olivier Bournez, Manuel L. Campagnolo, Daniel S. Graça, Emmanuel Hainry. Polynomial differential equations compute all real computable functions on computable compact intervals Journal of Complexity, Elsevier, 2007, 23 (3), pp.317--335 |
||
|
hal-00755450v2
Communication dans un congrès
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux. Type-based complexity analysis for fork processes Pfenning, Frank. 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Mar 2013, Rome, Italy. Springer, 7794, pp.305-320, 2013, Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures - 16th International Conference, FOSSACS 2013. <10.1007/978-3-642-37075-5_20> |
||
|
hal-01112160v1
Article dans une revue
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Characterizing polynomial time complexity of stream programs using interpretations Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 585, pp.41-54. <10.1016/j.tcs.2015.03.008> |
||
|
inria-00522029v1
Communication dans un congrès
Olivier Bournez, Daniel Graça, Emmanuel Hainry. Robust computations with dynamical systems Petr Hlineny and Antonin Kucera. 35th international symposium on Mathematical Foundations of Computer Science - MFCS 2010, Aug 2010, Brno, Czech Republic. Springer-Verlag, 6281, pp.198-208, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-15155-2_19> |
||
|
inria-00429965v1
Rapport
Emmanuel Hainry. Decidability and Undecidability in Dynamical Systems [Research Report] 2009, pp.27 |
||
|
hal-00773141v4
Autre publication
Emmanuel Hainry, Romain Péchoux. Type-based heap and stack space analysis in Java Rapport technique. 2013 |
||
|
hal-00910166v1
Communication dans un congrès
Emmanuel Hainry, Romain Péchoux. Types for controlling heap and stack in Java Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA), Aug 2013, Bertinoro, Italy. 2013 |
||
|
inria-00421561v1
Rapport
Olivier Bournez, Walid Gomaa, Emmanuel Hainry. Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions [Research Report] 2009 |
||
|
hal-01206161v1
Communication dans un congrès
Emmanuel Hainry, Romain Péchoux. Objects in Polynomial Time Xinyu Feng; Sungwoo Park. APLAS 2015, Nov 2015, Pohang, South Korea. Springer, 9458, pp.387--404, Lecture Notes in Computer Science. <http://pl.postech.ac.kr/aplas2015/>. <10.1007/978-3-319-26529-2_21> |
||
|
hal-01207910v1
Communication dans un congrès
Emmanuel Hainry, Romain Péchoux. Higher order interpretations for Basic Feasible Functions DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom. <http://dice15.computing.dundee.ac.uk> |
||
|
hal-01207918v1
Communication dans un congrès
Emmanuel Hainry, Romain Péchoux. Implicit computational complexity in Object Oriented Programs DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom. <http://dice15.computing.dundee.ac.uk> |
||
|
inria-00518381v1
Communication dans un congrès
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Interpretation of stream programs: characterizing type 2 polynomial time complexity 21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea. Springer, 2010 |
||
|
inria-00202674v2
Communication dans un congrès
Emmanuel Hainry. Reachability in linear dynamical systems Beckmann, Arnold and Dimitracopoulos, Costas and Lwe, Benedikt. Computability in Europe, Jun 2008, Athènes, Greece. Springer, 5028, pp.241-250, 2008, Lecture Notes in Computer Sciences; Logic and Theory of Algorithms. <10.1007/978-3-540-69407-6_28> |
||
|
inria-00182738v1
Communication dans un congrès
Olivier Bournez, Emmanuel Hainry. On the Computational Capabilities of Several Models Jérôme Durand-Lose et Maurice Margenstern. 5th International Conference on Machines, Computations and Universality - MCU 2007, Sep 2007, Orléans, France. Springer Berlin / Heidelberg, 4664, pp.12-23, 2007, Lecture Notes in Computer Science |
||
|
tel-00142675v1
Thèse
Emmanuel Hainry. Modèles de calcul sur les réels, résultats de comparaison Autre [cs.OH]. Institut National Polytechnique de Lorraine - INPL, 2006. Français |
||
|
inria-00250111v3
Communication dans un congrès
Emmanuel Hainry. Computing omega-limit Sets in Linear Dynamical Systems Calude, Cristian S. and Costa, José Félix and Freund, Rudolf and Oswald, Marion and Rozenberg, Grzegorz. Unconventional Computation, Aug 2008, Vienne, Austria. Springer, 5204, pp.83--95, 2008, Lecture Notes in Computer Science. <10.1007/978-3-540-85194-3_9> |
||
|
inria-00429964v1
Communication dans un congrès
Olivier Bournez, Walid Gomaa, Emmanuel Hainry. Implicit complexity in recursive analysis Tenth International Workshop on Logic and Computational Complexity - LCC'09, Aug 2009, Los Angeles, United States. 2009 |
||
|
hal-00644361v1
Article dans une revue
Olivier Bournez, Walid Gomaa, Emmanuel Hainry. Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions International Journal of Unconventional Computing, Old City Publishing, 2011, 7 (5), pp.331-351 |
||
|
|
||
