Paulin Jacobé de Naurois

From MaRDI portal
Person:534702

Available identifiers

zbMath Open de-naurois.paulin-jacobeMaRDI QIDQ534702

List of research outcomes





PublicationDate of PublicationType
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH2013-04-19Paper
Correctness of linear logic proof structures is NL-complete2011-05-10Paper
Parallel time and quantifier prefixes2011-02-18Paper
Rewriting Systems for Reachability in Vector Addition Systems with Pairs2010-08-31Paper
Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete2009-03-05Paper
Logical Approaches to Computational Barriers2007-04-30Paper
The complexity of semilinear problems in succinct representation2007-01-24Paper
Fundamentals of Computation Theory2006-10-20Paper
Implicit complexity over an arbitrary structure: Quantifier alternations2006-04-28Paper
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time2005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q46734222005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q44178592003-07-30Paper

Research outcomes over time

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:534702&oldid=7196892"
Powered by MediaWiki