Emmanuel Hainry

Available identifiers

zbMath Open hainry.emmanuelMaRDI QIDQ355514

List of research outcomes

Publication	Date of Publication	Type
Complete and tractable machine-independent characterizations of second-order polytime	2024-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q5094117	2022-08-02	Paper
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs	2022-03-31	Paper
Polynomial time over the reals with parsimony	2021-07-06	Paper
A tier-based typed programming language characterizing Feasible Functionals	2021-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q5141617	2020-12-18	Paper
Higher order interpretation for higher order complexity	2019-01-10	Paper
A type-based complexity analysis of object oriented programs	2018-06-14	Paper
Objects in Polynomial Time	2016-01-08	Paper
Characterizing polynomial time complexity of stream programs using interpretations	2015-05-26	Paper
Computation with perturbed dynamical systems	2013-07-24	Paper
Type-Based Complexity Analysis for Fork Processes	2013-03-18	Paper
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity	2010-12-09	Paper
Robust Computations with Dynamical Systems	2010-09-03	Paper
On the Computational Capabilities of Several Models	2009-03-05	Paper
Computing Omega-Limit Sets in Linear Dynamical Systems	2008-12-02	Paper
Reachability in Linear Dynamical Systems	2008-06-19	Paper
Polynomial differential equations compute all real computable functions on computable compact intervals	2007-07-04	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
https://portal.mardi4nfdi.de/entity/Q3416089	2007-01-19	Paper
Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions	2006-01-09	Paper
Machines, Computations, and Universality	2005-12-08	Paper
Automata, Languages and Programming	2005-08-24	Paper

Research outcomes over time

This page was built for person: Emmanuel Hainry