Publications
Filters: Author is E. Mayordomo [Clear All Filters]
[MayAESET] Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
.
1994.
[AESETPBI] Almost every set in exponential time is P-bi-immune. 629:392-400.
.
1992.
.
2011.
.
2011.
[1307] Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
.
2007.
[1310] Building maintainable, exhaustive human mitochondrial phylogenies. 17 Annual International Conference on Intelligent Systems for Molecular Biology/8th European Conference.
.
2009.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[AmMaZh96] A Comparison of Weak Completeness Notions. :171-178.
.
1996.
[1426] Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports. 2(1)
.
2012.
.
1994.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
[1293] Curves that must be retraced. Information and Computation. 209:992--1006.
.
2011.
[1301] Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
.
2009.
[LoMa05] Dimension is Compression. 3618:676-685.
.
2005.
[1439] Dimension is Compression. Theory of Computing Systems. 52:95-112.
.
2013.
[1438] Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).
.
2012.
[DPSSFc] Dimensions of Points in Self-Similar Fractals. 5092:215-224.
.
2008.
[DPSSF] Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
.
2008.
[EFDAIT] Effective fractal dimension in algorithmic information theory. :259-285.
.
2008.
[MayEHD] Effective Hausdorff dimension. Trends in Logic. 23:171-186.
.
2004.
[AtHiLuMa06] Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
.
2007.
[ESDAICC] Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
.
2004.
[BuhMay97] An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
.
1997.
[BuhMay95] An excursion to the Kolmogorov random strings. :197-203.
.
1995.