Implicit Characterizations of Pspace. - Isabel Oitavem (Proof Theory in Computer Science, 2001)

A term rewriting characterization of the functions computable in polynomial space. - Isabel Oitavem (Arch. Math. Log., 2002)

Characterizing NC with tier 0 pointers. - Isabel Oitavem (Math. Log. Q., 2004)

Separating NC along the delta axis. - S. Bellantoni; Isabel Oitavem (Theor. Comput. Sci., 2004)

Towards an Implicit Characterization of NCk. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (CSL, 2006)

Recursion Schemata for NCk. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (CSL, 2008)

Characterizing PSPACE with pointers. - Isabel Oitavem (Math. Log. Q., 2008)

An applicative theory for FPH - Reinhard Kahle; Isabel Oitavem (CL&C, 2010)

A recursion-theoretic approach to NP. - Isabel Oitavem (Ann. Pure Appl. Log., 2011)

Monotonicity Constraints in Characterizations of PSPACE. - Amir M. Ben-Amram; Bruno Loff; Isabel Oitavem (J. Log. Comput., 2012)

From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk). - Isabel Oitavem (CSL, 2013)

Applicative theories for the polynomial hierarchy of time and its levels. - Reinhard Kahle; Isabel Oitavem (Ann. Pure Appl. Log., 2013)

Two function algebras defining functions in NCk boolean circuits. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (Inf. Comput., 2016)

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. - Anupam Das 002; Isabel Oitavem (CSL, 2018)

A Recursion-Theoretic Characterization of the Probabilistic Class PP. - Ugo Dal Lago; Reinhard Kahle; Isabel Oitavem (MFCS, 2021)

Implicit recursion-theoretic characterizations of counting classes. - Ugo Dal Lago; Reinhard Kahle; Isabel Oitavem (Arch. Math. Log., 2022)

The polynomial hierarchy of functions and its levels. - Isabel Oitavem (Theor. Comput. Sci., 2022)

An Arithmetic Theory for the Poly-Time Random Functions. - Melissa Antonelli; Ugo Dal Lago; Davide Davoli 001; Isabel Oitavem; Paolo Pistone (CoRR, 2023)

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. - Melissa Antonelli; Ugo Dal Lago; Davide Davoli 001; Isabel Oitavem; Paolo Pistone (CSL, 2024)

Numeral completeness of weak theories of arithmetic. - Reinhard Kahle; Isabel Oitavem; Paulo Guilherme Santos (J. Log. Comput., 2025)