Symmetric Enumeration Reducibility. - Charles M. Harris (CiE, 2005)

Enumeration Reducibility with Polynomial Time Bounds. - Charles M. Harris (CiE, 2006)

On the Symmetric Enumeration Degrees. - Charles M. Harris (Notre Dame J. Formal Log., 2007)

Goodness in the enumeration and singleton degrees. - Charles M. Harris (Arch. Math. Log., 2010)

On the jump classes of noncuppable enumeration degrees. - Charles M. Harris (J. Symb. Log., 2011)

An Application of 1-Genericity in the $ Pi^0_2$ Enumeration Degrees. - Liliana Badillo; Charles M. Harris (TAMC, 2012)

Badness and jump inversion in the enumeration degrees. - Charles M. Harris (Arch. Math. Log., 2012)

Non-cuppable enumeration degrees via finite injury. - Charles M. Harris (J. Log. Comput., 2012)

On Maximal Block Functions of Computable η-like Linear Orderings. - Charles M. Harris (CiE, 2014)

Avoiding uniformity in the Δ20 enumeration degrees. - Liliana Badillo; Charles M. Harris (Ann. Pure Appl. Log., 2014)

On limitwise monotonicity and maximal block functions. - Charles M. Harris (Comput., 2015)

Automorphisms of η-like computable linear orderings and Kierstead's conjecture. - Charles M. Harris; Kyung Il Lee; S. Barry Cooper (Math. Log. Q., 2016)

Linearisations and the Ershov hierarchy. - S. Barry Cooper; James Gay; Charles M. Harris; Kyung Il Lee; Anthony Morphett (Comput., 2018)

Enumeration 1-Genericity in the Local Enumeration Degrees. - Liliana Badillo; Charles M. Harris; Mariya Ivanova Soskova (Notre Dame J. Formal Log., 2018)