Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Stephen J. Bellantoni
Observed names:
S. Bellantoni,
S. J. Bellantoni,
Stephen Bellantoni
Observed institution:
University of Toronto
OpenAlex ID:
A5023976191
Higher type recursion, ramification and polynomial time
2000
·
Stephen J. Bellantoni
, Karl-Heinz Niggl
, et al.
·
Annals of Pure and Applied Logic
·
72
PDF
Approximation and Small-Depth Frege Proofs
1992
·
Stephen Bellantoni
, Toniann Pitassi
, et al.
·
SIAM Journal on Computing
·
70
Predicative recursion and computational complexity
1992
·
Stephen J. Bellantoni
·
64
A new recursion-theoretic characterization of the polytime functions (extended abstract)
1992
·
Stephen Bellantoni
, Stephen Cook
·
ACM Symposium on Theory of Computing (STOC)
·
58
Grid intersection graphs and boxicity
1993
·
S. Bellantoni
, I. Ben-Arroyo Hartman
, et al.
·
Discrete Mathematics
·
53
PDF
Predicative Recursion and The Polytime Hierarchy
1995
·
Stephen Bellantoni
·
Birkhäuser Boston eBooks
·
43
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
1999
·
Stephen J. Bellantoni
, Karl-Heinz Niggl
·
SIAM Journal on Computing
·
21
A new “feasible” arithmetic
2002
·
Stephen Bellantoni
, Martin Hofmann
·
Journal of Symbolic Logic
·
20
Feasible Computation with Higher Types
2002
·
Helmut Schwichtenberg
, Stephen J. Bellantoni
·
Springer eBooks
·
16
Separating NC along the $delta; axis
2003
·
S. Bellantoni
, I. Oitavem
·
Theoretical Computer Science
·
10
PDF
Approximation and small depth Frege proofs
2002
·
S. Bellantoni
, T. Pitassi
, et al.
·
Structure in Complexity Theory Annual Conference
·
6
Characterizing parallel time by type 2 recursions with polynomial output length
1995
·
Stephen J. Bellantoni
·
Lecture notes in computer science
·
6
Parallel random access machines with bounded memory wordsize
1991
·
Stephen J. Bellantoni
·
Information and Computation
·
5
Ranking arithmetic proofs by implicit ramification
1997
·
Stephen Bellantoni
·
DIMACS series in discrete mathematics and theoretical computer science
·
4
Parallel RAMs with bounded memory wordsize
1989
·
S. J. Bellantoni
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
PDF
Show more works
View as search
Works count:
16
Citation count:
448
H-index:
10
I10-index:
10
Year
Topic
Type
