Paulin Jacobé de Naurois

Available identifiers

zbMath Open de-naurois.paulin-jacobeMaRDI QIDQ534702

List of research outcomes

Publication	Date of Publication	Type
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH	2013-04-19	Paper
Correctness of linear logic proof structures is NL-complete	2011-05-10	Paper
Parallel time and quantifier prefixes	2011-02-18	Paper
Rewriting Systems for Reachability in Vector Addition Systems with Pairs	2010-08-31	Paper
Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete	2009-03-05	Paper
Logical Approaches to Computational Barriers	2007-04-30	Paper
The complexity of semilinear problems in succinct representation	2007-01-24	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
Implicit complexity over an arbitrary structure: Quantifier alternations	2006-04-28	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/Q4417859	2003-07-30	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: Paulin Jacobé de Naurois