Paulin Jacobé de Naurois

According to our database, Paulin Jacobé de Naurois authored at least 15 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Parallelism in Soft Linear Logic.

Paulin Jacobé de Naurois

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2019

Pointers in Recursion: Exploring the Tropics.

Paulin Jacobé de Naurois

Proceedings of the Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, 2019

2011

Correctness of linear logic proof structures is NL-complete.

Paulin Jacobé de Naurois, Virgile Mogbil

Theor. Comput. Sci., 2011

2010

Rewriting Systems for Reachability in Vector Addition Systems with Pairs.

Paulin Jacobé de Naurois, Virgile Mogbil

Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009

Parallel Time and Quantifier Prefixes.

Felipe Cucker, Paulin Jacobé de Naurois

Comput. Complex., 2009

2008

Correctness of Multiplicative Additive Proof Structures is NL-Complete.

Paulin Jacobé de Naurois, Virgile Mogbil

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Correctness of Multiplicative (and Exponential) Proof Structures is <i>NL</i> -Complete.

Paulin Jacobé de Naurois, Virgile Mogbil

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Implicit complexity over an arbitrary structure: Quantifier alternations.

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion

Inf. Comput., 2006

The complexity of semilinear problems in succinct representation.

Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois

Comput. Complex., 2006

A Measure of Space for Computing over the Reals.

Paulin Jacobé de Naurois

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion

J. Log. Comput., 2005

2004

Completeness results and syntactic characterizations of complexity classes over arbitrary structures. (Résultats de complétude et caractérisations syntaxiques de classes de complexité sur des structures arbitraires).

Paulin Jacobé de Naurois

PhD thesis, 2004

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion

Proceedings of the Foundations of Software Science and Computational Structures, 2003