Elvira Mayordomo
Phone:
(+34) 976761918
Fax:
(+34) 976761914
Email:
elviraunizar [dot] es
Homepage:
http://webdiis.unizar.es/~elvira/
Office:
D1.06
Position:
Ph.D. Member Publications
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[BooMay96] On the robustness of ALMOST R. Rairo Informatique Theorique et Applications. 30:123-133.
.
1996.
[BuhMay95] An excursion to the Kolmogorov random strings. :197-203.
.
1995.
[BalMay95] A note on genericity and bi immunity. :193-196.
.
1995.
[FeLuMaWUS] Weakly Useful Sequences. 944:393-404.
.
1995.
[MayAESET] Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
.
1994.
[LutMayMSDHL] Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
.
1994.
[HerMay94] A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
.
1994.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
[MayMP] Measuring in PSPACE. 6:93-100.
.
1994.
.
1994.
[LutMayMSDHLb] Measure stochasticity and the density of hard languages. 665:38-47.
.
1993.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[AESETPBI] Almost every set in exponential time is P-bi-immune. 629:392-400.
.
1992. - « first
- ‹ previous
- 1
- 2
- 3