default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel Hainry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Emmanuel Hainry
, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. LICS 2024: 41:1-41:14- [i8]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Declassification Policy for Program Complexity Analysis. CoRR abs/2401.14957 (2024) - 2023
- [j10]Emmanuel Hainry, Romain Péchoux:
A General Noninterference Policy for Polynomial Time. Proc. ACM Program. Lang. 7(POPL): 806-832 (2023) - [c16]Emmanuel Hainry, Romain Péchoux, Mário Silva:
A Programming Language Characterizing Quantum Polynomial Time. FoSSaCS 2023: 156-175 - [i7]Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux, Mário Silva:
A feasible and unitary programming language with quantum control. CoRR abs/2311.01054 (2023) - 2022
- [j9]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18(1) (2022) - [c15]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS 2022: 368-388 - [i6]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
Complete and tractable machine-independent characterizations of second-order polytime. CoRR abs/2208.14739 (2022) - [i5]Emmanuel Hainry, Romain Péchoux, Mário Silva:
A programming language characterizing quantum polynomial time. CoRR abs/2212.06656 (2022) - 2021
- [c14]Emmanuel Hainry, Emmanuel Jeandel, Romain Péchoux, Olivier Zeyen:
ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs. ICTAC 2021: 357-365 - [i4]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. CoRR abs/2102.11605 (2021) - 2020
- [j8]Emmanuel Hainry, Romain Péchoux:
Theory of higher order interpretations and application to Basic Feasible Functions. Log. Methods Comput. Sci. 16(4) (2020) - [c13]Emmanuel Hainry, Damiano Mazza, Romain Péchoux:
Polynomial Time over the Reals with Parsimony. FLOPS 2020: 50-65 - [c12]Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
A tier-based typed programming language characterizing Feasible Functionals. LICS 2020: 535-549
2010 – 2019
- 2018
- [j7]Emmanuel Hainry, Romain Péchoux:
A type-based complexity analysis of Object Oriented programs. Inf. Comput. 261: 78-115 (2018) - [i3]Emmanuel Hainry, Romain Péchoux:
Theory of higher order interpretations and application to Basic Feasible Functions. CoRR abs/1801.08350 (2018) - [i2]Emmanuel Hainry, Romain Péchoux:
A Type-Based Complexity Analysis of Object Oriented Programs. CoRR abs/1802.06653 (2018) - 2017
- [c11]Emmanuel Hainry, Romain Péchoux:
Higher order interpretation for higher order complexity. LPAR 2017: 269-285 - 2016
- [i1]Olivier Bournez, Walid Gomaa, Emmanuel Hainry:
A Framework for Algebraic Characterizations in Recursive Analysis. CoRR abs/1609.07972 (2016) - 2015
- [j6]Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux:
Characterizing polynomial time complexity of stream programs using interpretations. Theor. Comput. Sci. 585: 41-54 (2015) - [c10]Emmanuel Hainry, Romain Péchoux:
Objects in Polynomial Time. APLAS 2015: 387-404 - 2013
- [j5]Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry:
Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79(5): 714-724 (2013) - [c9]Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux:
Type-Based Complexity Analysis for Fork Processes. FoSSaCS 2013: 305-320 - 2011
- [j4]Olivier Bournez, Walid Gomaa, Emmanuel Hainry:
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. Int. J. Unconv. Comput. 7(5): 331-351 (2011) - 2010
- [c8]Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux:
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. ISAAC (1) 2010: 291-303 - [c7]Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry:
Robust Computations with Dynamical Systems. MFCS 2010: 198-208
2000 – 2009
- 2008
- [c6]Emmanuel Hainry:
Reachability in Linear Dynamical Systems. CiE 2008: 241-250 - [c5]Emmanuel Hainry:
Computing Omega-Limit Sets in Linear Dynamical Systems. UC 2008: 83-95 - 2007
- [j3]Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry:
Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. 23(3): 317-335 (2007) - [c4]Olivier Bournez, Emmanuel Hainry:
On the Computational Capabilities of Several Models. MCU 2007: 12-23 - 2006
- [b1]Emmanuel Hainry:
Modèles de calcul sur les réels, résultats de comparaison. (Computation on the reals.Comparison of some models). National Polytechnic Institute of Lorraine, Nancy, France, 2006 - [j2]Olivier Bournez, Emmanuel Hainry:
Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundam. Informaticae 74(4): 409-433 (2006) - [c3]Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry:
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC 2006: 631-643 - 2005
- [j1]Olivier Bournez, Emmanuel Hainry:
Elementarily computable functions over the real numbers and R-sub-recursive functions. Theor. Comput. Sci. 348(2-3): 130-147 (2005) - 2004
- [c2]Olivier Bournez, Emmanuel Hainry:
An Analog Characterization of Elementarily Computable Functions over the Real Numbers. ICALP 2004: 269-280 - [c1]Olivier Bournez, Emmanuel Hainry:
Real Recursive Functions and Real Extensions of Recursive Functions. MCU 2004: 116-127
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
