Publications

Export 64 results:
Sort by: Author [ Title (Asc)] Type Year
Filters: Author is E. Mayordomo  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
E
[1309] Mayordomo, E, Blanco R.  2009.  Exhaustive mitochondrial phylogenetics: challenges and solutions. 9th Workshop on Algorithms in Bioinformatics (WABI 2009).
F
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
0 icon
fsd.ps
[DaLaLuMaFSDb] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2001.  Finite state dimension. 2076:1028-1039.
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
I
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[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).
K
[MayKCCCHD] Mayordomo, E.  2002.  A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
0 icon
02_May_IPL.ps
M
[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
[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.
0 icon
92_May_IMYCS.ps
N
[BalMay95] Balcázar, JL, Mayordomo E.  1995.  A note on genericity and bi immunity. :193-196.
0 icon
95_BM_Structures.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
O
[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
P
[1298] Mayordomo, E.  2004.  P vs NP. Monografías de la Real Academia de Ciencias de Zaragoza. 26:57-68.
[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).
[GuLuMa06] Gu, X, Lutz JH, Mayordomo E.  2006.  Points on computable curves. :469–474.
0 icon
pcc.pdf
[1299] Mayordomo, E, Moser P.  2009.  polylog space compression is incomparable with Lempel-Ziv and pushdown compression.
[1292] Mayordomo, E, Moser P, Perifel S.  2011.  Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. Theory of Computing Systems. 48:731-766.
[1306] [Anonymous].  2010.  Programs, Proofs, Processes: Proceedings of the 6th Conference on Computability in Europe, CiE, 2010. 6158
[AMMP08] Albert, P, Mayordomo E, Moser P, Perifel S.  2008.  Pushdown compression. :39-48.
R
[1369] Mayordomo, E, Blanco R, Montoya J, Ruiz-Pesini E.  2011.  Rebooting the human mitochondrial phylogeny: an automated and scalable methodology with expert knowledge. BMC Bioinformatics. 12:174(29pp.).
[AMWZ96] Ambos-Spies, K, Mayordomo E, Wang Y, Zheng X.  1996.  Resource bounded balanced genericity stochasticity and weak randomness. 1046:63-74.
0 icon
96_ASMWZ_STACS.ps
[AmbMay97] Ambos-Spies, K, Mayordomo E.  1997.  Resource Bounded Measure and Randomness. :1-47.
0 icon
97_ASM_LNPAM.ps
[1308] Gavaldà, R, López-Valdés M, Mayordomo E, Vinodchandran NV.  2010.  Resource-bounded Dimension in Computational Learning Theory. arXiv.
S
[1303] Mayordomo, E, Blanco R, Montes E, Mayo R, Alberto A.  2010.  Scalable Phylogenetics through Input Preprocessing.