Romain Péchoux

From MaRDI portal
Revision as of 18:57, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1640982

Available identifiers

zbMath Open pechoux.romainMaRDI QIDQ1640982

List of research outcomes





PublicationDate of PublicationType
Quantum expectation transformers for cost analysis2024-12-06Paper
Complete and tractable machine-independent characterizations of second-order polytime2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q50941172022-08-02Paper
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs2022-03-31Paper
Polynomial time over the reals with parsimony2021-07-06Paper
A tier-based typed programming language characterizing Feasible Functionals2021-01-21Paper
https://portal.mardi4nfdi.de/entity/Q51443552021-01-15Paper
https://portal.mardi4nfdi.de/entity/Q51416172020-12-18Paper
Quantum programming with inductive datatypes: causality and affine type theory2020-09-23Paper
On the efficiency of normal form systems for representing Boolean functions2020-04-21Paper
Higher order interpretation for higher order complexity2019-01-10Paper
A type-based complexity analysis of object oriented programs2018-06-14Paper
Algebras and coalgebras in the light affine Lambda calculus2017-05-10Paper
Objects in Polynomial Time2016-01-08Paper
Sup-interpretations, a semantic method for static analysis of program resources2015-09-17Paper
Characterizing polynomial time complexity of stream programs using interpretations2015-05-26Paper
Complexity Information Flow in a Multi-threaded Imperative Language2014-04-16Paper
A Categorical Treatment of Malicious Behavioral Obfuscation2014-04-16Paper
Type-Based Complexity Analysis for Fork Processes2013-03-18Paper
Synthesis of sup-interpretations: a survey2013-02-19Paper
https://portal.mardi4nfdi.de/entity/Q31659692012-10-19Paper
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity2010-12-09Paper
Global and Local Space Properties of Stream Programs2010-09-14Paper
Upper Bounds on Stream I/O Using Semantic Interpretations2009-11-12Paper
Quasi-interpretation Synthesis by Decomposition2008-09-17Paper
A Characterization of Alternating Log Time by First Order Functional Programs2008-05-27Paper
A Characterization of NC k by First Order Functional Programs2008-05-27Paper
Resource Analysis by Sup-interpretation2007-05-02Paper

Research outcomes over time

This page was built for person: Romain Péchoux