Follow
Jack H. Lutz
Title
Cited by
Cited by
Year
Almost everywhere high nonuniform complexity
JH Lutz
Journal of Computer and System Sciences 44 (2), 220-258, 1992
3391992
The dimensions of individual strings and sequences
JH Lutz
Information and Computation 187 (1), 49-79, 2003
2592003
Dimension in complexity classes
JH Lutz
SIAM Journal on Computing 32 (5), 1236-1259, 2003
2232003
The quantitative structure of exponential time
JH Lutz
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993
1961993
The quantitative structure of exponential time
JH Lutz
[1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993
1961993
Category and measure in complexity classes
JH Lutz
SIAM Journal on Computing 19 (6), 1100-1131, 1990
1511990
The tile assembly model is intrinsically universal
D Doty, JH Lutz, MJ Patitz, RT Schweller, SM Summers, D Woods
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 302-310, 2012
1212012
Randomness and complexity
Y Wang
BULLETIN-EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE 62, 347-348, 1997
1211997
Strict self-assembly of discrete Sierpinski triangles
JI Lathrop, JH Lutz, SM Summers
Theoretical Computer Science 410 (4-5), 384-405, 2009
1112009
Effective strong dimension in algorithmic information and computational complexity
KB Athreya, JM Hitchcock, JH Lutz, E Mayordomo
SIAM journal on computing 37 (3), 671-705, 2007
1082007
Finite-state dimension
JJ Dai, JI Lathrop, JH Lutz, E Mayordomo
Theoretical Computer Science 310 (1-3), 1-33, 2004
1062004
The complexity and distribution of hard problems
DW Juedes, JH Lutz
SIAM Journal on Computing 24 (2), 279-295, 1995
981995
Gales and the constructive dimension of individual sequences
JH Lutz
Automata, Languages and Programming: 27th International Colloquium, ICALP …, 2000
942000
Cook versus Karp-Levin: Separating completeness notions if NP is not small
JH Lutz, E Mayordomo
Theoretical Computer Science 164 (1-2), 141-163, 1996
921996
Effective strong dimension in algorithmic information and computational complexity
KB Athreya, JM Hitchcock, JH Lutz, E Mayordomo
STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004
812004
Effective strong dimension in algorithmic information and computational complexity
KB Athreya, JM Hitchcock, JH Lutz, E Mayordomo
STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004
812004
Weak completeness in E and E2
DW Juedes, JH Lutz
Theoretical Computer Science 143 (1), 149-158, 1995
761995
The complexity and distribution of hard problems
DW Juedes, JH Lutz
SIAM Journal on Computing 24 (2), 279-295, 1995
721995
Measure, stochasticity, and the density of hard languages
JH Lutz, E Mayordomo
SIAM Journal on Computing 23 (4), 762-779, 1994
711994
Effective fractal dimensions
JH Lutz
Mathematical Logic Quarterly 51 (1), 62-72, 2005
672005
The system can't perform the operation now. Try again later.
Articles 1–20