Wolfgang Merkle
Wolfgang Merkle
Senior Lecturer, Heidelberg University
Verified email at math.uni-heidelberg.de
Title
Cited by
Cited by
Year
Kolmogorov complexity and the recursion theorem
B Kjos-Hanssen, W Merkle, F Stephan
Transactions of the American Mathematical Society 363 (10), 5465-5480, 2011
135*2011
Kolmogorov–Loveland randomness and stochasticity
W Merkle, JS Miller, A Nies, J Reimann, F Stephan
Annals of Pure and Applied Logic 138 (1-3), 183-210, 2006
662006
When unlearning helps
G Baliga, J Case, W Merkle, F Stephan, R Wiehagen
Information and Computation 206 (5), 694-709, 2008
54*2008
Hausdorff dimension in exponential time
K Ambos-Spies, W Merkle, J Reimann, F Stephan
Proceedings 16th Annual IEEE Conference on Computational Complexity, 210-217, 2001
502001
On the autoreducibility of random sequences
T Ebert, W Merkle, H Vollmer
SIAM Journal on Computing 32 (6), 1542-1569, 2003
45*2003
On the construction of effectively random sets
W Merkle, N Mihailović
Journal of Symbolic Logic 69 (3), 862-878, 2004
442004
Constructive equivalence relations on computable probability measures
L Bienvenu, W Merkle
Annals of Pure and Applied Logic 160 (3), 238-254, 2009
37*2009
The complexity of stochastic sequences
W Merkle
Journal of Computer and System Sciences 74 (3), 350-357, 2008
362008
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
W Merkle
Journal of Symbolic Logic 68 (4), 1362-1376, 2003
362003
Reconciling data compression and Kolmogorov complexity
L Bienvenu, W Merkle
International Colloquium on Automata, Languages, and Programming, 643-654, 2007
322007
Time-bounded Kolmogorov complexity and Solovay functions
R Hölzl, T Kräling, W Merkle
International Symposium on Mathematical Foundations of Computer Science, 392-402, 2009
30*2009
Selection functions that do not preserve normality
W Merkle, J Reimann
Theory of computing systems 39 (5), 685-697, 2006
262006
Some results on effective randomness
W Merkle, N Mihailovic, TA Slaman
Theory of Computing Systems 39 (5), 707-721, 2006
262006
Solovay functions and their applications in algorithmic randomness
L Bienvenu, R Downey, A Nies, W Merkle
Journal of Computer and System Sciences 81 (8), 1575-1591, 2015
20*2015
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
K Ambos-Spies, D Ding, Y Fan, W Merkle
Theory of Computing Systems 52 (1), 2-27, 2013
182013
Refuting learning revisited
W Merkle, F Stephan
Theoretical computer science 298 (1), 145-177, 2003
142003
A simple proof of Miller-Yu theorem
L Bienvenu, W Merkle, A Shen
Fundamenta Informaticae 83 (1-2), 21-24, 2008
132008
Schnorr dimension
R Downey, W Merkle, J Reimann
Mathematical Structures in Computer Science 16 (5), 789-811, 2006
132006
Separations by random oracles and “almost” classes for generalized reducibilities
W Merkle, Y Wang
Mathematical Logic Quarterly 47 (2), 249-269, 2001
13*2001
On C-degrees, H-degrees and T-degrees
W Merkle, F Stephan
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 60-69, 2007
122007
The system can't perform the operation now. Try again later.
Articles 1–20