Limitwise monotonic functions, sets, and degrees on computable domains. - Asher M. Kach; Daniel Turetsky (J. Symb. Log., 2010)

Decidability and Computability of Certain Torsion-Free Abelian Groups. - Rodney G. Downey; Sergei S. Goncharov; Asher M. Kach; Julia F. Knight; Oleg V. Kudinov; Alexander G. Melnikov; Daniel Turetsky (Notre Dame J. Formal Log., 2010)

Connectedness properties of dimension level sets. - Daniel Turetsky (Theor. Comput. Sci., 2011)

A K-trivial set which is not jump traceable at certain orders. - Daniel Turetsky (Inf. Process. Lett., 2012)

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

Joining non-low C.E. sets with diagonally non-computable functions. - Laurent Bienvenu; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Daniel Turetsky (J. Log. Comput., 2013)

Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle. - Chris J. Conidis; Noam Greenberg; Daniel Turetsky (Notre Dame J. Formal Log., 2013)

Computing k-Trivial Sets by Incomplete Random Sets. - Laurent Bienvenu; Adam R. Day; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Dan Turetsky (Bull. Symb. Log., 2014)

Lowness for effective Hausdorff dimension. - Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Daniel D. Turetsky; Rebecca Weber (J. Math. Log., 2014)

Characterizing Lowness for Demuth Randomness. - Laurent Bienvenu; Rod Downey; Noam Greenberg; André Nies; Daniel Turetsky (J. Symb. Log., 2014)

Partial functions and domination. - C. T. Chong; Gordon Hoi; Frank Stephan 001; Daniel Turetsky (Log. Methods Comput. Sci., 2015)

Computability and uncountable Linear Orders I: Computable Categoricity. - Noam Greenberg; Asher M. Kach; Steffen Lempp; Daniel Turetsky (J. Symb. Log., 2015)

Computability and uncountable Linear Orders II: degree spectra. - Noam Greenberg; Asher M. Kach; Steffen Lempp; Daniel D. Turetsky (J. Symb. Log., 2015)

Linear Orders Realized by C.E. Equivalence Relations. - Ekaterina B. Fokina; Bakhadyr Khoussainov; Pavel Semukhin; Daniel Turetsky (J. Symb. Log., 2016)

Strong jump-Traceability. - Noam Greenberg; Dan Turetsky (Bull. Symb. Log., 2018)

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

Uniform Procedures in uncountable Structures. - Noam Greenberg; Alexander G. Melnikov; Julia F. Knight; Daniel Turetsky (J. Symb. Log., 2018)

Two More Characterizations of K-Triviality. - Noam Greenberg; Joseph S. Miller; Benoit Monin; Daniel Turetsky (Notre Dame J. Formal Log., 2018)

Computability-theoretic categoricity and Scott families. - Ekaterina B. Fokina; Valentina S. Harizanov; Daniel Turetsky (Ann. Pure Appl. Log., 2019)

Cardinal invariants, non-lowness classes, and Weihrauch reducibility. - Noam Greenberg; Rutger Kuyper; Dan Turetsky (Comput., 2019)

Effective aspects of algorithmically random structures. - Matthew Harrison-Trainor; Bakh Khoussainov; Daniel Turetsky (Comput., 2019)

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

Graphs are not universal for online computability. - Rodney G. Downey; Matthew Harrison-Trainor; Iskander Sh. Kalimullin; Alexander G. Melnikov; Daniel Turetsky (J. Comput. Syst. Sci., 2020)

Coding in the automorphism group of a computably categorical structure. - Dan Turetsky (J. Math. Log., 2020)

Punctual Categoricity and Universality. - Rod Downey; Noam Greenberg; Alexander G. Melnikov; Keng Meng Ng; Daniel Turetsky (J. Symb. Log., 2020)

Non-density in punctual computability. - Noam Greenberg; Matthew Harrison-Trainor; Alexander G. Melnikov; Dan Turetsky (Ann. Pure Appl. Log., 2021)

Scott Complexity of Countable Structures. - Rachael Alvir; Noam Greenberg; Matthew Harrison-Trainor; Dan Turetsky (J. Symb. Log., 2021)

Relationships between Computability-Theoretic Properties of Problems. - Rod Downey; Noam Greenberg; Matthew Harrison-Trainor; Ludovic Patey; Dan Turetsky (J. Symb. Log., 2022)

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

Iterated Priority Arguments in Descriptive Set Theory. - Adam R. Day; Noam Greenberg; Matthew Harrison-Trainor; Dan Turetsky (Bull. Symb. Log., 2024)

Enumerations of families closed under finite differences. - Noam Greenberg; Matthew Harrison-Trainor; Joseph S. Miller; Dan Turetsky (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)

Normality, Relativization, and Randomness. - Wesley Calvert; Emma Gruner; Elvira Mayordomo; Daniel Turetsky; Java Darleen Villano (Theory Comput. Syst., 2025)