An Analog Characterization of Elementarily Computable Functions over the Real Numbers. - Olivier Bournez; Emmanuel Hainry (ICALP, 2004)

Real Recursive Functions and Real Extensions of Recursive Functions. - Olivier Bournez; Emmanuel Hainry (MCU, 2004)

Elementarily computable functions over the real numbers and R-sub-recursive functions. - Olivier Bournez; Emmanuel Hainry (Theor. Comput. Sci., 2005)

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. - Olivier Bournez; Manuel Lameiras Campagnolo; Daniel Silva Graça; Emmanuel Hainry (TAMC, 2006)

Recursive Analysis Characterized as a Class of Real Recursive Functions. - Olivier Bournez; Emmanuel Hainry (Fundam. Informaticae, 2006)

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

On the Computational Capabilities of Several Models. - Olivier Bournez; Emmanuel Hainry (MCU, 2007)

Polynomial differential equations compute all real computable functions on computable compact intervals. - Olivier Bournez; Manuel Lameiras Campagnolo; Daniel Silva Graça; Emmanuel Hainry (J. Complex., 2007)

Reachability in Linear Dynamical Systems. - Emmanuel Hainry (CiE, 2008)

Computing Omega-Limit Sets in Linear Dynamical Systems. - Emmanuel Hainry (UC, 2008)

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (ISAAC (1), 2010)

Robust Computations with Dynamical Systems. - Olivier Bournez; Daniel Silva Graça; Emmanuel Hainry (MFCS, 2010)

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. - Olivier Bournez; Walid Gomaa 001; Emmanuel Hainry (Int. J. Unconv. Comput., 2011)

Type-Based Complexity Analysis for Fork Processes. - Emmanuel Hainry; Jean-Yves Marion; Romain Péchoux (FoSSaCS, 2013)

Computation with perturbed dynamical systems. - Olivier Bournez; Daniel Silva Graça; Emmanuel Hainry (J. Comput. Syst. Sci., 2013)

Objects in Polynomial Time. - Emmanuel Hainry; Romain Péchoux (APLAS, 2015)

Characterizing polynomial time complexity of stream programs using interpretations. - Hugo Férée; Emmanuel Hainry; Mathieu Hoyrup; Romain Péchoux (Theor. Comput. Sci., 2015)

A Framework for Algebraic Characterizations in Recursive Analysis. - Olivier Bournez; Walid Gomaa 001; Emmanuel Hainry (CoRR, 2016)

Higher order interpretation for higher order complexity. - Emmanuel Hainry; Romain Péchoux (LPAR, 2017)

A type-based complexity analysis of Object Oriented programs. - Emmanuel Hainry; Romain Péchoux (Inf. Comput., 2018)

Polynomial Time over the Reals with Parsimony. - Emmanuel Hainry; Damiano Mazza; Romain Péchoux (FLOPS, 2020)

Theory of higher order interpretations and application to Basic Feasible Functions. - Emmanuel Hainry; Romain Péchoux (Log. Methods Comput. Sci., 2020)

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. - Emmanuel Hainry; Emmanuel Jeandel; Romain Péchoux; Olivier Zeyen (ICTAC, 2021)

A tier-based typed programming language characterizing Feasible Functionals. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2022)

A Programming Language Characterizing Quantum Polynomial Time. - Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (FoSSaCS, 2023)

A feasible and unitary programming language with quantum control. - Alejandro Díaz-Caro; Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (CoRR, 2023)

A General Noninterference Policy for Polynomial Time. - Emmanuel Hainry; Romain Péchoux (Proc. ACM Program. Lang., 2023)

Declassification Policy for Program Complexity Analysis. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (LICS, 2024)

Branch Sequentialization in Quantum Polytime. - Emmanuel Hainry; Romain Péchoux; Mário Alberto Machado da Silva (CoRR, 2024)

Branch Sequentialization in Quantum Polytime. - Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (FSCD, 2025)

Quantum Programming in Polylogarithmic Time. - Florent Ferrari; Emmanuel Hainry; Romain Péchoux; Mário Silva 001 (MFCS, 2025)

Complete and tractable machine-independent characterizations of second-order polytime. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2025)

Expectation-based Analysis of Higher-Order Quantum Programs. - Martin Avanzini; Alejandro Díaz-Caro; Emmanuel Hainry; Romain Péchoux (CoRR, 2025)