| Publication | Date of Publication | Type |
|---|
| On cupping and Ahmad pairs | 2024-11-25 | Paper |
| On the c.e. degrees realizable in \(\Pi^0_1\) classes | 2024-11-25 | Paper |
| Computably and punctually universal spaces | 2024-10-07 | Paper |
| Every \(\Delta^0_2\) Polish space is computable topological | 2024-06-13 | Paper |
| Separating notions in effective topology | 2024-01-04 | Paper |
| Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities | 2023-08-03 | Paper |
| Extensions of two constructions of Ahmad | 2023-01-12 | Paper |
| Primitive recursive equivalence relations and their primitive recursive complexity | 2023-01-12 | Paper |
| Every Δ20 degree is a strong degree of categoricity | 2022-12-13 | Paper |
| Multiple genericity: a new transfinite hierarchy of genericity notions | 2022-10-24 | Paper |
| Computable topological groups | 2022-09-10 | Paper |
| Limit Complexities, Minimal Descriptions, and $n$-Randomness | 2022-08-05 | Paper |
| Separating weak \(\alpha\)-change and \(\alpha\)-change genericity | 2022-05-23 | Paper |
| A recursion theoretic foundation of computation over real numbers | 2021-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155667 | 2021-10-08 | Paper |
| Punctual equivalence relations and their (punctual) complexity | 2021-09-09 | Paper |
| Turing degrees in Polish spaces and decomposability of Borel functions | 2021-06-04 | Paper |
| Computability of Polish spaces up to homeomorphism | 2021-04-15 | Paper |
| PUNCTUAL CATEGORICITY AND UNIVERSALITY | 2021-04-15 | Paper |
| Cupping and jump classes in the computably enumerable degrees | 2021-04-15 | Paper |
| Online presentations of finitely generated structures | 2020-10-21 | Paper |
| Computable classifications of continuous, transducer, and regular functions | 2020-10-19 | Paper |
| Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees | 2020-10-15 | Paper |
| Enumerating abelian \(p\)-groups | 2020-08-25 | Paper |
| Effective domination and the bounded jump | 2020-07-20 | Paper |
| Foundations of Online Structure Theory II: The Operator Approach | 2020-07-14 | Paper |
| Minimal weak truth table degrees and computably enumerable Turing degrees | 2020-06-19 | Paper |
| A structure of punctual dimension two | 2020-05-27 | Paper |
| On the degree structure of equivalence relations under computable reducibility | 2020-02-14 | Paper |
| AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES | 2020-01-10 | Paper |
| The back-and-forth method and computability without delay | 2019-12-17 | Paper |
| On Kierstead’s conjecture | 2019-08-07 | Paper |
| Categorical linearly ordered structures | 2019-07-10 | Paper |
| Enumeration degrees and non-metrizable topology | 2019-04-08 | Paper |
| Splitting into degrees with low computational strength | 2018-06-05 | Paper |
| Computable torsion abelian groups | 2018-01-11 | Paper |
| The diversity of categoricity without delay | 2018-01-05 | Paper |
| A Friedberg enumeration of equivalence structures | 2017-12-04 | Paper |
| Lowness and logical depth | 2017-11-06 | Paper |
| Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees | 2017-06-13 | Paper |
| An analogy between cardinal characteristics and highness properties of oracles | 2017-06-09 | Paper |
| Minimal Pairs in the C.E. Truth-table Degrees | 2017-06-09 | Paper |
| Algebraic structures computable without delay | 2017-05-12 | Paper |
| Finitary reducibility on equivalence relations | 2017-04-28 | Paper |
| On being Rod's graduate student | 2017-04-04 | Paper |
| Abelian \(p\)-groups and the halting problem | 2016-08-31 | Paper |
| Computable structures and operations on the space of continuous functions | 2016-04-28 | Paper |
| Computably enumerable Turing degrees and the meet property | 2016-03-03 | Paper |
| Counting the changes of random \(\Delta_2^0\) sets | 2016-01-28 | Paper |
| On \(\Delta_2^0\)-categoricity of equivalence relations | 2015-05-26 | Paper |
| Lowness for effective Hausdorff dimension | 2015-03-03 | Paper |
| Iterated effective embeddings of abelian \(p\)-groups | 2015-01-21 | Paper |
| Complexity of equivalence relations and preorders from computability theory | 2014-12-05 | Paper |
| JSL volume 79 issue 2 Cover and Front matter | 2014-12-05 | Paper |
| Universal computably enumerable equivalence relations | 2014-09-30 | Paper |
| The complexity of recursive splittings of random sets | 2014-06-19 | Paper |
| Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets | 2013-09-03 | Paper |
| Lowness for bounded randomness | 2012-11-27 | Paper |
| Bounded randomness | 2012-06-15 | Paper |
| Limits on jump inversion for strong reducibilities | 2011-12-23 | Paper |
| Strengthening prompt simplicity | 2011-10-10 | Paper |
| Jump inversions inside effectively closed sets and applications to randomness | 2011-06-28 | Paper |
| Beyond strong jump traceability | 2011-03-25 | Paper |
| Difference randomness | 2011-03-10 | Paper |
| On the degrees of diagonal sets and the failure of the analogue of a theorem of Martin | 2010-09-02 | Paper |
| Counting the changes of random \({\Delta}^0_2\) sets | 2010-07-29 | Paper |
| Lowness for Demuth Randomness | 2010-07-28 | Paper |
| Effective packing dimension and traceability | 2010-07-20 | Paper |
| The importance of \(\Pi^0_1\) classes in effective randomness | 2010-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530399 | 2008-10-20 | Paper |
| On strongly jump traceable reals | 2008-05-23 | Paper |
| On very high degrees | 2008-05-08 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Finite final segments of the d.c.e. Turing degrees | N/A | Paper |
| The computational content of multidimensional discontinuity | N/A | Paper |
