Export 64 results:
Sort by: Author Title [ Type (Asc)] Year
Filters: Author is E. Mayordomo  [Clear All Filters]
Journal Article
[1298] Mayordomo, E.  2004.  P vs NP. Monografías de la Real Academia de Ciencias de Zaragoza. 26:57-68.
[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.
[1369] Mayordomo, E, Blanco R, Montoya J, Ruiz-Pesini E.  2011.  Rebooting the human mitochondrial phylogeny: an automated and scalable methodology with expert knowledge. BMC Bioinformatics. 12:174(29pp.).
[HiLuMaSDNC] Hitchcock, JM, Lutz JH, Mayordomo E.  2004.  Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
[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.
[1425] Mayordomo, E, Ferreira F, Hyland M, L\"owe B.  2012.  Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
[1305] Mayordomo, E, Sorbi A, Cooper SB.  2009.  Special Issue: Computation and Logic in the Real World. Theory of Computing Systems. 45(4)
[LutMayTPRBMb] Lutz, JH, Mayordomo E.  1999.  Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
[FeLuMaRe05] Fenner, SA, Lutz JH, Mayordomo E, Reardon P.  2005.  Weakly useful sequences. Information and Computation. 197:41-54.