Prime models of computably enumerable degree. - Rachel Epstein (J. Symb. Log., 2008)

Random strings and tt-degrees of Turing complete C.E. sets. - Mingzhong Cai; Rodney G. Downey; Rachel Epstein; Steffen Lempp; Joseph S. Miller (Log. Methods Comput. Sci., 2014)

Computably enumerable sets that are automorphic to low sets. - Peter Cholak; Rachel Epstein (Comput., 2017)

Agreement reducibility. - Rachel Epstein; Karen M. Lange (Math. Log. Q., 2020)