| Publication | Date of Publication | Type |
|---|
Lowness properties for strong reducibilities and the computational power of maximal sets
Computability | 2024-04-15 | Paper |
The theory of the polynomial many-one degrees of recursive sets is undecidable
STACS 92 | 2022-08-18 | Paper |
Genericity and measure for exponential time (extended abstract)
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| Some observations on mitotic sets | 2022-03-22 | Paper |
ON SUPERSETS OF NON-LOW SETS
Journal of Symbolic Logic | 2021-12-09 | Paper |
Normalized information distance and the oscillation hierarchy
Journal of Computer and System Sciences | 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
Theory of Computing Systems | 2019-09-05 | Paper |
| scientific article; zbMATH DE number 7015118 (Why is no real title available?) | 2019-02-07 | Paper |
On optimal polynomial time approximations: p-levelability vs. \(\Delta\)-levelability
Automata, Languages and Programming | 2019-01-10 | Paper |
Automorphism bases for the recursively enumerable degrees
Computability | 2018-09-20 | Paper |
| Multiple permitting and array noncomputability | 2018-09-06 | Paper |
Resource-bounded balanced genericity, stochasticity and weak randomness
STACS 96 | 2017-11-16 | Paper |
On the strongly bounded Turing degrees of the computably enumerable sets
Computability and Complexity | 2017-04-04 | Paper |
Learning finite variants of single languages from informant
Lecture Notes in Computer Science | 2016-11-09 | Paper |
| On the strongly bounded Turing degrees of simple sets | 2015-04-09 | Paper |
Numberings and learnability
Lobachevskii Journal of Mathematics | 2015-03-17 | Paper |
Nontriviality for exponential time w.r.t. weak reducibilities
Theoretical Computer Science | 2014-01-10 | Paper |
Real benefit of promises and advice
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
Theory of Computing Systems | 2013-04-15 | Paper |
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
Annals of Pure and Applied Logic | 2013-04-05 | Paper |
Comparing nontriviality for E and EXP
Theory of Computing Systems | 2012-12-07 | Paper |
Inductive inference and computable numberings
Theoretical Computer Science | 2011-04-05 | Paper |
Quantitative aspects of speed-up and gap phenomena
Mathematical Structures in Computer Science | 2010-12-01 | Paper |
Weak completeness notions for exponential time
Automata, Languages and Programming | 2010-09-07 | Paper |
Nontriviality for Exponential Time w.r.t. Weak Reducibilities
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Bounding non-GL2 and R.E.A.
Journal of Symbolic Logic | 2009-09-29 | Paper |
Quantitative Aspects of Speed-Up and Gap Phenomena
Lecture Notes in Computer Science | 2009-06-03 | Paper |
| Generating sets for the recursively enumerable Turing degrees | 2008-10-20 | Paper |
On a Question of Frank Stephan
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Comparing DNR and WWKL
Journal of Symbolic Logic | 2005-08-29 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Almost complete sets.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2040942 (Why is no real title available?) | 2004-02-11 | Paper |
Embeddings of \(N_5\) and the contiguous degrees
Annals of Pure and Applied Logic | 2003-01-30 | Paper |
| scientific article; zbMATH DE number 1759402 (Why is no real title available?) | 2002-11-04 | Paper |
| Effective Baire category concepts | 2002-07-25 | Paper |
Undecidability and 1-types in intervals of the computably enumerable degrees
Annals of Pure and Applied Logic | 2001-10-23 | Paper |
Weakly computable real numbers
Journal of Complexity | 2001-05-29 | Paper |
Separating NP-completeness notions under strong hypotheses
Journal of Computer and System Sciences | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1500533 (Why is no real title available?) | 2001-03-13 | Paper |
| scientific article; zbMATH DE number 1555954 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1531917 (Why is no real title available?) | 2000-11-19 | Paper |
| scientific article; zbMATH DE number 1390028 (Why is no real title available?) | 2000-07-27 | Paper |
| scientific article; zbMATH DE number 1420830 (Why is no real title available?) | 2000-03-22 | Paper |
| scientific article; zbMATH DE number 1354179 (Why is no real title available?) | 1999-10-28 | Paper |
Initial segments of recursive linear orders
Order | 1999-03-25 | Paper |
| scientific article; zbMATH DE number 1222581 (Why is no real title available?) | 1999-03-02 | Paper |
Resource bounded randomness and weakly complete problems
Theoretical Computer Science | 1998-07-23 | Paper |
| scientific article; zbMATH DE number 1048036 (Why is no real title available?) | 1997-09-22 | Paper |
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices
Journal of Symbolic Logic | 1997-06-03 | Paper |
Genericity and measure for exponential time
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 841081 (Why is no real title available?) | 1996-02-04 | Paper |
| scientific article; zbMATH DE number 817509 (Why is no real title available?) | 1995-11-16 | Paper |
| scientific article; zbMATH DE number 749917 (Why is no real title available?) | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 733390 (Why is no real title available?) | 1995-08-27 | Paper |
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees
Mathematical Logic Quarterly | 1995-06-08 | Paper |
The continuity of cupping to \(\text \textbf{0}'\)
Annals of Pure and Applied Logic | 1995-01-29 | Paper |
Minimal pairs and complete problems
Theoretical Computer Science | 1994-09-25 | Paper |
Undecidability and 1-types in the recursively enumerable degrees
Annals of Pure and Applied Logic | 1994-06-05 | Paper |
Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
Journal of the London Mathematical Society | 1994-04-27 | Paper |
Cappable recursively enumerable degrees and Post's program
Archive for Mathematical Logic | 1994-01-13 | Paper |
The theory of the recursively enumerable weak truth-table degrees is undecidable
Journal of Symbolic Logic | 1993-04-01 | Paper |
| scientific article; zbMATH DE number 18526 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4189714 (Why is no real title available?) | 1990-01-01 | Paper |
On the relative complexity of hard problems for complexity classes without complete problems
Theoretical Computer Science | 1989-01-01 | Paper |
Honest polynomial time reducibilities and the \(P=?NP\) problem
Journal of Computer and System Sciences | 1989-01-01 | Paper |
The recursively enumerable degrees have infinitely many one-types
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
Lattice embeddings into the recursively enumerable degrees. II
Journal of Symbolic Logic | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4179363 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4121422 (Why is no real title available?) | 1988-01-01 | Paper |
Degree theoretical splitting properties of recursively enumerable sets
Journal of Symbolic Logic | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4037840 (Why is no real title available?) | 1987-01-01 | Paper |
Diagonalizations over polynomial time computable sets
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3995648 (Why is no real title available?) | 1986-01-01 | Paper |
Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets
Information Processing Letters | 1986-01-01 | Paper |
Lattice embeddings into the recursively enumerable degrees
Journal of Symbolic Logic | 1986-01-01 | Paper |
A note on complete problems for complexity classes
Information Processing Letters | 1986-01-01 | Paper |
An Inhomogeneity in the Structure of Karp Degrees
SIAM Journal on Computing | 1986-01-01 | Paper |
Sublattices of the polynomial time degrees
Information and Control | 1985-01-01 | Paper |
Cupping and noncapping in the r.e. weak truth table and turing degrees
Archiv für Mathematische Logik und Grundlagenforschung | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3922634 (Why is no real title available?) | 1985-01-01 | Paper |
Anti‐Mitotic Recursively Enumerable Sets
Mathematical Logic Quarterly | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3922635 (Why is no real title available?) | 1985-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 |
An extension of the nondiamond theorem in classical and α-recursion theory
Journal of Symbolic Logic | 1984-01-01 | Paper |
| On Pairs of Recursively Enumerable Degrees | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3895050 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3869312 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3869313 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3885884 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3845570 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3845569 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3760148 (Why is no real title available?) | 1981-01-01 | Paper |
