Isabel Oitavem

According to our database, Isabel Oitavem authored at least 19 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories.

Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

An Arithmetic Theory for the Poly-Time Random Functions.

Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone

CoRR, 2023

2022

The polynomial hierarchy of functions and its levels.

Isabel Oitavem

Theor. Comput. Sci., 2022

Implicit recursion-theoretic characterizations of counting classes.

Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem

Arch. Math. Log., 2022

2021

A Recursion-Theoretic Characterization of the Probabilistic Class PP.

Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2018

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions.

Anupam Das, Isabel Oitavem

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2016

Two function algebras defining functions in NC^k boolean circuits.

Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem

Inf. Comput., 2016

2013

Applicative theories for the polynomial hierarchy of time and its levels.

Reinhard Kahle, Isabel Oitavem

Ann. Pure Appl. Log., 2013

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

Isabel Oitavem

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Monotonicity Constraints in Characterizations of PSPACE.

Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem

J. Log. Comput., 2012

2011

A recursion-theoretic approach to NP.

Isabel Oitavem

Ann. Pure Appl. Log., 2011

2010

An applicative theory for FPH

Reinhard Kahle, Isabel Oitavem

Proceedings of the Proceedings Third International Workshop on Classical Logic and Computation, 2010

2008

Characterizing PSPACE with pointers.

Isabel Oitavem

Math. Log. Q., 2008

Recursion Schemata for NCk.

Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2006

Towards an Implicit Characterization of <i>NC</i>^<i>k</i>.

Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2004

Separating <i>NC</i> along the delta axis.

S. Bellantoni, Isabel Oitavem

Theor. Comput. Sci., 2004

Characterizing <i>NC</i> with tier 0 pointers.

Isabel Oitavem

Math. Log. Q., 2004

2002

A term rewriting characterization of the functions computable in polynomial space.

Isabel Oitavem

Arch. Math. Log., 2002

2001

Implicit Characterizations of Pspace.

Isabel Oitavem

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001