Publications
Filters: Author is E. Mayordomo [Clear All Filters]
[1425] Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
.
2012.
[1305] Special Issue: Computation and Logic in the Real World. Theory of Computing Systems. 45(4)
.
2009.
[LutMayTPRBMb] Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
.
1999.
[FeLuMaRe05] Weakly useful sequences. Information and Computation. 197:41-54.
.
2005.
[1412] PHYSER: An Algorithm to Detect Sequencing Errors from Phylogenetic Information. 6th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2012).
.
2012.
[1306] Programs, Proofs, Processes: Proceedings of the 6th Conference on Computability in Europe, CiE, 2010. 6158
.
2010.
[1304] Workflows with model selection: a multilocus approach to phylogenetic analysis. 5th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2011). 93/2011:39-47.
.
2011.
[AESETPBI] Almost every set in exponential time is P-bi-immune. 629:392-400.
.
1992.
[1310] Building maintainable, exhaustive human mitochondrial phylogenies. 17 Annual International Conference on Intelligent Systems for Molecular Biology/8th European Conference.
.
2009.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[AmMaZh96] A Comparison of Weak Completeness Notions. :171-178.
.
1996.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
[1301] Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
.
2009.
[LoMa05] Dimension is Compression. 3618:676-685.
.
2005.
[1438] Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).
.
2012.
[DPSSFc] Dimensions of Points in Self-Similar Fractals. 5092:215-224.
.
2008.
[MayEHD] Effective Hausdorff dimension. Trends in Logic. 23:171-186.
.
2004.
[ESDAICC] Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
.
2004.
[BuhMay95] An excursion to the Kolmogorov random strings. :197-203.
.
1995.
[1309] Exhaustive mitochondrial phylogenetics: challenges and solutions. 9th Workshop on Algorithms in Bioinformatics (WABI 2009).
.
2009.
[DaLaLuMaFSDb] Finite state dimension. 2076:1028-1039.
.
2001.
[1302] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Twenty-Seventh Symposium on Theoretical Aspects of Computer Science (STACS'10).
.
2010.
[LutMayMSDHLb] Measure stochasticity and the density of hard languages. 665:38-47.
.
1993.
[MayMP] Measuring in PSPACE. 6:93-100.
.
1994.
[BalMay95] A note on genericity and bi immunity. :193-196.
.
1995.