![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Paulin Jacobé de Naurois
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c11]Paulin Jacobé de Naurois:
Parallelism in Soft Linear Logic. CSL 2022: 26:1-26:16
2010 – 2019
- 2019
- [c10]Paulin Jacobé de Naurois:
Pointers in Recursion: Exploring the Tropics. FSCD 2019: 29:1-29:18 - [c9]Paulin Jacobé de Naurois:
Pointers in Recursion: Exploring the Tropics. DICE-FOPARA@ETAPS 2019: 31-45 - 2011
- [j5]Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of linear logic proof structures is NL-complete. Theor. Comput. Sci. 412(20): 1941-1957 (2011) - 2010
- [c8]Paulin Jacobé de Naurois, Virgile Mogbil:
Rewriting Systems for Reachability in Vector Addition Systems with Pairs. RP 2010: 133-145
2000 – 2009
- 2009
- [j4]Felipe Cucker
, Paulin Jacobé de Naurois:
Parallel Time and Quantifier Prefixes. Comput. Complex. 18(4): 527-550 (2009) - 2008
- [c7]Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative Additive Proof Structures is NL-Complete. LICS 2008: 476-485 - 2007
- [c6]Paulin Jacobé de Naurois, Virgile Mogbil:
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. CSL 2007: 435-450 - 2006
- [j3]Peter Bürgisser, Felipe Cucker
, Paulin Jacobé de Naurois:
The complexity of semilinear problems in succinct representation. Comput. Complex. 15(3): 197-235 (2006) - [j2]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) - [c5]Paulin Jacobé de Naurois:
A Measure of Space for Computing over the Reals. CiE 2006: 231-240 - [i1]Paulin Jacobé de Naurois:
A Measure of Space for Computing over the Reals. CoRR abs/cs/0603017 (2006) - 2005
- [j1]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) - [c4]Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois:
The Complexity of Semilinear Problems in Succinct Representation. FCT 2005: 479-490 - 2004
- [b1]Paulin Jacobé de Naurois:
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). National Polytechnic Institute of Lorraine, Nancy, France, 2004 - [c3]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
- [c2]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 - [c1]Olivier Bournez, Felipe Cucker
, Paulin Jacobé de Naurois, Jean-Yves Marion:
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. ICC@LICS 2003: 3-14
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint