Publications

Export 64 results:
Sort by: Author Title Type [ Year (Desc)]
Filters: Author is E. Mayordomo  [Clear All Filters]
1996
[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
[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
1995
[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
[FeLuMaWUS] Fenner, SA, Lutz JH, Mayordomo E.  1995.  Weakly Useful Sequences. 944:393-404.
0 icon
95_FLM_ICALP.ps
1994
[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
[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
[LutMayCVKLb] Lutz, JH, Mayordomo E.  1994.  Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[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
1993
[LutMayMSDHLb] Lutz, JH, Mayordomo E.  1993.  Measure stochasticity and the density of hard languages. 665:38-47.
1992
[BaHeMa92] Balcázar, JL, Hermo M, Mayordomo E.  1992.  Characterizations of logarithmic advice complexity classes. :315-321.
0 icon
92_BHM_IFIP.ps
[AESETPBI] Mayordomo, E.  1992.  Almost every set in exponential time is P-bi-immune. 629:392-400.