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