Paulin Jacobé de Naurois

18 papers A* 1B 5C 1Journal 6Unranked 4

Year	Rank	Type	Title / Venue / Authors
2022	B	`conf`	Parallelism in Soft Linear Logic. CSL Paulin Jacobé de Naurois
2019	B	`conf`	Pointers in Recursion: Exploring the Tropics. FSCD Paulin Jacobé de Naurois
2019	—	`conf`	Pointers in Recursion: Exploring the Tropics. DICE-FOPARA@ETAPS Paulin Jacobé de Naurois
2011	J	`jnl`	Correctness of linear logic proof structures is NL-complete. Theor. Comput. Sci. Paulin Jacobé de Naurois, Virgile Mogbil
2010	—	`conf`	Rewriting Systems for Reachability in Vector Addition Systems with Pairs. RP Paulin Jacobé de Naurois, Virgile Mogbil
2009	J	`jnl`	Parallel Time and Quantifier Prefixes. Comput. Complex. Felipe Cucker, Paulin Jacobé de Naurois
2008	A*	`conf`	Correctness of Multiplicative Additive Proof Structures is NL-Complete. LICS Paulin Jacobé de Naurois, Virgile Mogbil
2007	B	`conf`	Correctness of Multiplicative (and Exponential) Proof Structures is CSL Paulin Jacobé de Naurois, Virgile Mogbil
2006	J	`jnl`	A Measure of Space for Computing over the Reals CoRR Paulin Jacobé de Naurois
2006	C	`conf`	A Measure of Space for Computing over the Reals. CiE Paulin Jacobé de Naurois
2006	J	`jnl`	Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2006	J	`jnl`	The complexity of semilinear problems in succinct representation. Comput. Complex. Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
2005	J	`jnl`	Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2005	B	`conf`	The Complexity of Semilinear Problems in Succinct Representation. FCT Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
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
2004	—	`conf`	Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003	B	`conf`	Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003	—	`conf`	Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. ICC@LICS Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion