Jean-Yves Marion

Available identifiers

zbMath Open marion.jean-yvesMaRDI QIDQ235589

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
A tier-based typed programming language characterizing Feasible Functionals	2021-01-21	Paper
Primitive recursion in the abstract	2020-03-11	Paper
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits	2016-05-03	Paper
Sup-interpretations, a semantic method for static analysis of program resources	2015-09-17	Paper
An Implicit Characterization of PSPACE	2015-09-17	Paper
From Turing machines to computer viruses	2015-08-21	Paper
A logical account of pspace	2014-09-12	Paper
Complexity Information Flow in a Multi-threaded Imperative Language	2014-04-16	Paper
Soft Linear Logic and Polynomial Complexity Classes	2013-12-13	Paper
Evolving Graph-Structures and Their Implicit Computational Complexity	2013-08-07	Paper
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH	2013-04-19	Paper
Type-Based Complexity Analysis for Fork Processes	2013-03-18	Paper
https://portal.mardi4nfdi.de/entity/Q3165969	2012-10-19	Paper
Quasi-interpretations. A way to control resources	2011-06-06	Paper
On tiered small jump operators	2009-04-29	Paper
Towards an Implicit Characterization of NC k	2009-03-12	Paper
Predicative Analysis of Feasibility and Diagonalization	2009-03-10	Paper
Recursion Schemata for NC k	2008-11-20	Paper
Quasi-interpretation Synthesis by Decomposition	2008-09-17	Paper
Learning discrete categorial grammars from structures	2008-07-21	Paper
A Characterization of NC k by First Order Functional Programs	2008-05-27	Paper
A Characterization of Alternating Log Time by First Order Functional Programs	2008-05-27	Paper
A Classification of Viruses Through Recursion Theorems	2007-11-13	Paper
Learning tree languages from positive examples and membership queries	2007-09-18	Paper
Resource Analysis by Sup-interpretation	2007-05-02	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2007-05-02	Paper
Theoretical Aspects of Computing – ICTAC 2005	2006-11-01	Paper
Implicit complexity over an arbitrary structure: Quantifier alternations	2006-04-28	Paper
Term Rewriting and Applications	2005-11-11	Paper
Algorithmic Learning Theory	2005-08-18	Paper
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time	2005-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q4673422	2005-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q4475109	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4474861	2004-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q4417859	2003-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q4785504	2003-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q2767004	2002-07-22	Paper
Kolmogorov complexity and non-determinism	2002-03-03	Paper
Algorithms with polynomial interpretation termination proof	2001-09-09	Paper
From multiple sequent for additive linear logic to decision procedures for free lattices	2000-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4263809	1999-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4376063	1998-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q4281479	1994-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q3142166	1993-12-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jean-Yves Marion