Stephen J. Bellantoni

Publication Activity (10 Years)

Years Active: 1989-2002
Publications (10 Years): 0

Publications

Stephen J. Bellantoni, Martin Hofmann
A New "Feasible" Arithmetic. J. Symb. Log. 67 (1) (2002)
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104 (1-3) (2000)
Stephen J. Bellantoni, Karl-Heinz Niggl
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. SIAM J. Comput. 29 (2) (1999)
Stephen J. Bellantoni
Ranking arithmetic proofs by implicit ramification. Proof Complexity and Feasible Arithmetics (1996)
Stephen J. Bellantoni
Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length. LCC (1994)
Stephen J. Bellantoni, Stephen A. Cook
A New Recursion-Theoretic Characterization of the Polytime Functions. Comput. Complex. 2 (1992)
Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
Approximation and Small-Depth Frege Proofs. SIAM J. Comput. 21 (6) (1992)
Stephen J. Bellantoni, Stephen A. Cook
A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) STOC (1992)
Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart
Approximation and Small Depth Frege Proofs. Computational Complexity Conference (1991)
Stephen J. Bellantoni
Parallel RAMs with Bounded Memory Wordsize. SPAA (1989)