| ON SUPERSETS OF NON-LOW2 SETS | 0 | 0.34 | 2021 |
| Multiple Permitting and Array Noncomputability. | 1 | 0.55 | 2018 |
| Automorphism Bases For The Recursively Enumerable Degrees | 0 | 0.34 | 2018 |
| Normalized information distance and the oscillation hierarchy | 0 | 0.34 | 2017 |
| Computability Theory (Dagstuhl Seminar 17081). | 0 | 0.34 | 2017 |
| Learning Finite Variants of Single Languages from Informant. | 0 | 0.34 | 2016 |
| The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. | 0 | 0.34 | 2013 |
| Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees | 6 | 0.68 | 2013 |
| Real Benefit of Promises and Advice. | 1 | 0.36 | 2013 |
| Nontriviality for exponential time w.r.t. weak reducibilities | 1 | 0.41 | 2013 |
| Comparing Nontriviality for E and EXP | 1 | 0.37 | 2012 |
| Inductive inference and computable numberings | 0 | 0.34 | 2011 |
| Bounding non-GL2 and R.E.A | 0 | 0.34 | 2009 |
| Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems | 4 | 0.53 | 2009 |
| Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings | 38 | 3.68 | 2009 |
| Quantitative Aspects of Speed-Up and Gap Phenomena | 0 | 0.34 | 2009 |
| On a question of Frank Stephan | 1 | 0.43 | 2008 |
| Computational Aspects of Disjunctive Sequences | 1 | 0.35 | 2004 |
| Comparing DNR and WWKL | 18 | 2.39 | 2004 |
| Automatic forcing and genericity: on the diagonalization strength of finite automata | 4 | 0.50 | 2003 |
| Problems with Cannot Be Reduced to Any Proper Subproblems | 1 | 0.39 | 2003 |
| Almost complete sets | 1 | 0.36 | 2003 |
| Embeddings of N5 and the contiguous degrees | 3 | 0.49 | 2001 |
| Hausdorff Dimension in Exponential Time | 21 | 0.97 | 2001 |
| Undecidability and 1-types in intervals of the computably enumerable degrees | 1 | 0.40 | 2000 |
| Measure Theoretic Completeness Notions for the Exponential Time Classes | 2 | 0.37 | 2000 |
| Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets | 2 | 0.38 | 1998 |
| Resource bounded randomness and weakly complete problems | 42 | 1.84 | 1997 |
| Separating NP-Completeness notions under strong Hypotheses | 8 | 0.48 | 1997 |
| Genericity and measure for exponential time | 33 | 1.27 | 1996 |
| Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness | 15 | 1.04 | 1996 |
| Decidability Of The Two-Quantifier Theory Of The Recursively Enumerable Weak Truth-Table Degrees And Other Distributive Upper Semi-Lattices | 2 | 0.53 | 1996 |
| A Comparison of Weak Completeness Notions | 8 | 0.54 | 1996 |
| On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract) | 0 | 0.34 | 1995 |
| Resource-bounded genericity | 20 | 0.95 | 1995 |
| Minimal pairs and complete problems | 2 | 0.40 | 1994 |
| Discontinuity Of Cappings In The Recursively-Enumerable Degrees And Strongly Nonbranching Degrees | 1 | 0.40 | 1994 |
| Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 | 11 | 2.50 | 1993 |
| The continuity of cupping to 0' | 8 | 1.12 | 1993 |
| Undecidability and 1-types in the recursively enumerable degrees | 5 | 0.89 | 1993 |
| The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability | 6 | 1.02 | 1992 |
| The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable | 5 | 0.53 | 1992 |
| Cappable recursively enumerable degrees and Post's program | 1 | 0.43 | 1992 |
| Honest polynomial-time degrees of elementary recursive sets | 2 | 0.42 | 1989 |
| The recursively enumerable degrees have infinitely many one-types | 8 | 1.54 | 1989 |
| Honest polynomial time reducibilities and the P=?NP problem | 3 | 0.43 | 1989 |
| Lattice Embeddings into the Recursively Enumerable Degrees II | 7 | 1.56 | 1989 |
| Degree Theoretical Splitting Properties of Recursively Enumerable Sets | 6 | 0.77 | 1988 |
| On Disjunctive Self-Reducibility | 1 | 0.36 | 1988 |
| Diagonalizing over Deterministic Polynomial Time | 15 | 1.04 | 1987 |
