Publications

Export 63 results:
Sort by: [ Author (Asc)] Title 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 
Á
[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
L
[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
M
[MayEHD] Mayordomo, E.  2004.  Effective Hausdorff dimension. Trends in Logic. 23:171-186.
0 icon
xx_May_FFS.ps
L
[LutMayTPRBM] Lutz, JH, Mayordomo E.  2001.  Twelve problems in resource bounded measure. :83-101.
[LutMayTPRBMb] Lutz, JH, Mayordomo E.  1999.  Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
0 icon
99_LM_BEATCS.ps
A
[AmbMay97] Ambos-Spies, K, Mayordomo E.  1997.  Resource Bounded Measure and Randomness. :1-47.
0 icon
97_ASM_LNPAM.ps
H
[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
D
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
0 icon
fsd.ps
M
[MayKCCCHD] Mayordomo, E.  2002.  A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
0 icon
02_May_IPL.ps
B
[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
L
[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
B
[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
M
[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
L
[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
H
[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
[HiLuMaSDNCb] Hitchcock, JM, Lutz JH, Mayordomo E.  2003.  Scaled dimension and non uniform complexity. 2719:278-290.
D
[DaLaLuMaFSDb] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2001.  Finite state dimension. 2076:1028-1039.
A
[AmMaZh96] Ambos-Spies, K, Mayordomo E, Zheng X.  1996.  A Comparison of Weak Completeness Notions. :171-178.
0 icon
96_ASMZ_Structures.ps
[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
B
[BuhMay95] Buhrman, H, Mayordomo E.  1995.  An excursion to the Kolmogorov random strings. :197-203.
[BalMay95] Balcázar, JL, Mayordomo E.  1995.  A note on genericity and bi immunity. :193-196.
0 icon
95_BM_Structures.ps
F
[FeLuMaWUS] Fenner, SA, Lutz JH, Mayordomo E.  1995.  Weakly Useful Sequences. 944:393-404.
0 icon
95_FLM_ICALP.ps
L
[LutMayCVKLb] Lutz, JH, Mayordomo E.  1994.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[LutMayMSDHLb] Lutz, JH, Mayordomo E.  1993.  Measure stochasticity and the density of hard languages. 665:38-47.
B
[BaHeMa92] Balcázar, JL, Hermo M, Mayordomo E.  1992.  Characterizations of logarithmic advice complexity classes. :315-321.
0 icon
92_BHM_IFIP.ps