Isabel Oitavem

22 papers B 6C 1Journal 13Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	C	`ed.`	Crossroads of Computability and Logic: Insights, Inspirations, and Innovations - 21st Conference on Computability in Europe, CiE 2025, Lisbon, Portugal, July 14-18, 2025, Proceedings CiE Arnold Beckmann, Isabel Oitavem, Florin Manea
2025	J	`jnl`	Numeral completeness of weak theories of arithmetic. J. Log. Comput. Reinhard Kahle, Isabel Oitavem, Paulo Guilherme Santos
2024	B	`conf`	Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CSL Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone
2023	J	`jnl`	An Arithmetic Theory for the Poly-Time Random Functions. CoRR Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone
2023	J	`jnl`	Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories. CoRR Melissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone
2022	J	`jnl`	Implicit recursion-theoretic characterizations of counting classes. Arch. Math. Log. Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem
2022	J	`jnl`	The polynomial hierarchy of functions and its levels. Theor. Comput. Sci. Isabel Oitavem
2021	B	`conf`	A Recursion-Theoretic Characterization of the Probabilistic Class PP. MFCS Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem
2018	B	`conf`	A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. CSL Anupam Das, Isabel Oitavem
2016	J	`jnl`	Two function algebras defining functions in NC Inf. Comput. Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2013	J	`jnl`	Applicative theories for the polynomial hierarchy of time and its levels. Ann. Pure Appl. Log. Reinhard Kahle, Isabel Oitavem
2013	B	`conf`	From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk). CSL Isabel Oitavem
2012	J	`jnl`	Monotonicity Constraints in Characterizations of PSPACE. J. Log. Comput. Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem
2011	J	`jnl`	A recursion-theoretic approach to NP. Ann. Pure Appl. Log. Isabel Oitavem
2010	—	`conf`	An applicative theory for FPH CL&C Reinhard Kahle, Isabel Oitavem
2008	J	`jnl`	Characterizing PSPACE with pointers. Math. Log. Q. Isabel Oitavem
2008	B	`conf`	Recursion Schemata for NCk. CSL Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2006	B	`conf`	Towards an Implicit Characterization of CSL Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2004	J	`jnl`	Characterizing Math. Log. Q. Isabel Oitavem
2004	J	`jnl`	Separating Theor. Comput. Sci. S. Bellantoni, Isabel Oitavem
2002	J	`jnl`	A term rewriting characterization of the functions computable in polynomial space. Arch. Math. Log. Isabel Oitavem
2001	—	`conf`	Implicit Characterizations of Pspace. Proof Theory in Computer Science Isabel Oitavem