Stephen J. Bellantoni

According to our database, Stephen J. Bellantoni authored at least 10 papers between 1989 and 2002.

Collaborative distances:

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

2002

A New "Feasible" Arithmetic.

Stephen J. Bellantoni, Martin Hofmann

J. Symb. Log., 2002

2000

Higher type recursion, ramification and polynomial time.

Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg

Ann. Pure Appl. Log., 2000

1999

Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited.

Stephen J. Bellantoni, Karl-Heinz Niggl

SIAM J. Comput., 1999

1996

Ranking arithmetic proofs by implicit ramification.

Stephen J. Bellantoni

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1994

Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length.

Stephen J. Bellantoni

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1992

Predicative recursion and computational complexity.

Stephen J. Bellantoni

PhD thesis, 1992

Approximation and Small-Depth Frege Proofs.

Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart

SIAM J. Comput., 1992

A New Recursion-Theoretic Characterization of the Polytime Functions.

Stephen J. Bellantoni, Stephen A. Cook

Comput. Complex., 1992

A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)

Stephen J. Bellantoni, Stephen A. Cook

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1989

Parallel RAMs with Bounded Memory Wordsize.

Stephen J. Bellantoni

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989