Elvira Mayordomo

Orcid: 0000-0002-9109-5337

Affiliations:
  • Iowa State University, Department of Computer Science


According to our database1, Elvira Mayordomo authored at least 68 papers between 1992 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Extending the reach of the point-to-set principle.
Inf. Comput., October, 2023

Foreword: a Commemorative Issue for Alan L. Selman.
Theory Comput. Syst., June, 2023

Dimension and the Structure of Complexity Classes.
Theory Comput. Syst., June, 2023

Normality, Relativization, and Randomness.
CoRR, 2023

2022
A point to set principle for finite-state dimension.
CoRR, 2022

LDDMM Meets GANs: Generative Adversarial Networks for Diffeomorphic Registration.
Proceedings of the Biomedical Image Registration - 10th International Workshop, 2022

2021
Asymptotic Divergences and Strong Dichotomy.
IEEE Trans. Inf. Theory, 2021

Computing absolutely normal numbers in nearly linear time.
Inf. Comput., 2021

2020
EATCS Distinguished Dissertation Award 2020 - Call for Nominations.
Bull. EATCS, 2020

Algorithmic Fractal Dimensions in Geometric Measure Theory.
CoRR, 2020

The Dimensions of Hyperspaces.
CoRR, 2020

Analysis of the Influence of Diffeomorphic Normalization in the Prediction of Stable VS Progressive MCI Conversion with Convolutional Neural Networks.
Proceedings of the 17th IEEE International Symposium on Biomedical Imaging, 2020

2019
EATCS Distinguished Dissertation Award 2019 - Call for Nominations.
Bull. EATCS, 2019

2018
Effective Hausdorff Dimension in General Metric Spaces.
Theory Comput. Syst., 2018

Evolution of GWAS results through ADNI cohorts.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017
Machine learning classifier for identification of damaging missense mutations exclusive to human mitochondrial DNA-encoded polypeptides.
BMC Bioinform., 2017

2016
Editorial.
Comput., 2016

2015
Editorial.
Theory Comput. Syst., 2015

Computability in Europe 2010.
J. Log. Comput., 2015

Conservation in mitochondrial DNA: Parallelized estimation and alignment influence.
Proceedings of the 2015 IEEE International Conference on Bioinformatics and Biomedicine, 2015

2014
Dimension spectra of random subfractals of self-similar fractals.
Ann. Pure Appl. Log., 2014

PhyloFlow: A fully customizable and automatic workflow for phylogenetic reconstruction.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Base invariance of feasible dimension.
Inf. Process. Lett., 2013

2012
Inseparability and Strong Hypotheses for Disjoint NP Pairs.
Theory Comput. Syst., 2012

Programs, Proofs, Processes.
Theory Comput. Syst., 2012

Computability, Complexity and Randomness (Dagstuhl Seminar 12021).
Dagstuhl Reports, 2012

Effective dimension in some general metric spaces.
Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

Editorial.
Comput., 2012

Computability in Europe 2010.
Ann. Pure Appl. Log., 2012

PHYSER: An Algorithm to Detect Sequencing Errors from Phylogenetic Information.
Proceedings of the 6th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2012

2011
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable.
Theory Comput. Syst., 2011

Rebooting the human mitochondrial phylogeny: an automated and scalable methodology with expert knowledge.
BMC Bioinform., 2011

Workflows with Model Selection: A Multilocus Approach to Phylogenetic Analysis.
Proceedings of the 5th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2011

2010
Resource-bounded Dimension in Computational Learning Theory
CoRR, 2010

Scalable Phylogenetics through Input Preprocessing.
Proceedings of the Advances in Bioinformatics, 2010

2009
Computation and Logic in the Real World: CiE 2007.
Theory Comput. Syst., 2009

Inseparability and Strong Hypotheses for Disjoint NP Pairs.
Electron. Colloquium Comput. Complex., 2009

Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

ZARAMIT: A System for the Evolutionary Study of Human Mitochondrial DNA.
Proceedings of the Distributed Computing, 2009

2008
Dimensions of Points in Self-Similar Fractals.
SIAM J. Comput., 2008

Curves That Must Be Retraced.
Electron. Colloquium Comput. Complex., 2008

Pushdown Compression.
Proceedings of the STACS 2008, 2008

2007
Effective Strong Dimension in Algorithmic Information and Computational Complexity.
SIAM J. Comput., 2007

Bounded Pushdown dimension vs Lempel Ziv information density.
Electron. Colloquium Comput. Complex., 2007

2006
Two Open Problems on Effective Dimension.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Weakly useful sequences.
Inf. Comput., 2005

Points on Computable Curves
Electron. Colloquium Comput. Complex., 2005

Zeta-Dimension.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Finite-state dimension.
Theor. Comput. Sci., 2004

Scaled dimension and nonuniform complexity.
J. Comput. Syst. Sci., 2004

Dimension is compression
Electron. Colloquium Comput. Complex., 2004

Scaled dimension and the Kolmogorov complexity of Turing hard sets
Electron. Colloquium Comput. Complex., 2004

2002
A Kolmogorov complexity characterization of constructive Hausdorff dimension.
Inf. Process. Lett., 2002

2001
Effective Hausdorff dimension.
Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001

Twelve Problems in Resource-Bounded Measure.
Proceedings of the Current Trends in Theoretical Computer Science, 2001

1999
Twelve Problems in Resource-Bounded Measure.
Bull. EATCS, 1999

1997
An Excursion to the Kolmogorov Random Strings.
J. Comput. Syst. Sci., 1997

1996
Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small.
Theor. Comput. Sci., 1996

On the Robustness of ALMOST-<i>R</i>.
RAIRO Theor. Informatics Appl., 1996

Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness.
Proceedings of the STACS 96, 1996

A Comparison of Weak Completeness Notions.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
Weakly Useful Sequences.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

A Note on Genericity and Bi-Immunity.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
Almost Every Set in Exponential Time is P-bi-Immune.
Theor. Comput. Sci., 1994

Measure, Stochasticity, and the Density of Hard Languages.
SIAM J. Comput., 1994

A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity.
Math. Syst. Theory, 1994

Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract).
Proceedings of the STACS 94, 1994

1992
Characterizations of Logarithmic Advice Complexity Classes.
Proceedings of the Algorithms, Software, Architecture, 1992


  Loading...