default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsabel Oitavem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone:
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CSL 2024: 10:1-10:19- 2023
- [i2]Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone:
An Arithmetic Theory for the Poly-Time Random Functions. CoRR abs/2301.12028 (2023) - [i1]Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone:
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CoRR abs/2311.15003 (2023) - 2022
- [j10]Ugo Dal Lago, Reinhard Kahle
, Isabel Oitavem:
Implicit recursion-theoretic characterizations of counting classes. Arch. Math. Log. 61(7-8): 1129-1144 (2022) - [j9]Isabel Oitavem:
The polynomial hierarchy of functions and its levels. Theor. Comput. Sci. 900: 25-34 (2022) - 2021
- [c7]Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem:
A Recursion-Theoretic Characterization of the Probabilistic Class PP. MFCS 2021: 35:1-35:12
2010 – 2019
- 2018
- [c6]Anupam Das, Isabel Oitavem:
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. CSL 2018: 18:1-18:17 - 2016
- [j8]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Two function algebras defining functions in NCk boolean circuits. Inf. Comput. 248: 82-103 (2016) - 2013
- [j7]Reinhard Kahle, Isabel Oitavem:
Applicative theories for the polynomial hierarchy of time and its levels. Ann. Pure Appl. Log. 164(6): 663-675 (2013) - [c5]Isabel Oitavem:
From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk). CSL 2013: 24-27 - 2012
- [j6]Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem:
Monotonicity Constraints in Characterizations of PSPACE. J. Log. Comput. 22(2): 179-195 (2012) - 2011
- [j5]Isabel Oitavem:
A recursion-theoretic approach to NP. Ann. Pure Appl. Log. 162(8): 661-666 (2011) - 2010
- [c4]Reinhard Kahle, Isabel Oitavem:
An applicative theory for FPH. CL&C 2010: 44-56
2000 – 2009
- 2008
- [j4]Isabel Oitavem:
Characterizing PSPACE with pointers. Math. Log. Q. 54(3): 323-329 (2008) - [c3]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Recursion Schemata for NCk. CSL 2008: 49-63 - 2006
- [c2]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Towards an Implicit Characterization of NCk. CSL 2006: 212-224 - 2004
- [j3]Isabel Oitavem:
Characterizing NC with tier 0 pointers. Math. Log. Q. 50(1): 9-17 (2004) - [j2]S. Bellantoni, Isabel Oitavem:
Separating NC along the delta axis. Theor. Comput. Sci. 318(1-2): 57-78 (2004) - 2002
- [j1]Isabel Oitavem:
A term rewriting characterization of the functions computable in polynomial space. Arch. Math. Log. 41(1): 35-47 (2002) - 2001
- [c1]Isabel Oitavem:
Implicit Characterizations of Pspace. Proof Theory in Computer Science 2001: 170-190
Coauthor Index
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-06-13 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
