Wolfgang Merkle

	2009
49		Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings Springer 2009
48		Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of Non-monotonic Randomness Notions. CCA 2009
47		Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. MFCS 2009: 392-402
46		Laurent Bienvenu, Wolfgang Merkle: Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Logic 160(3): 238-254 (2009)
45		Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions CoRR abs/0907.2324: (2009)
	2008
44		Rupert Hölzl, Wolfgang Merkle: Generation Complexity Versus Distinction Complexity. TAMC 2008: 457-466
43		Laurent Bienvenu, Wolfgang Merkle, Alexander Shen: A Simple Proof of Miller-Yu Theorem. Fundam. Inform. 83(1-2): 21-24 (2008)
42		Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen: When unlearning helps. Inf. Comput. 206(5): 694-709 (2008)
41		Wolfgang Merkle: The complexity of stochastic sequences. J. Comput. Syst. Sci. 74(3): 350-357 (2008)
	2007
40		Laurent Bienvenu, Wolfgang Merkle: Reconciling Data Compression and Kolmogorov Complexity. ICALP 2007: 643-654
39		Wolfgang Merkle, Frank Stephan: On C-Degrees, H-Degrees and T-Degrees. IEEE Conference on Computational Complexity 2007: 60-69
38		Laurent Bienvenu, Wolfgang Merkle: Effective Randomness for Computable Probability Measures. Electr. Notes Theor. Comput. Sci. 167: 117-130 (2007)
	2006
37		Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi: Kolmogorov Complexity and Applications, 29.01. - 03.02.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
36		Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi: 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications 2006
35		Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan: Kolmogorov Complexity and the Recursion Theorem. STACS 2006: 149-161
34		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)
33		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)
32		Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr dimension. Mathematical Structures in Computer Science 16(5): 789-811 (2006)
31		Wolfgang Merkle, Jan Reimann: Selection Functions that Do Not Preserve Normality. Theory Comput. Syst. 39(5): 685-697 (2006)
30		Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. Theory Comput. Syst. 39(5): 707-721 (2006)
	2005
29		Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr Dimension. CiE 2005: 96-105
28		Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433
	2004
27		Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman: Some Results on Effective Randomness. ICALP 2004: 983-995
26		Wolfgang Merkle, Frank Stephan: Trees and learning. J. Comput. Syst. Sci. 68(1): 134-156 (2004)
	2003
25		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
24		Wolfgang Merkle: The complexity of stochastic sequences. IEEE Conference on Computational Complexity 2003: 230-
23		Wolfgang Merkle, Jan Reimann: On Selection Functions that Do Not Preserve Normality. MFCS 2003: 602-611
22		Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003)
21		Wolfgang Merkle, Frank Stephan: Refuting learning revisited. Theor. Comput. Sci. 1(298): 145-177 (2003)
20		Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost complete sets. Theor. Comput. Sci. 306(1-3): 177-194 (2003)
	2002
19		Wolfgang Merkle: The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. ICALP 2002: 390-400
18		Todd Ebert, Wolfgang Merkle: Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. MFCS 2002: 221-233
17		Wolfgang Merkle, Nenad Mihailovic: On the Construction of Effective Random Sets. MFCS 2002: 568-580
16		Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences Electronic Colloquium on Computational Complexity (ECCC)(056): (2002)
15		Wolfgang Merkle: Lattice Embeddings for Abstract Bounded Reducibilities. SIAM J. Comput. 31(4): 1119-1155 (2002)
	2001
14		Wolfgang Merkle, Frank Stephan: Refuting Learning Revisited. ALT 2001: 299-314
13		Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan: Hausdorff Dimension in Exponential Time. IEEE Conference on Computational Complexity 2001: 210-217
12		Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Math. Log. Q. 47(2): 249-269 (2001)
11		Wolfgang Merkle: The Global Power of Additional Queries to P-Random Oracles. SIAM J. Comput. 31(2): 483-495 (2001)
10		Wolfgang Merkle: Structural properties of bounded relations with an application to NP optimization problems. Theor. Comput. Sci. 250(1-2): 101-124 (2001)
	2000
9		Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan: Unlearning Helps. ICALP 2000: 844-855
8		Wolfgang Merkle: The Global Power of Additional Queries to p-Random Oracles. ICALP 2000: 914-925
7		Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn: Almost Complete Sets. STACS 2000: 419-430
	1999
6		Wolfgang Merkle: The Global Power of Additional Queries to p-random Oracles. Electronic Colloquium on Computational Complexity (ECCC) 6(34): (1999)
5		Wolfgang Merkle: Exact Pairs for Abstract Bounded Reducibilities. Math. Log. Q. 45: 343-360 (1999)
	1997
4		Volker Heun, Wolfgang Merkle, Ulrich Weigand: Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms 1997: 83-160
	1996
3		Wolfgang Merkle, Frank Stephan: Trees and Learning. COLT 1996: 270-279
2		Wolfgang Merkle: Exact Pairs for Abstract Bounded Reducibilities. CSL 1996: 349-368
	1995
1		Wolfgang Merkle, Yongge Wang: Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS 1995: 179-190

Coauthor Index

1	Klaus Ambos-Spies	[7] [13] [20] [49]
2	Ganesh Baliga	[9] [42]
3	Laurent Bienvenu	[38] [40] [43] [45] [46] [48]
4	John Case	[9] [25] [33] [42]
5	Keh-Jiann Chen	[25] [33]
6	Rodney G. Downey (Rod Downey)	[29] [32]
7	Todd Ebert	[16] [18] [22]
8	Volker Heun	[4]
9	Rupert Hölzl	[44] [45] [47] [48]
10	Marcus Hutter	[36] [37]
11	Sanjay Jain	[25] [33]
12	Bjørn Kjos-Hanssen	[35]
13	Thorsten Kräling	[45] [47] [48]
14	Benedikt Löwe	[49]
15	Nenad Mihailovic	[17] [27] [30]
16	Joseph S. Miller	[28] [34]
17	André Nies	[28] [34]
18	Jan Reimann	[7] [13] [20] [23] [28] [29] [31] [32] [34]
19	James S. Royer	[25] [33]
20	Alexander Shen	[43]
21	Theodore A. Slaman	[27] [30]
22	Frank Stephan	[3] [9] [13] [14] [21] [26] [28] [34] [35] [39] [42]
23	Sebastiaan Terwijn	[7] [20]
24	Paul M. B. Vitányi	[36] [37]
25	Heribert Vollmer	[16] [22]
26	Yongge Wang	[1] [12]
27	Ulrich Weigand	[4]
28	Rolf Wiehagen	[42]

Colors in the list of coauthors