Paulin Jacobé de Naurois

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 3

Top Venues

DICE-FOPARA@ETAPS

FSCD

CSL

National Polytechnic Institute of Lorraine, Nancy, France (PHD)

Education History

National Polytechnic Institute of Lorraine, Nancy, France

PHD

Publications

Paulin Jacobé de Naurois
Parallelism in Soft Linear Logic. CSL (2022)
Paulin Jacobé de Naurois
Pointers in Recursion: Exploring the Tropics. FSCD (2019)
Paulin Jacobé de Naurois
Pointers in Recursion: Exploring the Tropics. DICE-FOPARA@ETAPS (2019)
Paulin Jacobé de Naurois, Virgile Mogbil
Correctness of linear logic proof structures is NL-complete. Theor. Comput. Sci. 412 (20) (2011)
Paulin Jacobé de Naurois, Virgile Mogbil
Rewriting Systems for Reachability in Vector Addition Systems with Pairs. RP (2010)
Felipe Cucker, Paulin Jacobé de Naurois
Parallel Time and Quantifier Prefixes. Comput. Complex. 18 (4) (2009)
Paulin Jacobé de Naurois, Virgile Mogbil
Correctness of Multiplicative Additive Proof Structures is NL-Complete. LICS (2008)
Paulin Jacobé de Naurois, Virgile Mogbil
-Complete. CSL (2007)
Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
The complexity of semilinear problems in succinct representation. Comput. Complex. 15 (3) (2006)
Paulin Jacobé de Naurois
A Measure of Space for Computing over the Reals CoRR (2006)
Paulin Jacobé de Naurois
A Measure of Space for Computing over the Reals. CiE (2006)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204 (2) (2006)
Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
The Complexity of Semilinear Problems in Succinct Representation. FCT (2005)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. 15 (1) (2005)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS (2004)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electron. Notes Theor. Comput. Sci. 90 (2003)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS (2003)

Paulin Jacobé de Naurois.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paulin Jacobé de Naurois