Publications
] Filters: Author is J.H. Lutz [Clear All Filters]
[1297] .
2012. Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[1438] .
2012. Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).
[1293] .
2011. Curves that must be retraced. Information and Computation. 209:992--1006.
[1302] .
2010. Inseparability and Strong Hypotheses for Disjoint NP Pairs. Twenty-Seventh Symposium on Theoretical Aspects of Computer Science (STACS'10).
[1301] .
2009. Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
[DPSSFc] .
2008. Dimensions of Points in Self-Similar Fractals. 5092:215-224.
[DPSSF] .
2008. Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
[AtHiLuMa06] .
2007. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
[GuLuMa06] .
2006. Points on computable curves. :469–474.
[HiLuMa05] .
2005. The fractal geometry of complexity classes. SIGACT News. 36:24-38.
[FeLuMaRe05] .
2005. Weakly useful sequences. Information and Computation. 197:41-54.
[DGLMM05] .
2005. Zeta-Dimension. 3618:283-294.
[HiLuMaSDNC] .
2004. Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
[ESDAICC] .
2004. Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
[DaLaLuMaFSD] .
2004. Finite state dimension. Theoretical Computer Science. 310:1-33.
[HiLuMaSDNCb] .
2003. Scaled dimension and non uniform complexity. 2719:278-290.
[LutMayTPRBM] .
2001. Twelve problems in resource bounded measure. :83-101.
[DaLaLuMaFSDb] .
2001. Finite state dimension. 2076:1028-1039.
[LutMayTPRBMb] .
1999. Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
[LutMayCVKL] .
1996. Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
[FeLuMaWUS] .
1995. Weakly Useful Sequences. 944:393-404.
[LutMayMSDHL] .
1994. Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
[LutMayCVKLb] .
1994. Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[LutMayMSDHLb] .
1993. Measure stochasticity and the density of hard languages. 665:38-47.
