Quantitative aspects of speed-up and gap phenomena. - Klaus Ambos-Spies; Thorsten Kräling (Math. Struct. Comput. Sci., 2010)

Separations of non-monotonic randomness notions. - Laurent Bienvenu; Rupert Hölzl 001; Thorsten Kräling; Wolfgang Merkle (J. Log. Comput., 2012)

The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. - Klaus Ambos-Spies; Philipp Bodewig; Yun Fan; Thorsten Kräling (Ann. Pure Appl. Log., 2013)

Time-Bounded Kolmogorov Complexity and Solovay Functions. - Rupert Hölzl 001; Thorsten Kräling; Wolfgang Merkle (Theory Comput. Syst., 2013)

Initial segment complexities of randomness notions. - Rupert Hölzl 001; Thorsten Kräling; Frank Stephan 001; Guohua Wu (Inf. Comput., 2014)

Joins and Meets in the Partial Orders of the Computably Enumerable ibT- and cl-Degrees - Thorsten Kräling (2014)