Publications

Export 64 results:
Sort by: Author Title [ Type (Asc)] Year
Filters: Author is E. Mayordomo  [Clear All Filters]
Conference Paper
[1303] Mayordomo, E, Blanco R, Montes E, Mayo R, Alberto A.  2010.  Scalable Phylogenetics through Input Preprocessing.
[HiLuMaSDNCb] Hitchcock, JM, Lutz JH, Mayordomo E.  2003.  Scaled dimension and non uniform complexity. 2719:278-290.
[HiLoMa04] Hitchcock, JM, López-Valdés M, Mayordomo E.  2004.  Scaled dimension and the Kolmogorov complexity of Turing-hard sets. 3153:476-487.
[Mayo06] Mayordomo, E.  2006.  Two open problems on effective dimension. 3988:353–359.
0 icon
toped.pdf
[FeLuMaWUS] Fenner, SA, Lutz JH, Mayordomo E.  1995.  Weakly Useful Sequences. 944:393-404.
0 icon
95_FLM_ICALP.ps
[1300] Mayordomo, E, Blanco R.  2009.  ZARAMIT: a system for the evolutionary study of human mitochondrial DNA.
[DGLMM05] Doty, D, Gu X, Lutz JH, Mayordomo E, Moser P.  2005.  Zeta-Dimension. 3618:283-294.
0 icon
zeta.pdf
Conference Proceedings
[1412] Álvarez-Jarreta, J, Mayordomo E, Ruiz-Pesini E.  2012.  PHYSER: An Algorithm to Detect Sequencing Errors from Phylogenetic Information. 6th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2012).
[1306] [Anonymous].  2010.  Programs, Proofs, Processes: Proceedings of the 6th Conference on Computability in Europe, CiE, 2010. 6158
[1304] Mayordomo, E, Blanco R, Álvarez J.  2011.  Workflows with model selection: a multilocus approach to phylogenetic analysis. 5th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2011). 93/2011:39-47.
Journal Article
[MayAESET] Mayordomo, E.  1994.  Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
0 icon
94_May_TCS.ps
[1426] Mayordomo, E, Becher V, Bienvenu L, Downey R.  2012.  Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports. 2(1)
[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
[1293] Gu, X, Lutz JH, Mayordomo E.  2011.  Curves that must be retraced. Information and Computation. 209:992--1006.
[1439] Mayordomo, E, López-Valdés M.  2013.  Dimension is Compression. Theory of Computing Systems. 52:95-112.
[DPSSF] Lutz, JH, Mayordomo E.  2008.  Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
[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
[BuhMay97] Buhrman, H, Mayordomo E.  1997.  An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
0 icon
97_BM_JCSS.ps
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
0 icon
fsd.ps
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[MayKCCCHD] Mayordomo, E.  2002.  A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
0 icon
02_May_IPL.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
[HerMay94] Hermo, M, Mayordomo E.  1994.  A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
0 icon
94_HM_MST.ps
[BooMay96] Book, RV, Mayordomo E.  1996.  On the robustness of ALMOST R. Rairo Informatique Theorique et Applications. 30:123-133.
0 icon
96_BM_RITA.ps