| 2008 |
|---|
| 11 | EE | Paulin Jacobé de Naurois,
Virgile Mogbil:
Correctness of Multiplicative Additive Proof Structures is NL-Complete.
LICS 2008: 476-485 |
| 2007 |
|---|
| 10 | EE | Paulin Jacobé de Naurois,
Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete.
CSL 2007: 435-450 |
| 2006 |
|---|
| 9 | EE | Paulin Jacobé de Naurois:
A Measure of Space for Computing over the Reals.
CiE 2006: 231-240 |
| 8 | EE | Paulin Jacobé de Naurois:
A Measure of Space for Computing over the Reals
CoRR abs/cs/0603017: (2006) |
| 7 | EE | Peter Bürgisser,
Felipe Cucker,
Paulin Jacobé de Naurois:
The complexity of semilinear problems in succinct representation.
Computational Complexity 15(3): 197-235 (2006) |
| 6 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Implicit complexity over an arbitrary structure: Quantifier alternations.
Inf. Comput. 204(2): 210-230 (2006) |
| 2005 |
|---|
| 5 | EE | Peter Bürgisser,
Felipe Cucker,
Paulin Jacobé de Naurois:
The Complexity of Semilinear Problems in Succinct Representation.
FCT 2005: 479-490 |
| 4 | EE | 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): 41-58 (2005) |
| 2004 |
|---|
| 3 | | 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: 409-422 |
| 2003 |
|---|
| 2 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.
FoSSaCS 2003: 185-199 |
| 1 | EE | Olivier Bournez,
Felipe Cucker,
Paulin Jacobé de Naurois,
Jean-Yves Marion:
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.
Electr. Notes Theor. Comput. Sci. 90(1): (2003) |
