| Publication | Date of Publication | Type |
|---|
| Theoretical computer science: computability, decidability and logic | 2024-09-11 | Paper |
| Theoretical computer science: computational complexity | 2024-09-11 | Paper |
Complete and tractable machine-independent characterizations of second-order polytime
Lecture Notes in Computer Science | 2024-01-23 | Paper |
A tier-based typed programming language characterizing feasible functionals
(available as arXiv preprint) | 2022-08-02 | Paper |
| A tier-based typed programming language characterizing feasible functionals | 2022-08-02 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A tier-based typed programming language characterizing Feasible Functionals
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Primitive recursion in the abstract
Mathematical Structures in Computer Science | 2020-03-11 | Paper |
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
Information and Computation | 2016-05-03 | Paper |
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
An implicit characterization of PSPACE
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
From Turing machines to computer viruses
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
A logical account of pspace
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
Complexity information flow in a multi-threaded imperative language
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Soft linear logic and polynomial complexity classes
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
Evolving Graph-Structures and Their Implicit Computational Complexity
Automata, Languages, and Programming | 2013-08-07 | Paper |
Safe recursion over an arbitrary structure: PAR, PH and DPH
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Type-Based Complexity Analysis for Fork Processes
Lecture Notes in Computer Science | 2013-03-18 | Paper |
| Analyzing the implicit computational complexity of object-oriented programs | 2012-10-19 | Paper |
Quasi-interpretations. A way to control resources
Theoretical Computer Science | 2011-06-06 | Paper |
On tiered small jump operators
Logical Methods in Computer Science | 2009-04-29 | Paper |
Towards an Implicit Characterization of NC k
Computer Science Logic | 2009-03-12 | Paper |
Predicative Analysis of Feasibility and Diagonalization
Lecture Notes in Computer Science | 2009-03-10 | Paper |
Recursion Schemata for NC k
Computer Science Logic | 2008-11-20 | Paper |
Quasi-interpretation Synthesis by Decomposition
Theoretical Aspects of Computing – ICTAC 2007 | 2008-09-17 | Paper |
Learning discrete categorial grammars from structures
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
A Characterization of Alternating Log Time by First Order Functional Programs
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
A Characterization of NC k by First Order Functional Programs
Lecture Notes in Computer Science | 2008-05-27 | Paper |
A Classification of Viruses Through Recursion Theorems
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Learning tree languages from positive examples and membership queries
Theoretical Computer Science | 2007-09-18 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Resource Analysis by Sup-interpretation
Functional and Logic Programming | 2007-05-02 | Paper |
Theoretical Aspects of Computing – ICTAC 2005
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation | 2006-04-28 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
Journal Of Logic And Computation | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2163035 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2084367 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2079048 (Why is no real title available?) | 2004-07-21 | Paper |
| scientific article; zbMATH DE number 1956513 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1848310 (Why is no real title available?) | 2003-02-25 | Paper |
| scientific article; zbMATH DE number 1696756 (Why is no real title available?) | 2002-07-22 | Paper |
Kolmogorov complexity and non-determinism
Theoretical Computer Science | 2002-03-03 | Paper |
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming | 2001-09-09 | Paper |
From multiple sequent for additive linear logic to decision procedures for free lattices
Theoretical Computer Science | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1342224 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1114345 (Why is no real title available?) | 1998-06-01 | Paper |
| scientific article; zbMATH DE number 512786 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 445159 (Why is no real title available?) | 1993-12-05 | Paper |
