| Publication | Date of Publication | Type |
|---|
| Lowness properties for strong reducibilities and the computational power of maximal sets | 2024-04-15 | Paper |
| The theory of the polynomial many-one degrees of recursive sets is undecidable | 2022-08-18 | Paper |
| Genericity and measure for exponential time | 2022-08-18 | Paper |
| Some observations on mitotic sets | 2022-03-22 | Paper |
| ON SUPERSETS OF NON-LOW SETS | 2021-12-09 | Paper |
| Normalized information distance and the oscillation hierarchy | 2021-11-25 | Paper |
| On the differences and sums of strongly computably enumerable real numbers | 2020-05-12 | Paper |
| Weak completeness notions for exponential time | 2019-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4619825 | 2019-02-07 | Paper |
| On optimal polynomial time approximations: P-levelability vs. δ-levelability | 2019-01-10 | Paper |
| Automorphism bases for the recursively enumerable degrees | 2018-09-20 | Paper |
| Multiple permitting and array noncomputability | 2018-09-06 | Paper |
| Resource-bounded balanced genericity, stochasticity and weak randomness | 2017-11-16 | Paper |
| On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets | 2017-04-04 | Paper |
| Learning Finite Variants of Single Languages from Informant | 2016-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982343 | 2015-04-09 | Paper |
| Numberings and learnability | 2015-03-17 | Paper |
| Nontriviality for exponential time w.r.t. weak reducibilities | 2014-01-10 | Paper |
| Real Benefit of Promises and Advice | 2013-08-05 | Paper |
| Maximal pairs of computably enumerable sets in the computably Lipschitz degrees | 2013-04-15 | Paper |
| The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent | 2013-04-05 | Paper |
| Comparing nontriviality for E and EXP | 2012-12-07 | Paper |
| Inductive inference and computable numberings | 2011-04-05 | Paper |
| Quantitative aspects of speed-up and gap phenomena | 2010-12-01 | Paper |
| Weak Completeness Notions for Exponential Time | 2010-09-07 | Paper |
| Nontriviality for Exponential Time w.r.t. Weak Reducibilities | 2010-06-17 | Paper |
| Bounding non-GL2 and R.E.A. | 2009-09-29 | Paper |
| Quantitative Aspects of Speed-Up and Gap Phenomena | 2009-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530389 | 2008-10-20 | Paper |
| On a Question of Frank Stephan | 2008-05-27 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Comparing DNR and WWKL | 2005-08-29 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Almost complete sets. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452093 | 2004-02-11 | Paper |
| Embeddings of \(N_5\) and the contiguous degrees | 2003-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536350 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2784776 | 2002-07-25 | Paper |
| Undecidability and 1-types in intervals of the computably enumerable degrees | 2001-10-23 | Paper |
| Weakly computable real numbers | 2001-05-29 | Paper |
| Separating NP-completeness notions under strong hypotheses | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501552 | 2001-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525724 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513960 | 2000-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934293 | 2000-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944898 | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268494 | 1999-10-28 | Paper |
| Initial segments of recursive linear orders | 1999-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218120 | 1999-03-02 | Paper |
| Resource bounded randomness and weakly complete problems | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348122 | 1997-09-22 | Paper |
| Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices | 1997-06-03 | Paper |
| Genericity and measure for exponential time | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863237 | 1996-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4854879 | 1995-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325778 | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764099 | 1995-08-27 | Paper |
| Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees | 1995-06-08 | Paper |
| The continuity of cupping to \(\text \textbf{0}'\) | 1995-01-29 | Paper |
| Minimal pairs and complete problems | 1994-09-25 | Paper |
| Undecidability and 1-types in the recursively enumerable degrees | 1994-06-05 | Paper |
| Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 | 1994-04-27 | Paper |
| Cappable recursively enumerable degrees and Post's program | 1994-01-13 | Paper |
| The theory of the recursively enumerable weak truth-table degrees is undecidable | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975929 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753945 | 1990-01-01 | Paper |
| Honest polynomial time reducibilities and the \(P=?NP\) problem | 1989-01-01 | Paper |
| On the relative complexity of hard problems for complexity classes without complete problems | 1989-01-01 | Paper |
| The recursively enumerable degrees have infinitely many one-types | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3203013 | 1989-01-01 | Paper |
| Lattice embeddings into the recursively enumerable degrees. II | 1989-01-01 | Paper |
| Degree theoretical splitting properties of recursively enumerable sets | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734760 | 1988-01-01 | Paper |
| Diagonalizations over polynomial time computable sets | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3778006 | 1987-01-01 | Paper |
| Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets | 1986-01-01 | Paper |
| A note on complete problems for complexity classes | 1986-01-01 | Paper |
| An Inhomogeneity in the Structure of Karp Degrees | 1986-01-01 | Paper |
| Lattice embeddings into the recursively enumerable degrees | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723714 | 1986-01-01 | Paper |
| Sublattices of the polynomial time degrees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698788 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698789 | 1985-01-01 | Paper |
| Anti‐Mitotic Recursively Enumerable Sets | 1985-01-01 | Paper |
| Cupping and noncapping in the r.e. weak truth table and turing degrees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220571 | 1984-01-01 | Paper |
| An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees | 1984-01-01 | Paper |
| On Pairs of Recursively Enumerable Degrees | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337457 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337458 | 1984-01-01 | Paper |
| An extension of the nondiamond theorem in classical and α-recursion theory | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187269 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315501 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315502 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942948 | 1981-01-01 | Paper |
