Paulin Jacobé de Naurois

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Safe recursion over an arbitrary structure: PAR, PH and DPH Electronic Notes in Theoretical Computer Science	2013-04-19	Paper
Correctness of linear logic proof structures is NL-complete Theoretical Computer Science	2011-05-10	Paper
Parallel time and quantifier prefixes Computational Complexity	2011-02-18	Paper
Rewriting systems for reachability in vector addition systems with pairs Lecture Notes in Computer Science	2010-08-31	Paper
Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete Computer Science Logic	2009-03-05	Paper
Logical Approaches to Computational Barriers Lecture Notes in Computer Science	2007-04-30	Paper
The complexity of semilinear problems in succinct representation Computational Complexity	2007-01-24	Paper
Fundamentals of Computation Theory Lecture Notes in Computer Science	2006-10-20	Paper
Implicit complexity over an arbitrary structure: Quantifier alternations Information and Computation	2006-04-28	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 1956513 (Why is no real title available?)	2003-07-30	Paper

Research outcomes over time

This page was built for person: Paulin Jacobé de Naurois