| Publication | Date of Publication | Type |
|---|
| Relativized depth | 2023-02-24 | Paper |
| Speedable Left-c.e. Numbers | 2022-10-19 | Paper |
| Relativized depth | 2021-12-08 | Paper |
| Normalized information distance and the oscillation hierarchy | 2021-11-25 | Paper |
| CHAITIN’S Ω AS A CONTINUOUS FUNCTION | 2020-04-17 | Paper |
| BEING LOW ALONG A SEQUENCE AND ELSEWHERE | 2020-04-06 | Paper |
| Searching for shortest and least programs | 2020-01-22 | Paper |
| Proving the PCP-Theorem | 2018-07-03 | Paper |
| Solovay functions and their applications in algorithmic randomness | 2015-08-31 | Paper |
| Selection by Recursively Enumerable Sets | 2013-05-28 | Paper |
| Effective Randomness for Computable Probability Measures | 2013-05-10 | Paper |
| Maximal pairs of computably enumerable sets in the computably Lipschitz degrees | 2013-04-15 | Paper |
| Time-bounded Kolmogorov complexity and Solovay functions | 2013-04-15 | Paper |
| Analogues of Chaitin's Omega in the computably enumerable sets | 2013-03-21 | Paper |
| Constant Compression and Random Weights | 2013-01-30 | Paper |
| Separations of non-monotonic randomness notions | 2012-09-28 | Paper |
| Separations of non-monotonic randomness notions | 2012-09-05 | Paper |
| Constant compression and random weights | 2012-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113710 | 2012-01-23 | Paper |
| Kolmogorov complexity and the Recursion Theorem | 2011-10-17 | Paper |
| Traceable Sets | 2010-10-27 | Paper |
| Separations by random oracles and “Almost” classes for generalized reducibilities | 2010-06-17 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Constructive equivalence relations on computable probability measures | 2009-10-26 | Paper |
| Time-Bounded Kolmogorov Complexity and Solovay Functions | 2009-10-16 | Paper |
| A simple proof of Miller-Yu theorem | 2008-06-11 | Paper |
| Generation Complexity Versus Distinction Complexity | 2008-05-27 | Paper |
| When unlearning helps | 2008-05-19 | Paper |
| Kolmogorov complexity and the Recursion Theorem | 2008-03-19 | Paper |
| The complexity of stochastic sequences | 2008-03-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Reconciling Data Compression and Kolmogorov Complexity | 2007-11-28 | Paper |
| Schnorr dimension | 2007-02-09 | Paper |
| Selection functions that do not preserve normality | 2006-10-16 | Paper |
| Some results on effective randomness | 2006-10-16 | Paper |
| Generality's price: Inescapable deficiencies in machine-learned programs | 2006-04-28 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Kolmogorov-Loveland randomness and stochasticity | 2005-12-29 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| On the construction of effectively random sets | 2005-08-29 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences | 2005-02-09 | Paper |
| Trees and learning | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737174 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473561 | 2004-08-04 | Paper |
| Almost complete sets. | 2004-03-14 | Paper |
| On the Autoreducibility of Random Sequences | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708604 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708572 | 2003-06-18 | Paper |
| Refuting learning revisited. | 2003-05-22 | Paper |
| Separations by random oracles and ``almost classes for generalized reducibilities | 2002-11-28 | Paper |
| Lattice embeddings for abstract bounded reducibilities | 2002-04-23 | Paper |
| The global power of additional queries to \(p\)-random oracles | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754207 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754201 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501552 | 2001-03-13 | Paper |
| Structural properties of bounded relations with an application to NP optimization problems | 2000-12-12 | Paper |
| Exact Pairs for Abstract Bounded Reducibilities | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944898 | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4377133 | 1998-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362928 | 1997-11-13 | Paper |
| Randomness versus superspeedability | N/A | Paper |
