| 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 | 2023-09-27 | Paper |
| Dimension and the structure of complexity classes | 2023-07-26 | Paper |
| Asymptotic Divergences and Strong Dichotomy. | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5099789 | 2022-08-26 | Paper |
| Almost every set in exponential time is P-bi-immune | 2022-08-18 | Paper |
| Asymptotic Divergences and Strong Dichotomy | 2022-02-17 | Paper |
| Algorithmic Fractal Dimensions in Geometric Measure Theory | 2022-01-26 | Paper |
| Computing absolutely normal numbers in nearly linear time | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994843 | 2021-06-22 | Paper |
| Weakly useful sequences | 2019-01-10 | Paper |
| Effective Hausdorff dimension in general metric spaces | 2018-10-05 | Paper |
| Resource-bounded balanced genericity, stochasticity and weak randomness | 2017-11-16 | Paper |
| Bounded Pushdown Dimension vs Lempel Ziv Information Density | 2017-04-04 | Paper |
| Dimension spectra of random subfractals of self-similar fractals | 2014-08-21 | Paper |
| Base invariance of feasible dimension | 2014-04-11 | Paper |
| Dimension is compression | 2013-04-15 | Paper |
| Pushdown Compression | 2013-03-19 | Paper |
| Inseparability and strong hypotheses for disjoint NP pairs | 2012-12-07 | Paper |
| Curves that must be retraced | 2012-09-28 | Paper |
| Inseparability and Strong Hypotheses for Disjoint NP Pairs. | 2012-01-23 | Paper |
| Curves that must be retraced | 2011-07-08 | Paper |
| Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable | 2011-05-25 | Paper |
| Computation and logic in the real world: CiE 2007 | 2009-10-19 | Paper |
| Dimensions of Points in Self-Similar Fractals | 2009-06-22 | Paper |
| Scaled dimension and the Kolmogorov complexity of Turing-hard sets | 2009-05-08 | Paper |
| Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression | 2009-02-03 | Paper |
| Dimensions of Points in Self-similar Fractals | 2008-07-10 | Paper |
| Effective Strong Dimension in Algorithmic Information and Computational Complexity | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384978 | 2008-04-29 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Finite-state dimension | 2004-10-27 | Paper |
| Scaled dimension and nonuniform complexity | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449182 | 2004-02-08 | Paper |
| A Kolmogorov complexity characterization of constructive Hausdorff dimension. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535081 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790382 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266481 | 1999-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348122 | 1997-09-22 | Paper |
| An excursion to the Kolmogorov random strings | 1997-08-03 | Paper |
| Cook versus Karp-Levin: Separating completeness notions if NP is not small | 1997-02-27 | Paper |
| Almost every set in exponential time is P-bi-immune | 1997-02-27 | Paper |
| On the robustness of ALMOST-$\mathcal {R}$ | 1996-12-01 | Paper |
| Measure, Stochasticity, and the Density of Hard Languages | 1995-03-20 | Paper |
| A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity | 1994-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281506 | 1994-03-10 | Paper |
