Emmanuel Hainry

发表

Objects in Polynomial Time

Romain Péchoux, Emmanuel Hainry, 2015, APLAS.

Type-Based Complexity Analysis for Fork Processes

Jean-Yves Marion, Romain Péchoux, Emmanuel Hainry, 2013, FoSSaCS.

A tier-based typed programming language characterizing Feasible Functionals

Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux, 2020, LICS.

A Type-Based Complexity Analysis of Object Oriented Programs pdf

Romain Péchoux, Emmanuel Hainry, 2018, Inf. Comput..

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions

Walid Gomaa, Olivier Bournez, Emmanuel Hainry, 2011, Int. J. Unconv. Comput..

Types for controlling heap and stack in Java

Romain Péchoux, Emmanuel Hainry, 2013, FOPARA 2013.

Modèles de calcul sur les réels, résultats de comparaison. (Computation on the reals.Comparison of some models)

Emmanuel Hainry, Emmanuel Hainry, 2006 .

Elementarily computable functions over the real numbers and R-sub-recursive functions

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2005, Theor. Comput. Sci..

Robust Computations with Dynamical Systems

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry, 2010, MFCS.

Computation with perturbed dynamical systems

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry, 2013, J. Comput. Syst. Sci..

Reachability in Linear Dynamical Systems

Emmanuel Hainry, Emmanuel Hainry, 2008, CiE.

Computing Omega-Limit Sets in Linear Dynamical Systems

Emmanuel Hainry, Emmanuel Hainry, 2008, UC.

An Analog Characterization of Elementarily Computable Functions over the Real Numbers

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2004, ICALP.

Recursive Analysis Characterized as a Class of Real Recursive Functions

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2006, Fundam. Informaticae.

Higher order interpretation for higher order complexity

Romain Péchoux, Emmanuel Hainry, 2017, LPAR.

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation

Olivier Bournez, Daniel S. Graça, Manuel Lameiras Campagnolo, 2006, TAMC.

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity

Mathieu Hoyrup, Romain Péchoux, Hugo Férée, 2010, ISAAC.

Real Recursive Functions and Real Extensions of Recursive Functions

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2004, MCU.

Theory of higher order interpretations and application to Basic Feasible Functions pdf

Romain Péchoux, Emmanuel Hainry, Romain Péchoux, 2018, Log. Methods Comput. Sci..

Tiered complexity at higher order

Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux, 2019 .

Characterizing polynomial time complexity of stream programs using interpretations

Mathieu Hoyrup, Romain Péchoux, Hugo Férée, 2015, Theor. Comput. Sci..

New Results - Computability and complexity

Olivier Bournez, Daniel S. Graça, Emmanuel Hainry, 2006 .

A Framework for Algebraic Characterizations in Recursive Analysis pdf

Walid Gomaa, Olivier Bournez, Emmanuel Hainry, 2016, ArXiv.

On the Computational Capabilities of Several Models

Olivier Bournez, Emmanuel Hainry, Olivier Bournez, 2007, MCU.

Polynomial differential equations compute all real computable functions on computable compact intervals

Olivier Bournez, Daniel S. Graça, Manuel Lameiras Campagnolo, 2007, J. Complex..

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs

Romain Péchoux, Emmanuel Jeandel, Emmanuel Hainry, 2021, ICTAC.

Polynomial dierential equations compute all real computable functions

Olivier Bournez, Daniel S. Graça, Manuel L. Campagnolo, 2006 .