Publications

Export 653 results:
Sort by: [ Author (Desc)] Title Type Year
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 
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
M
[MayMP] Mayordomo, E.  1994.  Measuring in PSPACE. 6:93-100.
0 icon
92_May_IMYCS.ps
[MayCSRBM] Mayordomo, E.  1994.  Contributions to the study of resource bounded measure.
0 icon
94_May_thesis.ps
H
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
A
[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
F
[FeLuMaRe05] Fenner, SA, Lutz JH, Mayordomo E, Reardon P.  2005.  Weakly useful sequences. Information and Computation. 197:41-54.
0 icon
wus.pdf
M
[AESETPBI] Mayordomo, E.  1992.  Almost every set in exponential time is P-bi-immune. 629:392-400.
A
[ESDAICC] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2004.  Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
H
[HiLoMa04] Hitchcock, JM, López-Valdés M, Mayordomo E.  2004.  Scaled dimension and the Kolmogorov complexity of Turing-hard sets. 3153:476-487.
D
[DGLMM05] Doty, D, Gu X, Lutz JH, Mayordomo E, Moser P.  2005.  Zeta-Dimension. 3618:283-294.
0 icon
zeta.pdf
L
[LoMa05] López-Valdés, M, Mayordomo E.  2005.  Dimension is Compression. 3618:676-685.
0 icon
dic.pdf
G
[GuLuMa06] Gu, X, Lutz JH, Mayordomo E.  2006.  Points on computable curves. :469–474.
0 icon
pcc.pdf
M
[Mayo06] Mayordomo, E.  2006.  Two open problems on effective dimension. 3988:353–359.
0 icon
toped.pdf
L
[DPSSFc] Lutz, JH, Mayordomo E.  2008.  Dimensions of Points in Self-Similar Fractals. 5092:215-224.
M
[EFDAIT] Mayordomo, E.  2008.  Effective fractal dimension in algorithmic information theory. :259-285.
H
[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.
A
[AMMP08] Albert, P, Mayordomo E, Moser P, Perifel S.  2008.  Pushdown compression. :39-48.
L
[DPSSF] Lutz, JH, Mayordomo E.  2008.  Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
M
[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.
G
[1293] Gu, X, Lutz JH, Mayordomo E.  2011.  Curves that must be retraced. Information and Computation. 209:992--1006.
M
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[1298] Mayordomo, E.  2004.  P vs NP. Monografías de la Real Academia de Ciencias de Zaragoza. 26:57-68.