Wolfgang Merkle

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): 171-178 (2013)

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): 2-27 (2013)

Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. Theory Comput. Syst. 52(1): 80-94 (2013)

Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang: Selection by Recursively Enumerable Sets. TAMC 2013: 144-155

Wolfgang Merkle, Jason Teutsch: Constant Compression and Random Weights. Computability 1(2): 153-169 (2012)

Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions. J. Log. Comput. 22(4): 701-715 (2012)

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

Wolfgang Merkle, Jason Teutsch: Constant compression and random weights. STACS 2012: 172-181

Laurent Bienvenu, Wolfgang Merkle, André Nies: Solovay functions and K-triviality. STACS 2011: 452-463

Rupert Hölzl, Wolfgang Merkle: Traceable Sets. IFIP TCS 2010: 301-315

Laurent Bienvenu, Wolfgang Merkle: Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Logic 160(3): 238-254 (2009)

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

Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. MFCS 2009: 392-402

Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle (Eds.): Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings. Lecture Notes in Computer Science 5635, Springer 2009, isbn 978-3-642-03072-7

Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions. CoRR abs/0907.2324 (2009)

Laurent Bienvenu, Wolfgang Merkle, Alexander Shen: A Simple Proof of Miller-Yu Theorem. Fundam. Inform. 83(1-2): 21-24 (2008)

Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen: When unlearning helps. Inf. Comput. 206(5): 694-709 (2008)

Wolfgang Merkle: The complexity of stochastic sequences. J. Comput. Syst. Sci. 74(3): 350-357 (2008)

Rupert Hölzl, Wolfgang Merkle: Generation Complexity Versus Distinction Complexity. TAMC 2008: 457-466

Laurent Bienvenu, Wolfgang Merkle: Effective Randomness for Computable Probability Measures. Electr. Notes Theor. Comput. Sci. 167: 117-130 (2007)

Wolfgang Merkle, Frank Stephan: On C-Degrees, H-Degrees and T-Degrees. IEEE Conference on Computational Complexity 2007: 60-69

Laurent Bienvenu, Wolfgang Merkle: Reconciling Data Compression and Kolmogorov Complexity. ICALP 2007: 643-654

Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Logic 138(1-3): 183-210 (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. Logic 139(1-3): 303-326 (2006)

Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr dimension. Mathematical Structures in Computer Science 16(5): 789-811 (2006)

Wolfgang Merkle, Jan Reimann: Selection Functions that Do Not Preserve Normality. Theory Comput. Syst. 39(5): 685-697 (2006)

Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. Theory Comput. Syst. 39(5): 707-721 (2006)

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

Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan: Kolmogorov Complexity and the Recursion Theorem. STACS 2006: 149-161

Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi (Eds.): Kolmogorov Complexity and Applications, 29.01. - 03.02.2006. Dagstuhl Seminar Proceedings 06051, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006

Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr Dimension. CiE 2005: 96-105

Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433

Wolfgang Merkle, Frank Stephan: Trees and learning. J. Comput. Syst. Sci. 68(1): 134-156 (2004)

Wolfgang Merkle, Nenad Mihailovic: On the construction of effectively random sets. J. Symb. Log. 69(3): 862-878 (2004)

Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. ICALP 2004: 983-995

Wolfgang Merkle: The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences. J. Symb. Log. 68(4): 1362-1376 (2003)

Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003)

Wolfgang Merkle, Frank Stephan: Refuting learning revisited. Theor. Comput. Sci. 1(298): 145-177 (2003)

Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost complete sets. Theor. Comput. Sci. 306(1-3): 177-194 (2003)

Wolfgang Merkle: The complexity of stochastic sequences. IEEE Conference on Computational Complexity 2003: 230-

John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer: Generality's Price: Inescapable Deficiencies in Machine-Learned Programs. COLT 2003: 684-698

Wolfgang Merkle, Jan Reimann: On Selection Functions that Do Not Preserve Normality. MFCS 2003: 602-611

Wolfgang Merkle: Lattice Embeddings for Abstract Bounded Reducibilities. SIAM J. Comput. 31(4): 1119-1155 (2002)

Wolfgang Merkle: The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. ICALP 2002: 390-400

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

Wolfgang Merkle, Nenad Mihailovic: On the Construction of Effective Random Sets. MFCS 2002: 568-580

Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. Electronic Colloquium on Computational Complexity (ECCC)(056) (2002)

Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Math. Log. Q. 47(2): 249-269 (2001)

Wolfgang Merkle: The Global Power of Additional Queries to P-Random Oracles. SIAM J. Comput. 31(2): 483-495 (2001)

Wolfgang Merkle: Structural properties of bounded relations with an application to NP optimization problems. Theor. Comput. Sci. 250(1-2): 101-124 (2001)

Wolfgang Merkle, Frank Stephan: Refuting Learning Revisited. ALT 2001: 299-314

Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan: Hausdorff Dimension in Exponential Time. IEEE Conference on Computational Complexity 2001: 210-217

Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan: Unlearning Helps. ICALP 2000: 844-855

Wolfgang Merkle: The Global Power of Additional Queries to p-Random Oracles. ICALP 2000: 914-925

Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost Complete Sets. STACS 2000: 419-430

Wolfgang Merkle: Exact Pairs for Abstract Bounded Reducibilities. Math. Log. Q. 45: 343-360 (1999)

Wolfgang Merkle: The Global Power of Additional Queries to p-random Oracles. Electronic Colloquium on Computational Complexity (ECCC) 6(34) (1999)

Volker Heun, Wolfgang Merkle, Ulrich Weigand: Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms 1997: 83-160

Wolfgang Merkle, Frank Stephan: Trees and Learning. COLT 1996: 270-279

Wolfgang Merkle: Exact Pairs for Abstract Bounded Reducibilities. CSL 1996: 349-368

Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS 1995: 179-190