Publications

Export 24 results:
Sort by: [ Author (Desc)] Title Type Year
Filters: Author is J.H. Lutz  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
L
[LutMayTPRBM] Lutz, JH, Mayordomo E.  2001.  Twelve problems in resource bounded measure. :83-101.
[LutMayTPRBMb] Lutz, JH, Mayordomo E.  1999.  Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
0 icon
99_LM_BEATCS.ps
H
[HiLuMaSDNC] Hitchcock, JM, Lutz JH, Mayordomo E.  2004.  Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
0 icon
sdnc.ps
D
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
0 icon
fsd.ps
L
[LutMayCVKL] Lutz, JH, Mayordomo E.  1996.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
0 icon
96_LM_TCS.ps
[LutMayMSDHL] Lutz, JH, Mayordomo E.  1994.  Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
0 icon
94_LM_SIAMJoC.ps
H
[HiLuMaSDNCb] Hitchcock, JM, Lutz JH, Mayordomo E.  2003.  Scaled dimension and non uniform complexity. 2719:278-290.
D
[DaLaLuMaFSDb] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2001.  Finite state dimension. 2076:1028-1039.
F
[FeLuMaWUS] Fenner, SA, Lutz JH, Mayordomo E.  1995.  Weakly Useful Sequences. 944:393-404.
0 icon
95_FLM_ICALP.ps
L
[LutMayCVKLb] Lutz, JH, Mayordomo E.  1994.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[LutMayMSDHLb] Lutz, JH, Mayordomo E.  1993.  Measure stochasticity and the density of hard languages. 665:38-47.
H
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
A
[AtHiLuMa06] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2007.  Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
0 icon
esdaicc.pdf
F
[FeLuMaRe05] Fenner, SA, Lutz JH, Mayordomo E, Reardon P.  2005.  Weakly useful sequences. Information and Computation. 197:41-54.
0 icon
wus.pdf
A
[ESDAICC] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2004.  Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
D
[DGLMM05] Doty, D, Gu X, Lutz JH, Mayordomo E, Moser P.  2005.  Zeta-Dimension. 3618:283-294.
0 icon
zeta.pdf
G
[GuLuMa06] Gu, X, Lutz JH, Mayordomo E.  2006.  Points on computable curves. :469–474.
0 icon
pcc.pdf
L
[DPSSFc] Lutz, JH, Mayordomo E.  2008.  Dimensions of Points in Self-Similar Fractals. 5092:215-224.
[DPSSF] Lutz, JH, Mayordomo E.  2008.  Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
G
[1293] Gu, X, Lutz JH, Mayordomo E.  2011.  Curves that must be retraced. Information and Computation. 209:992--1006.
M
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[1301] Mayordomo, E, Lutz JH, Gu X.  2009.  Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
[1302] Mayordomo, E, Lutz JH, Fortnow L.  2010.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Twenty-Seventh Symposium on Theoretical Aspects of Computer Science (STACS'10).
[1438] Mayordomo, E, Lutz JH, Gu X, Moser P.  2012.  Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).