Members of Random Closed Sets. - David Diamondstone; Bjørn Kjos-Hanssen (CiE, 2009)

Promptness does not imply superlow cuppability. - David Diamondstone (J. Symb. Log., 2009)

Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination. - David Diamondstone; Damir D. Dzhafarov; Robert I. Soare (Notre Dame J. Formal Log., 2010)

Strengthening prompt simplicity. - David Diamondstone; Keng Meng Ng (J. Symb. Log., 2011)

Low upper bounds in the LR degrees. - David Diamondstone (Ann. Pure Appl. Log., 2012)

Martin-Löf randomness and Galton-Watson processes. - David Diamondstone; Bjørn Kjos-Hanssen (Ann. Pure Appl. Log., 2012)

Natural Large Degree Spectra. - David Diamondstone; Noam Greenberg; Daniel Turetsky (Comput., 2013)

Lowness for Difference Tests. - David Diamondstone; Johanna N. Y. Franklin (Notre Dame J. Formal Log., 2014)

Limit computability and ultrafilters. - Uri Andrews; Mingzhong Cai; David Diamondstone; Noah Schweber (Comput., 2023)