Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Wolfgang Merkle
2010 – today
- 2013
[j27]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)- [j26]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)
- [j25]Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. Theory Comput. Syst. 52(1): 80-94 (2013)
- [c29]Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang: Selection by Recursively Enumerable Sets. TAMC 2013: 144-155
- 2012
- [j24]Wolfgang Merkle, Jason Teutsch: Constant Compression and Random Weights. Computability 1(2): 153-169 (2012)
- [j23]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions. J. Log. Comput. 22(4): 701-715 (2012)
- [j22]Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe: Computability in Europe 2009. Theory Comput. Syst. 51(1): 1-3 (2012)
- [c28]
- 2011
- [c27]Laurent Bienvenu, Wolfgang Merkle, André Nies: Solovay functions and K-triviality. STACS 2011: 452-463
- 2010
- [c26]
2000 – 2009
- 2009
- [j21]Laurent Bienvenu, Wolfgang Merkle: Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Logic 160(3): 238-254 (2009)
- [c25]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of Non-monotonic Randomness Notions. CCA 2009
- [c24]Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. MFCS 2009: 392-402
- [e2]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
- [i3]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions. CoRR abs/0907.2324 (2009)
- 2008
- [j20]Laurent Bienvenu, Wolfgang Merkle, Alexander Shen: A Simple Proof of Miller-Yu Theorem. Fundam. Inform. 83(1-2): 21-24 (2008)
- [j19]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen: When unlearning helps. Inf. Comput. 206(5): 694-709 (2008)
- [j18]Wolfgang Merkle: The complexity of stochastic sequences. J. Comput. Syst. Sci. 74(3): 350-357 (2008)
- [c23]Rupert Hölzl, Wolfgang Merkle: Generation Complexity Versus Distinction Complexity. TAMC 2008: 457-466
- 2007
- [j17]Laurent Bienvenu, Wolfgang Merkle: Effective Randomness for Computable Probability Measures. Electr. Notes Theor. Comput. Sci. 167: 117-130 (2007)
- [c22]Wolfgang Merkle, Frank Stephan: On C-Degrees, H-Degrees and T-Degrees. IEEE Conference on Computational Complexity 2007: 60-69
- [c21]Laurent Bienvenu, Wolfgang Merkle: Reconciling Data Compression and Kolmogorov Complexity. ICALP 2007: 643-654
- 2006
- [j16]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)
- [j15]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)
- [j14]Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr dimension. Mathematical Structures in Computer Science 16(5): 789-811 (2006)
- [j13]Wolfgang Merkle, Jan Reimann: Selection Functions that Do Not Preserve Normality. Theory Comput. Syst. 39(5): 685-697 (2006)
- [j12]Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. Theory Comput. Syst. 39(5): 707-721 (2006)
- [c20]Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi: 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications 2006
- [c19]Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan: Kolmogorov Complexity and the Recursion Theorem. STACS 2006: 149-161
- [e1]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
- 2005
- [c18]
- [c17]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433
- 2004
- [j11]
- [j10]Wolfgang Merkle, Nenad Mihailovic: On the construction of effectively random sets. J. Symb. Log. 69(3): 862-878 (2004)
- [c16]Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. ICALP 2004: 983-995
- 2003
- [j9]Wolfgang Merkle: The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences. J. Symb. Log. 68(4): 1362-1376 (2003)
- [j8]Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003)
- [j7]Wolfgang Merkle, Frank Stephan: Refuting learning revisited. Theor. Comput. Sci. 1(298): 145-177 (2003)
- [j6]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost complete sets. Theor. Comput. Sci. 306(1-3): 177-194 (2003)
- [c15]Wolfgang Merkle: The complexity of stochastic sequences. IEEE Conference on Computational Complexity 2003: 230-
- [c14]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
- [c13]Wolfgang Merkle, Jan Reimann: On Selection Functions that Do Not Preserve Normality. MFCS 2003: 602-611
- 2002
- [j5]Wolfgang Merkle: Lattice Embeddings for Abstract Bounded Reducibilities. SIAM J. Comput. 31(4): 1119-1155 (2002)
- [c12]Wolfgang Merkle: The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. ICALP 2002: 390-400
- [c11]Todd Ebert, Wolfgang Merkle: Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. MFCS 2002: 221-233
- [c10]
- [i2]Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. Electronic Colloquium on Computational Complexity (ECCC)(056) (2002)
- 2001
- [j4]Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Math. Log. Q. 47(2): 249-269 (2001)
- [j3]Wolfgang Merkle: The Global Power of Additional Queries to P-Random Oracles. SIAM J. Comput. 31(2): 483-495 (2001)
- [j2]Wolfgang Merkle: Structural properties of bounded relations with an application to NP optimization problems. Theor. Comput. Sci. 250(1-2): 101-124 (2001)
- [c9]
- [c8]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan: Hausdorff Dimension in Exponential Time. IEEE Conference on Computational Complexity 2001: 210-217
- 2000
- [c7]
- [c6]
- [c5]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost Complete Sets. STACS 2000: 419-430
1990 – 1999
- 1999
- [j1]
- [i1]Wolfgang Merkle: The Global Power of Additional Queries to p-random Oracles. Electronic Colloquium on Computational Complexity (ECCC) 6(34) (1999)
- 1997
- [c4]Volker Heun, Wolfgang Merkle, Ulrich Weigand: Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms 1997: 83-160
- 1996
- [c3]
- [c2]
- 1995
- [c1]Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS 1995: 179-190
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:55 CEST by the dblp team