| Publication | Date of Publication | Type |
|---|
| A Weyl criterion for finite-state dimension and applications | 2024-12-03 | Paper |
| The point-to-set principle and the dimensions of Hamel bases | 2024-08-29 | Paper |
| Extending the reach of the point-to-set principle | 2024-04-23 | Paper |
| Real-time computability of real numbers by chemical reaction networks | 2024-02-09 | Paper |
| Reachability problems for continuous chemical reaction networks | 2023-11-30 | Paper |
| Population-induced phase transitions and the verification of chemical reaction networks | 2023-10-27 | 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 |
| Equivalence of measures of complexity classes | 2022-11-09 | Paper |
| On complexity classes and algorithmically random languages (extended abstract) | 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 |
| The Point-to-Set Principle and the Dimensions of Hamel Bases | 2021-09-22 | Paper |
| Who asked us? How the theory of computing answers questions about analysis | 2020-07-20 | Paper |
| Algorithmically Optimal Outer Measures | 2020-06-15 | Paper |
| Robust biomolecular finite automata | 2020-03-20 | Paper |
| Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension | 2019-12-06 | Paper |
| Algorithmic Randomness in Continuous-Time Markov Chains | 2019-10-29 | Paper |
| Computational depth and reducibility | 2019-03-29 | Paper |
| Weakly useful sequences | 2019-01-10 | Paper |
| Recursive computational depth | 2018-07-04 | Paper |
| Mutual dimension and random sequences | 2018-06-07 | Paper |
| Algorithmic information, plane Kakeya sets, and conditional dimension | 2018-04-19 | Paper |
| Completeness and weak completeness under polynomial-size circuits | 2017-12-04 | Paper |
| Observations on measure and lowness for \(\Delta_2^{\mathrm{P}}\) (extended abstract) | 2017-11-16 | Paper |
| Real-time computability of real numbers by chemical reaction networks | 2017-08-31 | Paper |
| The arithmetical complexity of dimension and randomness | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957876 | 2017-01-30 | Paper |
| Mutual dimension | 2016-11-10 | Paper |
| Reachability problems for continuous chemical reaction networks | 2016-09-28 | Paper |
| Lines missing every random point | 2015-10-20 | Paper |
| Mutual dimension and random sequences | 2015-09-16 | Paper |
| Lines Missing Every Random Point | 2015-02-25 | Paper |
| Dimension spectra of random subfractals of self-similar fractals | 2014-08-21 | Paper |
| The frequent paucity of trivial strings | 2014-07-18 | Paper |
| Translating the Cantor set by a random real | 2014-06-11 | Paper |
| Connectivity properties of dimension level sets | 2013-05-03 | Paper |
| Approximate self-assembly of the Sierpinski triangle | 2012-12-07 | Paper |
| Inseparability and strong hypotheses for disjoint NP pairs | 2012-12-07 | Paper |
| Curves that must be retraced | 2012-09-28 | Paper |
| Intrinsic universality in self-assembly | 2012-01-23 | Paper |
| Inseparability and strong hypotheses for disjoint NP pairs | 2012-01-23 | Paper |
| Effective dimensions and relative frequencies | 2011-12-07 | Paper |
| Multi-resolution cellular automata for real computation | 2011-09-09 | Paper |
| Axiomatizing resource bounds for measure | 2011-09-09 | Paper |
| Curves that must be retraced | 2011-07-08 | Paper |
| Computability and complexity in self-assembly | 2011-05-23 | Paper |
| A divergence formula for randomness and dimension | 2011-01-10 | Paper |
| Approximate self-assembly of the Sierpinski triangle | 2010-07-29 | Paper |
| A divergence formula for randomness and dimension | 2010-07-28 | Paper |
| Dimension characterizations of complexity classes | 2010-03-15 | Paper |
| Random Number Selection in Self-assembly | 2009-10-22 | Paper |
| Computability versus exact computability of martingales | 2009-08-27 | Paper |
| Dimensions of Points in Self-Similar Fractals | 2009-06-22 | Paper |
| Finite-state dimension and real arithmetic | 2009-03-12 | Paper |
| Strict self-assembly of discrete Sierpinski triangles | 2009-03-02 | Paper |
| Connectivity properties of dimension level sets | 2008-10-08 | Paper |
| Dimensions of Points in Self-similar Fractals | 2008-07-10 | Paper |
| Effective Dimensions and Relative Frequencies | 2008-06-19 | Paper |
| Effective Strong Dimension in Algorithmic Information and Computational Complexity | 2008-06-19 | Paper |
| Computability and Complexity in Self-assembly | 2008-06-19 | Paper |
| Finite-state dimension and real arithmetic | 2007-11-21 | Paper |
| Strict Self-assembly of Discrete Sierpinski Triangles | 2007-11-13 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Dimensions of Copeland-Erdös sequences | 2007-09-18 | Paper |
| Dimension Characterizations of Complexity Classes | 2007-09-05 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Why computational complexity requires stricter martingales | 2006-10-25 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Prediction and dimension | 2005-06-13 | Paper |
| Baire category and nowhere differentiability for feasible real functions | 2005-02-16 | Paper |
| Effective fractal dimensions | 2005-02-16 | Paper |
| The dimensions of individual strings and sequences | 2004-11-23 | Paper |
| Finite-state dimension | 2004-10-27 | Paper |
| Scaled dimension and nonuniform complexity | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046719 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737188 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474091 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449182 | 2004-02-08 | Paper |
| Dimension in Complexity Classes | 2003-09-28 | Paper |
| Recursive computational depth. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535081 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754206 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790382 | 2001-01-01 | Paper |
| The Density of Weakly Complete Problems under Adaptive Reductions | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501544 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501523 | 2000-09-04 | Paper |
| Modeling time-bounded prefix Kolmogorov complexity | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258588 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942646 | 2000-03-16 | Paper |
| Feasible reductions to Kolmogorov-Loveland stochastic sequences | 2000-01-12 | Paper |
| Equivalence of Measures of Complexity Classes | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266481 | 1999-09-30 | Paper |
| Genericity and randomness over feasible probability measures | 1999-01-12 | Paper |
| Observations on measure and lowness for \(\Delta_ 2^ p\) | 1997-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359463 | 1997-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336272 | 1997-05-12 | Paper |
| Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) | 1997-02-28 | Paper |
| Cook versus Karp-Levin: Separating completeness notions if NP is not small | 1997-02-27 | Paper |
| Completeness and weak completeness under polynomial-size circuits | 1997-01-02 | Paper |
| Weakly Hard Problems | 1996-02-01 | Paper |
| The Complexity and Distribution of Hard Problems | 1995-12-13 | Paper |
| The global power of additional queries to random oracles | 1995-09-17 | Paper |
| An observation on probability versus randomness with applications to complexity classes | 1995-08-27 | Paper |
| Measure, Stochasticity, and the Density of Hard Languages | 1995-03-20 | Paper |
| Computational depth and reducibility | 1994-09-25 | Paper |
| A Pseudorandom Oracle Characterization of ${\text{BPP}}$ | 1994-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281506 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038699 | 1993-05-18 | Paper |
| On Languages with Very High Space-Bounded Kolmogorov Complexity | 1993-05-17 | Paper |
| Circuit size relative to pseudorandom oracles | 1993-05-16 | Paper |
| Almost everywhere high nonuniform complexity | 1992-09-27 | Paper |
| On independent random oracles | 1992-06-28 | Paper |
| An upward measure separation theorem | 1991-01-01 | Paper |
| Category and Measure in Complexity Classes | 1990-01-01 | Paper |
| Pseudorandom sources for BPP | 1990-01-01 | Paper |
