Last updated: July 2011
Promptness does not imply superlow cuppability, Journal of Symbolic Logic 74 (2009), no. 4, 1264-1272.
Members of random closed sets (with Bjørn Kjos-Hanssen), K. Ambos-Spies, B. Lowe, and W. Merkle (Eds.) CiE 2009. Lecture Notes in Computer Science 5635 (2009), 144-153.
Martin-Löf randomness and Galton-Watson processes (with Bjørn Kjos-Hanssen), Annals of Pure and Applied Logic, to appear.
Pi^0_1 classes, Peano arithmetic, randomness, and computable domination (with D. Dzhafarov and R. I. Soare), Notre Dame Journal of Formal Logic 51 (2010), no. 1 (50th Anniversary Issue, #2), 127-159.
Strengthening prompt simplicity (with Keng Meng Ng), Journal of Symbolic Logic 76 (2011), no. 3, 946-972.