| Publication | Date of Publication | Type |
|---|
| Extending the reach of the point-to-set principle | 2024-04-23 | Paper |
| Normality, Relativization, and Randomness | 2023-12-15 | Paper |
Extending the reach of the point-to-set principle
Information and Computation | 2023-09-27 | Paper |
Dimension and the structure of complexity classes
Theory of Computing Systems | 2023-07-26 | Paper |
| Asymptotic Divergences and Strong Dichotomy. | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7576618 (Why is no real title available?) | 2022-08-26 | Paper |
Almost every set in exponential time is P-bi-immune
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Asymptotic Divergences and Strong Dichotomy
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Algorithmic Fractal Dimensions in Geometric Measure Theory
Theory and Applications of Computability | 2022-01-26 | Paper |
Computing absolutely normal numbers in nearly linear time
Information and Computation | 2021-11-25 | Paper |
| Effective dimension in some general metric spaces | 2021-06-22 | Paper |
Weakly useful sequences
Automata, Languages and Programming | 2019-01-10 | Paper |
Effective Hausdorff dimension in general metric spaces
Theory of Computing Systems | 2018-10-05 | Paper |
Effective Hausdorff dimension in general metric spaces
Theory of Computing Systems | 2018-10-05 | Paper |
Resource-bounded balanced genericity, stochasticity and weak randomness
STACS 96 | 2017-11-16 | Paper |
Bounded pushdown dimension vs Lempel Ziv information density
Computability and Complexity | 2017-04-04 | Paper |
Bounded pushdown dimension vs Lempel Ziv information density
Computability and Complexity | 2017-04-04 | Paper |
Dimension spectra of random subfractals of self-similar fractals
Annals of Pure and Applied Logic | 2014-08-21 | Paper |
Base invariance of feasible dimension
Information Processing Letters | 2014-04-11 | Paper |
Dimension is compression
Theory of Computing Systems | 2013-04-15 | Paper |
| Pushdown compression | 2013-03-19 | Paper |
Pushdown compression
(available as arXiv preprint) | 2013-03-19 | Paper |
Inseparability and strong hypotheses for disjoint NP pairs
Theory of Computing Systems | 2012-12-07 | Paper |
Curves that must be retraced
(available as arXiv preprint) | 2012-09-28 | Paper |
| Inseparability and strong hypotheses for disjoint NP pairs | 2012-01-23 | Paper |
Curves that must be retraced
Information and Computation | 2011-07-08 | Paper |
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
Theory of Computing Systems | 2011-05-25 | Paper |
Computation and logic in the real world: CiE 2007
Theory of Computing Systems | 2009-10-19 | Paper |
Dimensions of Points in Self-Similar Fractals
SIAM Journal on Computing | 2009-06-22 | Paper |
Scaled dimension and the Kolmogorov complexity of Turing-hard sets
Theory of Computing Systems | 2009-05-08 | Paper |
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Dimensions of Points in Self-similar Fractals
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Effective Strong Dimension in Algorithmic Information and Computational Complexity
SIAM Journal on Computing | 2008-06-19 | Paper |
| scientific article; zbMATH DE number 5269064 (Why is no real title available?) | 2008-04-29 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Finite-state dimension
Theoretical Computer Science | 2004-10-27 | Paper |
Scaled dimension and nonuniform complexity
Journal of Computer and System Sciences | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2038717 (Why is no real title available?) | 2004-02-08 | Paper |
A Kolmogorov complexity characterization of constructive Hausdorff dimension.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1754653 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1860654 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1346358 (Why is no real title available?) | 1999-09-30 | Paper |
| scientific article; zbMATH DE number 1048036 (Why is no real title available?) | 1997-09-22 | Paper |
An excursion to the Kolmogorov random strings
Journal of Computer and System Sciences | 1997-08-03 | Paper |
Cook versus Karp-Levin: Separating completeness notions if NP is not small
Theoretical Computer Science | 1997-02-27 | Paper |
Almost every set in exponential time is P-bi-immune
Theoretical Computer Science | 1997-02-27 | Paper |
On the robustness of ALMOST-$\mathcal {R}$
RAIRO - Theoretical Informatics and Applications | 1996-12-01 | Paper |
Measure, Stochasticity, and the Density of Hard Languages
SIAM Journal on Computing | 1995-03-20 | Paper |
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Mathematical Systems Theory | 1994-08-10 | Paper |
| scientific article; zbMATH DE number 512813 (Why is no real title available?) | 1994-03-10 | Paper |
