Proving the PCP-Theorem. - Volker Heun; Wolfgang Merkle; Ulrich Weigand (Lectures on Proof Verification and Approximation Algorithms, 1997)

A generalized account of resource bounded reducibilities. - Wolfgang Merkle (1997)

Exact Pairs for Abstract Bounded Reducibilities. - Wolfgang Merkle (Math. Log. Q., 1999)

Unlearning Helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001 (ICALP, 2000)

Hausdorff Dimension in Exponential Time. - Klaus Ambos-Spies; Wolfgang Merkle; Jan Reimann 001; Frank Stephan 001 (CCC, 2001)

Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. - Wolfgang Merkle; Yongge Wang 001 (Math. Log. Q., 2001)

The Global Power of Additional Queries to P-Random Oracles. - Wolfgang Merkle (SIAM J. Comput., 2001)

Structural properties of bounded relations with an application to NP optimization problems. - Wolfgang Merkle (Theor. Comput. Sci., 2001)

Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. - Todd Ebert; Wolfgang Merkle (MFCS, 2002)

On the Construction of Effective Random Sets. - Wolfgang Merkle; Nenad Mihailovic (MFCS, 2002)

Lattice Embeddings for Abstract Bounded Reducibilities. - Wolfgang Merkle (SIAM J. Comput., 2002)

The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences. - Wolfgang Merkle (J. Symb. Log., 2003)

On the Autoreducibility of Random Sequences. - Todd Ebert; Wolfgang Merkle; Heribert Vollmer (SIAM J. Comput., 2003)

Almost complete sets. - Klaus Ambos-Spies; Wolfgang Merkle; Jan Reimann 001; Sebastiaan Terwijn (Theor. Comput. Sci., 2003)

Refuting learning revisited. - Wolfgang Merkle; Frank Stephan 001 (Theor. Comput. Sci., 2003)

Trees and learning. - Wolfgang Merkle; Frank Stephan 001 (J. Comput. Syst. Sci., 2004)

On the construction of effectively random sets. - Wolfgang Merkle; Nenad Mihailovic (J. Symb. Log., 2004)

06051 Abstracts Collection – Kolmogorov Complexity and Applications. - Marcus Hutter; Wolfgang Merkle; Paul M. B. Vitányi (Kolmogorov Complexity and Applications, 2006)

Kolmogorov Complexity and the Recursion Theorem. - Bjørn Kjos-Hanssen; Wolfgang Merkle; Frank Stephan 001 (STACS, 2006)

Generality's price: Inescapable deficiencies in machine-learned programs. - John Case; Keh-Jiann Chen; Sanjay Jain 001; Wolfgang Merkle; James S. Royer (Ann. Pure Appl. Log., 2006)

Kolmogorov-Loveland randomness and stochasticity. - Wolfgang Merkle; Joseph S. Miller; André Nies; Jan Reimann 001; Frank Stephan 001 (Ann. Pure Appl. Log., 2006)

Effective Randomness for Computable Probability Measures. - Laurent Bienvenu; Wolfgang Merkle (CCA, 2006)

Schnorr dimension. - Rodney G. Downey; Wolfgang Merkle; Jan Reimann 001 (Math. Struct. Comput. Sci., 2006)

Some Results on Effective Randomness. - Wolfgang Merkle; Nenad Mihailovic; Theodore A. Slaman (Theory Comput. Syst., 2006)

Selection Functions that Do Not Preserve Normality. - Wolfgang Merkle; Jan Reimann 001 (Theory Comput. Syst., 2006)

On C-Degrees, H-Degrees and T-Degrees. - Wolfgang Merkle; Frank Stephan 001 (CCC, 2007)

Reconciling Data Compression and Kolmogorov Complexity. - Laurent Bienvenu; Wolfgang Merkle (ICALP, 2007)

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

A Simple Proof of Miller-Yu Theorem. - Laurent Bienvenu; Wolfgang Merkle; Alexander Shen 001 (Fundam. Informaticae, 2008)

When unlearning helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001; Rolf Wiehagen (Inf. Comput., 2008)

The complexity of stochastic sequences. - Wolfgang Merkle (J. Comput. Syst. Sci., 2008)

Constructive equivalence relations on computable probability measures. - Laurent Bienvenu; Wolfgang Merkle (Ann. Pure Appl. Log., 2009)

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

Solovay functions and K-triviality. - Laurent Bienvenu; Wolfgang Merkle; André Nies (STACS, 2011)

Constant Compression and Random Weights. - Wolfgang Merkle; Jason Teutsch (Comput., 2012)

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

Computability in Europe 2009. - Arnold Beckmann; Wolfgang Merkle; Benedikt Löwe (Theory Comput. Syst., 2012)

Selection by Recursively Enumerable Sets. - Wolfgang Merkle; Frank Stephan 001; Jason Teutsch; Wei Wang 150; Yue Yang 004 (TAMC, 2013)

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)

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. - Klaus Ambos-Spies; Decheng Ding; Yun Fan; Wolfgang Merkle (Theory Comput. Syst., 2013)

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

Solovay functions and their applications in algorithmic randomness. - Laurent Bienvenu; Rodney G. Downey; André Nies; Wolfgang Merkle (J. Comput. Syst. Sci., 2015)

Editorial. - Elvira Mayordomo; Wolfgang Merkle (Theory Comput. Syst., 2015)

Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015). - Andrew Lewis-Pye; Wolfgang Merkle (Theory Comput. Syst., 2017)

Being low along a sequence and elsewhere. - Wolfgang Merkle; Liang Yu 004 (J. Symb. Log., 2019)

Speedable Left-c.e. Numbers. - Wolfgang Merkle; Ivan Titov 002 (CSR, 2020)

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)

Searching for shortest and least programs. - Cristian S. Calude; Sanjay Jain 001; Wolfgang Merkle; Frank Stephan 001 (Theor. Comput. Sci., 2020)

Normalized information distance and the oscillation hierarchy. - Klaus Ambos-Spies; Wolfgang Merkle; Sebastiaan A. Terwijn (J. Comput. Syst. Sci., 2022)

Relativized depth. - Laurent Bienvenu; Valentino Delle Rose; Wolfgang Merkle (Theor. Comput. Sci., 2023)

Randomness Versus Superspeedability. - Rupert Hölzl 001; Philip Janicki; Wolfgang Merkle; Frank Stephan 001 (MFCS, 2024)

Extending CL-reducibility on array noncomputable degrees. - Nan Fang; Wolfgang Merkle (Inf. Comput., 2025)