Export 64 results:
Sort by: Author Title [ Type (Asc)] Year
Filters: Author is E. Mayordomo  [Clear All Filters]
Conference Paper
[AESETPBI] Mayordomo, E.  1992.  Almost every set in exponential time is P-bi-immune. 629:392-400.
[1310] Mayordomo, E, Blanco R.  2009.  Building maintainable, exhaustive human mitochondrial phylogenies. 17 Annual International Conference on Intelligent Systems for Molecular Biology/8th European Conference.
[BaHeMa92] Balcázar, JL, Hermo M, Mayordomo E.  1992.  Characterizations of logarithmic advice complexity classes. :315-321.
[AmMaZh96] Ambos-Spies, K, Mayordomo E, Zheng X.  1996.  A Comparison of Weak Completeness Notions. :171-178.
[LutMayCVKLb] Lutz, JH, Mayordomo E.  1994.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[1301] Mayordomo, E, Lutz JH, Gu X.  2009.  Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
[LoMa05] López-Valdés, M, Mayordomo E.  2005.  Dimension is Compression. 3618:676-685.
[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).
[DPSSFc] Lutz, JH, Mayordomo E.  2008.  Dimensions of Points in Self-Similar Fractals. 5092:215-224.
[MayEHD] Mayordomo, E.  2004.  Effective Hausdorff dimension. Trends in Logic. 23:171-186.
[ESDAICC] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2004.  Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
[BuhMay95] Buhrman, H, Mayordomo E.  1995.  An excursion to the Kolmogorov random strings. :197-203.
[1309] Mayordomo, E, Blanco R.  2009.  Exhaustive mitochondrial phylogenetics: challenges and solutions. 9th Workshop on Algorithms in Bioinformatics (WABI 2009).
[DaLaLuMaFSDb] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2001.  Finite state dimension. 2076:1028-1039.
[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).
[LutMayMSDHLb] Lutz, JH, Mayordomo E.  1993.  Measure stochasticity and the density of hard languages. 665:38-47.
[MayMP] Mayordomo, E.  1994.  Measuring in PSPACE. 6:93-100.
[BalMay95] Balcázar, JL, Mayordomo E.  1995.  A note on genericity and bi immunity. :193-196.
[GuLuMa06] Gu, X, Lutz JH, Mayordomo E.  2006.  Points on computable curves. :469–474.
[1299] Mayordomo, E, Moser P.  2009.  polylog space compression is incomparable with Lempel-Ziv and pushdown compression.
[AMMP08] Albert, P, Mayordomo E, Moser P, Perifel S.  2008.  Pushdown compression. :39-48.
[AMWZ96] Ambos-Spies, K, Mayordomo E, Wang Y, Zheng X.  1996.  Resource bounded balanced genericity stochasticity and weak randomness. 1046:63-74.