Emmanuel Hainry

Most-cited papers

Polynomial differential equations compute all real computable functions on computable compact intervals
O. Bournez, M. Campagnolo, D. Graça, Emmanuel Hainry
2007Journal of Complexity88 citations Open access
Semantic Scholar
Reachability in Linear Dynamical Systems
Emmanuel Hainry
2008Conference on Computability in Europe43 citations Open access
Semantic Scholar
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation
O. Bournez, M. Campagnolo, D. Graça, Emmanuel Hainry
2006Theory and Applications of Models of Computation38 citations Open access
Semantic Scholar
Recursive Analysis Characterized as a Class of Real Recursive Functions
O. Bournez, Emmanuel Hainry
2006Fundamenta Informaticae34 citations
Semantic Scholar
Elementarily computable functions over the real numbers and R-sub-recursive functions
O. Bournez, Emmanuel Hainry
2005Theoretical Computer Science29 citations Open access
Semantic Scholar
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
O. Bournez, Emmanuel Hainry
2004International Colloquium on Automata, Languages and Programming23 citations
Semantic Scholar
Computation with perturbed dynamical systems
O. Bournez, D. Graça, Emmanuel Hainry
2013Journal of computer and system sciences (Print)16 citations Open access
Semantic Scholar
Decidability and Undecidability in Dynamical Systems
Emmanuel Hainry
200916 citations
Semantic Scholar
Real Recursive Functions and Real Extensions of Recursive Functions
O. Bournez, Emmanuel Hainry
2004Machines, Computations, and Universality16 citations Open access
Semantic Scholar
A programming language characterizing quantum polynomial time
Emmanuel Hainry, Romain P'echoux, M'ario Silva
2022Foundations of Software Science and Computation Structure13 citations Open access
Semantic Scholar
Type-Based Complexity Analysis for Fork Processes
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
2013Foundations of Software Science and Computation Structure13 citations Open access
Semantic Scholar
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2010International Symposium on Algorithms and Computation11 citations Open access
Semantic Scholar
A tier-based typed programming language characterizing Feasible Functionals
Emmanuel Hainry, B. Kapron, Jean-Yves Marion, Romain Péchoux
2020Logic in Computer Science10 citations Open access
Semantic Scholar
Characterizing polynomial time complexity of stream programs using interpretations
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
2015Theoretical Computer Science10 citations Open access
Semantic Scholar
Robust Computations with Dynamical Systems
O. Bournez, D. Graça, Emmanuel Hainry
2010International Symposium on Mathematical Foundations of Computer Science10 citations
Semantic Scholar
Computing Omega-Limit Sets in Linear Dynamical Systems
Emmanuel Hainry
2008International Conference on Unconventional Computation9 citations Open access
Semantic Scholar
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs
Emmanuel Hainry, E. Jeandel, Romain Péchoux, Olivier Zeyen
2021International Colloquium on Theoretical Aspects of Computing7 citations Open access
Semantic Scholar
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions
O. Bournez, Walid Gomaa, Emmanuel Hainry
2011International Journal of Unconventional Computing7 citations
Semantic Scholar
Theory of higher order interpretations and application to Basic Feasible Functions
Emmanuel Hainry, Romain Péchoux
2018Log. Methods Comput. Sci.6 citations Open access
Semantic Scholar
Branch Sequentialization in Quantum Polytime
Emmanuel Hainry, Romain Péchoux, Mário Alberto Machado da Silva
2024International Conference on Formal Structures for Computation and Deduction5 citations
Semantic Scholar
Objects in Polynomial Time
Emmanuel Hainry, Romain Péchoux
2015Asian Symposium on Programming Languages and Systems5 citations Open access
Semantic Scholar
On the Computational Capabilities of Several Models
O. Bournez, Emmanuel Hainry
2007Machines, Computations, and Universality5 citations
Semantic Scholar
A Type-Based Complexity Analysis of Object Oriented Programs
Emmanuel Hainry, Romain Péchoux
2018Information and Computation4 citations Open access
Semantic Scholar
Polynomial dierential equations compute all real computable functions
O. Bournez, M. Campagnolo, D. Graça, Emmanuel Hainry +1 more
20064 citations
Semantic Scholar
A General Noninterference Policy for Polynomial Time
Emmanuel Hainry, Romain Péchoux
2023Proc. ACM Program. Lang.3 citations Open access
Semantic Scholar
Complete and tractable machine-independent characterizations of second-order polytime
Emmanuel Hainry, B. Kapron, Jean-Yves Marion, Romain Péchoux
2022Foundations of Software Science and Computation Structure3 citations Open access
Semantic Scholar
Polynomial Time over the Reals with Parsimony
Emmanuel Hainry, Damiano Mazza, Romain Péchoux
2020Fuji International Symposium on Functional and Logic Programming3 citations Open access
Semantic Scholar
Higher order interpretation for higher order complexity
Emmanuel Hainry, Romain Péchoux
2017Logic Programming and Automated Reasoning3 citations Open access
Semantic Scholar
Resource-Aware Quantum Programming with General Recursion and Quantum Control
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux, Thomas Vinet
2025International Conference on Formal Structures for Computation and Deduction2 citations
Semantic Scholar
Quantum Programming in Polylogarithmic Time
F. Ferrari, Emmanuel Hainry, Romain Péchoux, Mário Silva
2025International Symposium on Mathematical Foundations of Computer Science2 citations
Semantic Scholar
Higher-order interpretations for higher-order complexity
Emmanuel Hainry, Romain Péchoux
20172 citations
Semantic Scholar
A Polytime Quantum Programming Language
Emmanuel Hainry, Romain Péchoux, Mário Silva
2025ACM Transactions on Quantum Computing1 citations Open access
Semantic Scholar
Expectation-based Analysis of Higher-Order Quantum Programs
Martin Avanzini, Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux
2025arXiv.org1 citations
Semantic Scholar
Declassification Policy for Program Complexity Analysis
Emmanuel Hainry, B. Kapron, Jean-Yves Marion, Romain P'echoux
2024Logic in Computer Science1 citations Open access
Semantic Scholar
Type-based heap and stack space analysis in Java
Emmanuel Hainry, Romain Péchoux
20131 citations
Semantic Scholar
Type-based complexity analysis for concurrent programs
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
20121 citations
Semantic Scholar
Quantum Term Rewrite Systems: Applications to Complexity Analysis
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux, Thomas Vinet
2026arXiv.org0 citations
Semantic Scholar
A feasible and unitary programming language with quantum control
Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux, Mário Silva
2023arXiv.org0 citations
Semantic Scholar
A feasible and unitary quantum programming language
Alejandro Díaz-Caro, Emmanuel Hainry, Romain P'echoux, Mário Silva
20230 citations
Semantic Scholar
Tiered complexity at higher order
Emmanuel Hainry, B. Kapron, Jean-Yves Marion, Romain Péchoux
20190 citations
Semantic Scholar
A Framework for Algebraic Characterizations in Recursive Analysis
O. Bournez, Walid Gomaa, Emmanuel Hainry
2016arXiv.org0 citations
Semantic Scholar
Implicit computational complexity in Object Oriented Programs
Emmanuel Hainry, Romain Péchoux
20150 citations
Semantic Scholar
Higher order interpretations for Basic Feasible Functions
Emmanuel Hainry, Romain Péchoux
20150 citations
Semantic Scholar
Types for controlling heap and space in Java
Emmanuel Hainry, Romain Péchoux
20130 citations
Semantic Scholar
Types for controlling heap and stack in Java
Emmanuel Hainry, Romain Péchoux
2013International Workshop on Foundational and Practical Aspects of Resource Analysis0 citations
Semantic Scholar
Polynomial time computable real functions
Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
20100 citations
Semantic Scholar
Algebraic Characterization of Complexity Classes of Computable Real Functions
O. Bournez, Walid Gomaa, Emmanuel Hainry
20090 citations
Semantic Scholar
Implicit complexity in recursive analysis
O. Bournez, Walid Gomaa, Emmanuel Hainry
20090 citations
Semantic Scholar
New Results - Computability and complexity
O. Bournez, D. Graça, Emmanuel Hainry
20060 citations
Semantic Scholar
: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs
Emmanuel Hainry, E. Jeandel, Romain P'echoux, Olivier Zeyen
0 citations
Semantic Scholar