Mots-clés

Nombre de documents

27

Publications ፨ Emmanuel Hainry


Article dans une revue6 documents

  • 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〉. 〈hal-01112160〉
  • 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〉. 〈hal-00643634v2〉
  • 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. 〈hal-00644361〉
  • 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. 〈inria-00102947v2〉
  • Olivier Bournez, Emmanuel Hainry. Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2006, 74 (4), pp.409-433. 〈inria-00000515〉
  • Olivier Bournez, Emmanuel Hainry. Elementarily Computable Functions Over the Real Numbers and R-Sub-Recursive Functions. Theoretical Computer Science, Elsevier, 2005, 348 (2-3), pp.130--147. 〈inria-00000518〉

Communication dans un congrès15 documents

  • 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-01206161〉
  • 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〉. 〈hal-01207918〉
  • 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-01207910〉
  • 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. 〈hal-00910166〉
  • 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. 〈10.1007/978-3-642-37075-5_20〉. 〈hal-00755450v2〉
  • 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-00518381〉
  • 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-00522029〉
  • 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. 〈inria-00429964〉
  • 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. 〈10.1007/978-3-540-69407-6_28〉. 〈inria-00202674v2〉
  • 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-00250111v3〉
  • 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. 〈inria-00182738〉
  • Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry. The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. 3rd International Conference on Theory and Applications of Models of Computation - TAMC'2006, 2006, Pekin/Chine, 2006. 〈inria-00102946〉
  • Olivier Bournez, Emmanuel Hainry. An analog Characterization of Elementarily Computable Functions Over the Real Numbers. Diaz, Josep and Karhumäki, Juhani and Lepisto, Arto and Sannella, Donald Theodore. 31st International Colloqiuim on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, Springer, 3142, pp.269-280, 2004, Lecture Notes in Computer Science. 〈inria-00100054〉
  • Olivier Bournez, Emmanuel Hainry. Real Recursive Functions and Real Extensions of Recursive Functions. Machines and Universal Computations - MCU'2004, 2004, Saint-Petersburg, Russia, 12 p, 2004. 〈inria-00100053〉
  • Olivier Bournez, Emmanuel Hainry. An analog Characterization of Elementarily Computable Functions Over the Real Numbers. 2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p, 2004. 〈inria-00099897〉

Thèse1 document

  • 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. 〈tel-00142675〉

Autre publication1 document

  • Emmanuel Hainry, Romain Péchoux. Type-based heap and stack space analysis in Java. Rapport technique. 2013. 〈hal-00773141v4〉

Rapport4 documents

  • Emmanuel Hainry. Decidability and Undecidability in Dynamical Systems. [Research Report] 2009, pp.27. 〈inria-00429965〉
  • Olivier Bournez, Walid Gomaa, Emmanuel Hainry. Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. [Research Report] 2009. 〈inria-00421561〉
  • Olivier Bournez, Emmanuel Hainry. Elementarily Computable Functions Over the Real Numbers and $\mathbb{R}$-Sub-Recursive Functions. [Intern report] A04-R-301 || bournez04f, 2004, 22 p. 〈inria-00107812〉
  • Emmanuel Hainry. Fonctions réelles calculables et fonctions R-récursives. [Stage] A03-R-347 || hainry03a, 2003, 30 p. 〈inria-00099502〉