Generation Complexity Versus Distinction Complexity. - Rupert Hölzl 001; Wolfgang Merkle (TAMC, 2008)

Separations of Non-monotonic Randomness Notions. - Laurent Bienvenu; Rupert Hölzl 001; Thorsten Kräling; Wolfgang Merkle (CCA, 2009)

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

Initial Segment Complexities of Randomness Notions. - Rupert Hölzl 001; Thorsten Kräling; Frank Stephan 001; Guohua Wu (IFIP TCS, 2010)

Traceable Sets. - Rupert Hölzl 001; Wolfgang Merkle (IFIP TCS, 2010)

The Denjoy alternative for computable functions. - Laurent Bienvenu; Rupert Hölzl 001; Joseph S. Miller; André Nies (STACS, 2012)

Analogues of Chaitin's Omega in the computably enumerable sets. - George Barmpalias; Rupert Hölzl 001; Andrew E. M. Lewis; Wolfgang Merkle (Inf. Process. Lett., 2013)

From bi-immunity to absolute undecidability. - Laurent Bienvenu; Adam R. Day; Rupert Hölzl 001 (J. Symb. Log., 2013)

Denjoy, Demuth and density. - Laurent Bienvenu; Rupert Hölzl 001; Joseph S. Miller; André Nies (J. Math. Log., 2014)

Las Vegas Computability and Algorithmic Randomness. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001 (STACS, 2015)

Inductive Inference and Reverse Mathematics. - Rupert Hölzl 001; Sanjay Jain 001; Frank Stephan 001 (STACS, 2015)

Universality, optimality, and randomness deficiency. - Rupert Hölzl 001; Paul Shafer (Ann. Pure Appl. Log., 2015)

Probabilistic computability and choice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001 (Inf. Comput., 2015)

Learning Pattern Languages over Groups. - Rupert Hölzl 001; Sanjay Jain 001; Frank Stephan 001 (ALT, 2016)

On Martin's pointed tree theorem. - Rupert Hölzl 001; Frank Stephan 001; Liang Yu 004 (Comput., 2016)

Automatic Learning from Repetitive Texts. - Rupert Hölzl 001; Sanjay Jain 001; Philipp Schlicht; Karen Seidel 001; Frank Stephan 001 (ALT, 2017)

The Vitali Covering Theorem in the Weihrauch Lattice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001; Arno Pauly (Computability and Complexity, 2017)

Weakly Represented Families in Reverse Mathematics. - Rupert Hölzl 001; Dilip Raghavan; Frank Stephan 001; Jing Zhang (Computability and Complexity, 2017)

Monte Carlo Computability. - Vasco Brattka; Rupert Hölzl 001; Rutger Kuyper (STACS, 2017)

Randomness for computable measures and initial segment complexity. - Rupert Hölzl 001; Christopher P. Porter (Ann. Pure Appl. Log., 2017)

Randomness and Semimeasures. - Laurent Bienvenu; Rupert Hölzl 001; Christopher P. Porter; Paul Shafer (Notre Dame J. Formal Log., 2017)

Rank and Randomness. - Rupert Hölzl 001; Christopher P. Porter (J. Symb. Log., 2019)

Chaitin's ω as a continuous function. - Rupert Hölzl 001; Wolfgang Merkle; Joseph S. Miller; Frank Stephan 001; Liang Yu 004 (J. Symb. Log., 2020)

Degrees of Randomized Computability. - Rupert Hölzl 001; Christopher P. Porter (Bull. Symb. Log., 2022)

Randomness Versus Superspeedability. - Rupert Hölzl 001; Philip Janicki; Wolfgang Merkle; Frank Stephan 001 (MFCS, 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)