Schnorr trivial reals: a construction. - Johanna N. Y. Franklin (Arch. Math. Log., 2008)

Hyperimmune-free degrees and Schnorr triviality. - Johanna N. Y. Franklin (J. Symb. Log., 2008)

Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms. - Douglas Cenzer; Johanna N. Y. Franklin; Jiang Liu 002; Guohua Wu (TAMC, 2009)

Schnorr triviality and genericity. - Johanna N. Y. Franklin (J. Symb. Log., 2010)

Schnorr trivial sets and truth-table reducibility. - Johanna N. Y. Franklin; Frank Stephan 001 (J. Symb. Log., 2010)

Subclasses of the Weakly Random Reals. - Johanna N. Y. Franklin (Notre Dame J. Formal Log., 2010)

A superhigh diamond in the c.e. tt-degrees. - Douglas Cenzer; Johanna N. Y. Franklin; Jiang Liu 002; Guohua Wu (Arch. Math. Log., 2011)

Van Lambalgen's Theorem and High Degrees. - Johanna N. Y. Franklin; Frank Stephan 001 (Notre Dame J. Formal Log., 2011)

Local Computability for Ordinals. - Johanna N. Y. Franklin; Asher M. Kach; Russell G. Miller; Reed Solomon (CiE, 2013)

Anti-complex sets and reducibilities with tiny use. - Johanna N. Y. Franklin; Noam Greenberg; Frank Stephan 001; Guohua Wu (J. Symb. Log., 2013)

Degrees of Categoricity and the Hyperarithmetic Hierarchy. - Barbara F. Csima; Johanna N. Y. Franklin; Richard A. Shore (Notre Dame J. Formal Log., 2013)

Degrees that Are Low for Isomorphism. - Johanna N. Y. Franklin; Reed Solomon (Comput., 2014)

ω-Change Randomness and Weak Demuth Randomness. - Johanna N. Y. Franklin; Keng Meng Ng (J. Symb. Log., 2014)

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

Genericity and UD-random reals. - Wesley Calvert; Johanna N. Y. Franklin (J. Log. Anal., 2015)

Strength and Weakness in Computable Structure Theory. - Johanna N. Y. Franklin (Computability and Complexity, 2017)

Lowness for isomorphism and degrees of genericity. - Johanna N. Y. Franklin; Dan Turetsky (Comput., 2018)

Taking the path computably traveled. - Johanna N. Y. Franklin; Dan Turetsky (J. Log. Comput., 2019)

Algorithmic Randomness and Fourier Analysis. - Johanna N. Y. Franklin; Timothy H. McNicholl; Jason Rute (Theory Comput. Syst., 2019)

Degrees of and lowness for isometric isomorphism. - Johanna N. Y. Franklin; Timothy H. McNicholl (J. Log. Anal., 2020)

Lowness for isomorphism, countable ideals, and computable traceability. - Johanna N. Y. Franklin; Reed Solomon (Math. Log. Q., 2020)

A Church-Turing Thesis for Randomness? - Johanna N. Y. Franklin (CiE, 2021)

Structural Highness Notions. - Wesley Calvert; Johanna N. Y. Franklin; Dan Turetsky (J. Symb. Log., 2023)

Preface of the special issue for the conference computability in Europe 2022. - Ulrich Berger 001; Johanna N. Y. Franklin; Elvira Mayordomo (Comput., 2024)

Computable classifications of continuous, transducer, and regular functions. - Johanna N. Y. Franklin; Rupert Hölzl 001; Alexander G. Melnikov; Keng Meng Ng; Daniel Turetsky (Theor. Comput. Sci., 2025)