Publications

Export 64 results:
Sort by: Author Title [ Type (Desc)] Year
Filters: Author is E. Mayordomo  [Clear All Filters]
Thesis
[1424] Álvarez Jarreta, J.  2011.  Análisis filogenético molecular: Diseño e implementación de algoritmos escalables y fiables y verificación automática de propiedades de una filogenia. Master
[1423] López-Valdés, M.  2011.  Aplicaciones de la Dimensión Efectiva a la Complejidad Computacional y a los Algoritmos de Compresión de Datos. PhD
[MayCSRBM] Mayordomo, E.  1994.  Contributions to the study of resource bounded measure.
0 icon
94_May_thesis.ps
Report
[1307] Mayordomo, E, Moser P, Albert P.  2007.  Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
[1308] Gavaldà, R, López-Valdés M, Mayordomo E, Vinodchandran NV.  2010.  Resource-bounded Dimension in Computational Learning Theory. arXiv.
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
[1298] Mayordomo, E.  2004.  P vs NP. Monografías de la Real Academia de Ciencias de Zaragoza. 26:57-68.
[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.
[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.).
[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
[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.