| Publication | Date of Publication | Type |
|---|
| Realizing computably enumerable degrees in separating classes | 2026-09-22 | Paper |
The geometry of computable Banach spaces
Information and Computation | 2026-06-11 | Paper |
| Some notes on the wtt-jump | 2026-04-20 | Paper |
On quasi-reducibility for c.e. sets. I: The structure of the Q-degrees and the sQ-degrees
Journal of Logic and Computation | 2026-02-25 | Paper |
Limit complexities, minimal descriptions, and n-randomness
The Journal of Symbolic Logic | 2025-12-10 | Paper |
Computable structure theory. A unified approach
Theory and Applications of Computability | 2025-07-28 | Paper |
Algorithmically random series
Computability | 2025-03-03 | Paper |
Punctually presented structures. II: Comparing presentations.
Archive for Mathematical Logic | 2025-02-18 | Paper |
| Some open questions and recent results on computable Banach spaces | 2025-02-07 | Paper |
Notes on Sacks' splitting theorem
The Journal of Symbolic Logic | 2025-02-03 | Paper |
On the c.e. degrees realizable in ^0_1 classes
Journal of Symbolic Logic | 2024-11-25 | Paper |
Computability and complexity. Foundations and tools for pursuing scientific applications
Undergraduate Topics in Computer Science | 2024-06-03 | Paper |
Lowness properties for strong reducibilities and the computational power of maximal sets
Computability | 2024-04-15 | Paper |
Online, computable and punctual structure theory
Logic Journal of the IGPL | 2024-02-20 | Paper |
COMPUTABLY COMPACT METRIC SPACES
The Bulletin of Symbolic Logic | 2023-08-10 | Paper |
| Computable analysis and classification problems | 2022-12-16 | Paper |
A MINIMAL SET LOW FOR SPEED
Journal of Symbolic Logic | 2022-11-18 | Paper |
Three topological reducibilities for discontinuous functions
Transactions of the American Mathematical Society, Series B | 2022-10-28 | Paper |
| Limit Complexities, Minimal Descriptions, and n-Randomness | 2022-08-05 | Paper |
Cousin’s lemma in second-order arithmetic
Proceedings of the American Mathematical Society, Series B | 2022-04-27 | Paper |
Relationships between computability-theoretic properties of problems
Journal of Symbolic Logic | 2022-04-12 | Paper |
ON SUPERSETS OF NON-LOW SETS
Journal of Symbolic Logic | 2021-12-09 | Paper |
Maximality and collapse in the hierarchy of -c.a. degrees
Computability | 2021-11-18 | Paper |
Foundations of online structure theory. II: The operator approach
(available as arXiv preprint) | 2021-10-08 | Paper |
| Foundations of online structure theory. II: The operator approach | 2021-10-08 | Paper |
Hierarchy of Computably Enumerable Degrees II
New Zealand Journal of Mathematics | 2021-09-28 | Paper |
Sir Vaughan Frederick Randal Jones
New Zealand Journal of Mathematics | 2021-09-28 | Paper |
| scientific article; zbMATH DE number 7377983 (Why is no real title available?) | 2021-08-03 | Paper |
Relativizing computable categoricity
Proceedings of the American Mathematical Society | 2021-07-28 | Paper |
Cousin's lemma in second-order arithmetic
(available as arXiv preprint) | 2021-05-06 | Paper |
PUNCTUAL CATEGORICITY AND UNIVERSALITY
Journal of Symbolic Logic | 2021-04-15 | Paper |
A minimal set low for speed
(available as arXiv preprint) | 2020-11-18 | Paper |
Enumerating abelian \(p\)-groups
Journal of Algebra | 2020-08-25 | Paper |
| Realizing Computably Enumerable Degrees in Separating Classes | 2020-08-23 | Paper |
| On low for speed oracles | 2020-08-05 | Paper |
Foundations of Online Structure Theory II: The Operator Approach
(available as arXiv preprint) | 2020-07-14 | Paper |
Minimal weak truth table degrees and computably enumerable Turing degrees
Memoirs of the American Mathematical Society | 2020-06-19 | Paper |
Graphs are not universal for online computability
Journal of Computer and System Sciences | 2020-06-09 | Paper |
| A Hierarchy of Turing Degrees | 2020-03-09 | Paper |
On realization of index sets in \(\Pi_1^0\)-classes
Algebra and Logic | 2020-02-28 | Paper |
Splitting theorems and low degrees
Computability | 2020-01-17 | Paper |
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
Journal of Symbolic Logic | 2020-01-10 | Paper |
On low for speed oracles
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Computability and Randomness
Notices of the American Mathematical Society | 2019-10-28 | Paper |
Martin-Löf randomness implies multiple recurrence in effectively closed sets
Notre Dame Journal of Formal Logic | 2019-10-22 | Paper |
FOUNDATIONS OF ONLINE STRUCTURE THEORY
The Bulletin of Symbolic Logic | 2019-08-01 | Paper |
Categorical linearly ordered structures
Annals of Pure and Applied Logic | 2019-07-10 | Paper |
| Degree spectra of unary relations on \langle \omega, \leq \rangle | 2019-04-23 | Paper |
Relationships between computability-theoretic properties of problems
(available as arXiv preprint) | 2019-03-11 | Paper |
Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
Journal of Symbolic Logic | 2018-08-10 | Paper |
Degrees containing members of thin _1⁰ classes are dense and co-dense
Journal of Mathematical Logic | 2018-06-13 | Paper |
Splitting into degrees with low computational strength
Annals of Pure and Applied Logic | 2018-06-05 | Paper |
On a question of Kalimullin
Proceedings of the American Mathematical Society | 2018-06-04 | Paper |
A hierarchy of computably enumerable degrees
The Bulletin of Symbolic Logic | 2018-05-03 | Paper |
Corrigendum to: ``Advice classes of parameterized tractability''
Annals of Pure and Applied Logic | 2018-03-21 | Paper |
A Friedberg enumeration of equivalence structures
Journal of Mathematical Logic | 2017-12-04 | Paper |
Corrigendum: "On the complexity of the successivity relation in computable linear orderings"
Journal of Mathematical Logic | 2017-12-04 | Paper |
Lowness and logical depth
Theoretical Computer Science | 2017-11-06 | Paper |
The finite intersection principle and genericity
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
Minimal Pairs in the C.E. Truth-table Degrees
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
Resolute sequences in initial segment complexity
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Any FIP real computes a 1-generic
Transactions of the American Mathematical Society | 2017-05-23 | Paper |
Kobayashi compressibility
Theoretical Computer Science | 2017-05-12 | Paper |
Notes on computable analysis
Theory of Computing Systems | 2017-03-31 | Paper |
Generic Muchnik reducibility and presentations of fields
Israel Journal of Mathematics | 2017-01-11 | Paper |
Courcelle's theorem for triangulations
Journal of Combinatorial Theory. Series A | 2016-11-29 | Paper |
Abelian p-groups and the halting problem
Annals of Pure and Applied Logic | 2016-08-31 | Paper |
| Multiple Recurrence and Algorithmic Randomness | 2016-04-14 | Paper |
Myhill-Nerode methods for hypergraphs
Algorithmica | 2016-02-19 | Paper |
Solovay functions and their applications in algorithmic randomness
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Integer valued betting strategies and Turing degrees
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Asymptotic density and the Ershov hierarchy
Mathematical Logic Quarterly | 2015-06-22 | Paper |
On \(\Delta_2^0\)-categoricity of equivalence relations
Annals of Pure and Applied Logic | 2015-05-26 | Paper |
The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
Annals of Pure and Applied Logic | 2015-05-15 | Paper |
Iterated effective embeddings of abelian p-groups
International Journal of Algebra and Computation | 2015-01-21 | Paper |
Exact pairs for the ideal of the K-trivial sequences in the Turing degrees
Journal of Symbolic Logic | 2014-12-05 | Paper |
The complexity of computable categoricity
Advances in Mathematics | 2014-11-17 | Paper |
Confronting intractability via parameters
Computer Science Review | 2014-10-24 | Paper |
Characterizing lowness for Demuth randomness
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Random strings and truth-table degrees of Turing complete c.e. sets
Logical Methods in Computer Science | 2014-09-30 | Paper |
Computable completely decomposable groups
Transactions of the American Mathematical Society | 2014-09-17 | Paper |
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
Journal of Mathematical Logic | 2014-03-10 | Paper |
Fundamentals of parameterized complexity
Texts in Computer Science | 2013-12-06 | Paper |
Strong jump-traceability. II: K-triviality
Israel Journal of Mathematics | 2013-11-01 | Paper |
| Cutting up is hard to do: the parameterised complexity of k-cut and related problems | 2013-08-27 | Paper |
Extensions of embeddings below computably enumerable degrees
Transactions of the American Mathematical Society | 2013-07-08 | Paper |
Effectively categorical abelian groups
Journal of Algebra | 2013-07-02 | Paper |
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
Proceedings of the 11th Asian Logic Conference | 2013-06-03 | Paper |
Computable categoricity versus relative computable categoricity
Fundamenta Mathematicae | 2013-05-10 | Paper |
Schnorr randomness
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Trivial Reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
Advances in Mathematics | 2013-04-16 | Paper |
Lowness for bounded randomness
Theoretical Computer Science | 2012-11-27 | Paper |
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Randomness, computation and mathematics
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Bounded randomness
Computation, Physics and Beyond | 2012-06-15 | Paper |
A parameterized complexity tutorial
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Kolmogorov complexity and solovay functions
(available as arXiv preprint) | 2012-04-24 | Paper |
| Kolmogorov complexity and solovay functions | 2012-04-24 | Paper |
| Computability, algorithmic randomness and complexity | 2012-03-29 | Paper |
Limits on jump inversion for strong reducibilities
Journal of Symbolic Logic | 2011-12-23 | Paper |
