Publications

Export 64 results:
Sort by: Author Title Type [ Year (Asc)]
Filters: Author is E. Mayordomo  [Clear All Filters]
2004
[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
[ESDAICC] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2004.  Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
[HiLoMa04] Hitchcock, JM, López-Valdés M, Mayordomo E.  2004.  Scaled dimension and the Kolmogorov complexity of Turing-hard sets. 3153:476-487.
[1298] Mayordomo, E.  2004.  P vs NP. Monografías de la Real Academia de Ciencias de Zaragoza. 26:57-68.
2005
[FeLuMaRe05] Fenner, SA, Lutz JH, Mayordomo E, Reardon P.  2005.  Weakly useful sequences. Information and Computation. 197:41-54.
0 icon
wus.pdf
[DGLMM05] Doty, D, Gu X, Lutz JH, Mayordomo E, Moser P.  2005.  Zeta-Dimension. 3618:283-294.
0 icon
zeta.pdf
[LoMa05] López-Valdés, M, Mayordomo E.  2005.  Dimension is Compression. 3618:676-685.
0 icon
dic.pdf
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
2006
[GuLuMa06] Gu, X, Lutz JH, Mayordomo E.  2006.  Points on computable curves. :469–474.
0 icon
pcc.pdf
[Mayo06] Mayordomo, E.  2006.  Two open problems on effective dimension. 3988:353–359.
0 icon
toped.pdf
2007
[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
[1307] Mayordomo, E, Moser P, Albert P.  2007.  Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
2008
[EFDAIT] Mayordomo, E.  2008.  Effective fractal dimension in algorithmic information theory. :259-285.
[DPSSFc] Lutz, JH, Mayordomo E.  2008.  Dimensions of Points in Self-Similar Fractals. 5092:215-224.
[sdkcthsR] Hitchcock, JM, López-Valdés M, Mayordomo E.  2008.  Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
[AMMP08] Albert, P, Mayordomo E, Moser P, Perifel S.  2008.  Pushdown compression. :39-48.
[DPSSF] Lutz, JH, Mayordomo E.  2008.  Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
2009
[1299] Mayordomo, E, Moser P.  2009.  polylog space compression is incomparable with Lempel-Ziv and pushdown compression.
[1300] Mayordomo, E, Blanco R.  2009.  ZARAMIT: a system for the evolutionary study of human mitochondrial DNA.
[1301] Mayordomo, E, Lutz JH, Gu X.  2009.  Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
[1305] Mayordomo, E, Sorbi A, Cooper SB.  2009.  Special Issue: Computation and Logic in the Real World. Theory of Computing Systems. 45(4)
[1309] Mayordomo, E, Blanco R.  2009.  Exhaustive mitochondrial phylogenetics: challenges and solutions. 9th Workshop on Algorithms in Bioinformatics (WABI 2009).
[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.
2010
[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).
[1303] Mayordomo, E, Blanco R, Montes E, Mayo R, Alberto A.  2010.  Scalable Phylogenetics through Input Preprocessing.