Parallel RAMs with Bounded Memory Wordsize. - Stephen J. Bellantoni (SPAA, 1989)

A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) - Stephen J. Bellantoni; Stephen A. Cook (STOC, 1992)

A New Recursion-Theoretic Characterization of the Polytime Functions. - Stephen J. Bellantoni; Stephen A. Cook (Comput. Complex., 1992)

Approximation and Small-Depth Frege Proofs. - Stephen J. Bellantoni; Toniann Pitassi; Alasdair Urquhart (SIAM J. Comput., 1992)

Predicative recursion and computational complexity. - Stephen J. Bellantoni (1992)

Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. - Stephen J. Bellantoni (LCC, 1994)

Ranking arithmetic proofs by implicit ramification. - Stephen J. Bellantoni (Proof Complexity and Feasible Arithmetics, 1996)

Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. - Stephen J. Bellantoni; Karl-Heinz Niggl (SIAM J. Comput., 1999)

Higher type recursion, ramification and polynomial time. - Stephen J. Bellantoni; Karl-Heinz Niggl; Helmut Schwichtenberg (Ann. Pure Appl. Log., 2000)

A New "Feasible" Arithmetic. - Stephen J. Bellantoni; Martin Hofmann 001 (J. Symb. Log., 2002)