Wolfgang Merkle

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 11

Top Venues

J. Comput. Syst. Sci.

Theory Comput. Syst.

J. Symb. Log.

Theor. Comput. Sci.

Heidelberg University (PHD)

Education History

Heidelberg University

PHD

Publications

Rupert Hölzl, Philip Janicki, Wolfgang Merkle, Frank Stephan
Randomness Versus Superspeedability. MFCS (2024)
Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle
Relativized depth. Theor. Comput. Sci. 949 (2023)
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn
Normalized information distance and the oscillation hierarchy. J. Comput. Syst. Sci. 124 (2022)
Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu
Chaitin's ω as a continuous function. J. Symb. Log. 85 (1) (2020)
Wolfgang Merkle, Ivan Titov
Speedable Left-c.e. Numbers. CSR (2020)
Cristian S. Calude, Sanjay Jain, Wolfgang Merkle, Frank Stephan
Searching for shortest and least programs. Theor. Comput. Sci. 807 (2020)
Wolfgang Merkle, Liang Yu
Being low along a sequence and elsewhere. J. Symb. Log. 84 (2) (2019)
Andrew Lewis-Pye, Wolfgang Merkle
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015). Theory Comput. Syst. 61 (4) (2017)
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn
Normalized Information Distance and the Oscillation Hierarchy. CoRR (2017)
Elvira Mayordomo, Wolfgang Merkle
Editorial. Theory Comput. Syst. 56 (3) (2015)
Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81 (8) (2015)
Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees. Theory Comput. Syst. 52 (1) (2013)
George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle
Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113 (5-6) (2013)
Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang
Selection by Recursively Enumerable Sets. TAMC (2013)
Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Time-Bounded Kolmogorov Complexity and Solovay Functions. Theory Comput. Syst. 52 (1) (2013)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Separations of non-monotonic randomness notions. J. Log. Comput. 22 (4) (2012)
Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe
Computability in Europe 2009. Theory Comput. Syst. 51 (1) (2012)
Wolfgang Merkle, Jason Teutsch
Constant compression and random weights. STACS (2012)
Wolfgang Merkle, Jason Teutsch
Constant Compression and Random Weights. Comput. 1 (2) (2012)
Laurent Bienvenu, Wolfgang Merkle, André Nies
Solovay functions and K-triviality. STACS (2011)
Rupert Hölzl, Wolfgang Merkle
Traceable Sets. IFIP TCS (2010)
Laurent Bienvenu, Wolfgang Merkle
Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Log. 160 (3) (2009)
Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Time-Bounded Kolmogorov Complexity and Solovay Functions. MFCS (2009)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Separations of Non-monotonic Randomness Notions. CCA (2009)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Separations of non-monotonic randomness notions CoRR (2009)
Laurent Bienvenu, Wolfgang Merkle, Alexander Shen
A Simple Proof of Miller-Yu Theorem. Fundam. Informaticae 83 (1-2) (2008)
Rupert Hölzl, Wolfgang Merkle
Generation Complexity Versus Distinction Complexity. TAMC (2008)
Wolfgang Merkle
The complexity of stochastic sequences. J. Comput. Syst. Sci. 74 (3) (2008)
Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen
When unlearning helps. Inf. Comput. 206 (5) (2008)
Wolfgang Merkle, Frank Stephan
On C-Degrees, H-Degrees and T-Degrees. Computational Complexity Conference (2007)
Laurent Bienvenu, Wolfgang Merkle
Effective Randomness for Computable Probability Measures. Electron. Notes Theor. Comput. Sci. 167 (2007)
Laurent Bienvenu, Wolfgang Merkle
Reconciling Data Compression and Kolmogorov Complexity. ICALP (2007)
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
Some Results on Effective Randomness. Theory Comput. Syst. 39 (5) (2006)
Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
Kolmogorov Complexity and the Recursion Theorem. STACS (2006)
Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi
06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications (2006)
Wolfgang Merkle, Jan Reimann
Selection Functions that Do Not Preserve Normality. Theory Comput. Syst. 39 (5) (2006)
John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer
Generality's price: Inescapable deficiencies in machine-learned programs. Ann. Pure Appl. Log. 139 (1-3) (2006)
Rodney G. Downey, Wolfgang Merkle, Jan Reimann
Schnorr dimension. Math. Struct. Comput. Sci. 16 (5) (2006)
Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Log. 138 (1-3) (2006)
Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
Kolmogorov-Loveland Randomness and Stochasticity. STACS (2005)
Rodney G. Downey, Wolfgang Merkle, Jan Reimann
Schnorr Dimension. CiE (2005)
Wolfgang Merkle, Nenad Mihailovic
On the construction of effectively random sets. J. Symb. Log. 69 (3) (2004)
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman
Some Results on Effective Randomness. ICALP (2004)
Wolfgang Merkle, Frank Stephan
Trees and learning. J. Comput. Syst. Sci. 68 (1) (2004)
Wolfgang Merkle, Jan Reimann
On Selection Functions that Do Not Preserve Normality. MFCS (2003)
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
Almost complete sets. Theor. Comput. Sci. 306 (1-3) (2003)
John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer
Generality's Price: Inescapable Deficiencies in Machine-Learned Programs. COLT (2003)
Wolfgang Merkle, Frank Stephan
Refuting learning revisited. Theor. Comput. Sci. 298 (1) (2003)
Wolfgang Merkle
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences. J. Symb. Log. 68 (4) (2003)
Wolfgang Merkle
The complexity of stochastic sequences. Computational Complexity Conference (2003)
Todd Ebert, Wolfgang Merkle, Heribert Vollmer
On the Autoreducibility of Random Sequences. SIAM J. Comput. 32 (6) (2003)
Wolfgang Merkle
Lattice Embeddings for Abstract Bounded Reducibilities. SIAM J. Comput. 31 (4) (2002)
Wolfgang Merkle
The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. ICALP (2002)
Todd Ebert, Wolfgang Merkle, Heribert Vollmer
On the Autoreducibility of Random Sequences Electron. Colloquium Comput. Complex. (056) (2002)
Wolfgang Merkle, Nenad Mihailovic
On the Construction of Effective Random Sets. MFCS (2002)
Todd Ebert, Wolfgang Merkle
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. MFCS (2002)
Wolfgang Merkle, Yongge Wang
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Math. Log. Q. 47 (2) (2001)
Wolfgang Merkle
Structural properties of bounded relations with an application to NP optimization problems. Theor. Comput. Sci. 250 (1-2) (2001)
Wolfgang Merkle
The Global Power of Additional Queries to P-Random Oracles. SIAM J. Comput. 31 (2) (2001)
Wolfgang Merkle, Frank Stephan
Refuting Learning Revisited. ALT (2001)
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan
Hausdorff Dimension in Exponential Time. Computational Complexity Conference (2001)
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
Almost Complete Sets. STACS (2000)
Wolfgang Merkle
The Global Power of Additional Queries to p-Random Oracles. ICALP (2000)
Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan
Unlearning Helps. ICALP (2000)
Wolfgang Merkle
Exact Pairs for Abstract Bounded Reducibilities. Math. Log. Q. 45 (1999)
Wolfgang Merkle
The Global Power of Additional Queries to p-random Oracles. Electron. Colloquium Comput. Complex. 6 (34) (1999)
Volker Heun, Wolfgang Merkle, Ulrich Weigand
Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms (1997)
Wolfgang Merkle
Exact Pairs for Abstract Bounded Reducibilities. CSL (1996)
Wolfgang Merkle, Frank Stephan
Trees and Learning. COLT (1996)
Wolfgang Merkle, Yongge Wang
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS (1995)

Wolfgang Merkle.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Wolfgang Merkle