Topological aspects of the Medvedev lattice, with Richard Shore and Andrea Sorbi. Pdf.
Extensions of embeddings below computably enumerable degrees, with Rod Downey, Antonio Montalban and Noam Greenberg. Pdf.
Properties of the jump classes, submitted, Pdf.
Empty intervals in the e-degrees, with Andrea Sorbi and Thomas Kent, submitted, Pdf.
A note on the join property, submitted, Pdf.
Joining up to the generalized high degrees, with Philip Ellison, to appear in the Proceedings of the American Mathematical Society, Pdf.
The importance of \Pi^0_1 classes in effective randomness, with George Barmpalias and Keng-Meng Ng, to appear in the Journal of Symbolic Logic, Pdf.
The first-order theories of the Medvedev and Muchnik lattices, with Andre Nies and Andrea Sorbi, to appear in Lecture Notes in Computer Science, Pdf.
On the degree spectrum of a \Pi^0_1 class, with Thomas Kent, to appear in the Transactions of the American Mathematical Society, Pdf.
On a question of Slaman and Groszek, Proceedings of the American Mathematical Society 136 (2008), 3663-3668. Pdf
A fixed point free minimal degree, with Masahiro Kumabe, to appear in the Journal of the London Mathematical Society. Pdf
\Pi^0_1 classes, LR degrees and Turing degrees, with George Barmpalias and Frank Stephan, Annals of Pure and Applied Logic, 156 (2008) 21-38. Pdf
Lowness, randomness and degrees, with George Barmpalias and Mariya Soskova, Journal of Symbolic Logic. vol.73, Issue 2, pp. 559-577 (2008). Pdf
A weakly 2-random which is not GL_1, with Antonio Montalban and Andre Nies, Lecture Notes in Computer Science vol 4497. Pdf
A random degree with strong minimal cover, Bulletin of the London Mathematical Society, 2007, 39(5), 848-856. Pdf
Strong minimal covers and a question of Yates: the story so far, Proceedings of the Logic Colloquium 2006. Pdf
\Pi^0_1 classes, strong minimal covers and hyperimmune-free degrees, Bulletin of the London Mathematical Society, December 2007. Pdf
The ibT degrees of c.e. sets are not dense, with George Barmpalias, Annals of Pure and Applied Logic, volume 141, issues 1-2 2006.
The jump classes of minimal covers, Logical Approaches to Computational Barriers, Second conference on Computability in Europe, CiE 2006, Lecture Notes in Computer Science, 307-318.
A single minimal complement for the c.e. degrees, Transactions of the American Mathematical Society 359 (2007), 5817-5865.
A partial solution to a question of Sacks, New Computational Paradigms, proceedings of CiE 2005, Lecture Notes in Computer Science 3526, 275-286.
Randomness and the linear degrees of computability, with George Barmpalias, Annals of Pure and Applied Logic, volume 145, issue 3 (2007), 252-257.
On a question of Sacks: a partial solution on the positive side.
The hypersimple-free wtt degrees are dense in the c.e. wtt degrees, with George Barmpalias, Notre Dame Journal of Formal Logic, volume 47 issue 3 (2006).
Working with the LR Degrees, with George Barmpalias, Mariya Soskova, Theory and Applications of Models of Computation: 4th International Conference TAMC 2007, Shanghai, China, May 2007, Proceedings (J.-Y. Cai, S.B. Cooper, H. Zhu, eds.), Springer Lecture Notes in Computer Science, LNCS 4484, 2007.
Random reals and Lipschitz continuity, with George Barmpalias, Mathematical Structures in Computer Science, volume 16, issue 5 (2006).
A c.e. real that cannot be sw computed by any \Omega number, with George Barmpalias, Notre Dame Journal of Formal Logic, vol 47 (2), 197-209.
The minimal complementation property above 0', Mathematical Logic Quarterly, 51 (5), 470-492.
Properly \Sigma_2 minimal degrees and 0'' complementation, with Barry Cooper and Yue Yang, Mathematical Quarterly, 51, 274-276.
Finite cupping sets, Archive for Mathematical Logic, 43, 845-858.
Minimal complements for degrees below 0', Journal of Symbolic Logic, 69 (4), 937-966.