- Separations of non-monotonic randomness (Preliminary version, 7 July 2009)
- KolmogorovLoveland Randomness and Stochasticity
- Some results on e ective randomness (Preliminary version September 2003)
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Habilitationsschrift eingereicht bei der
- Reconciling data compression and Kolmogorov complexity
- LATTICE EMBEDDINGS FOR ABSTRACT BOUNDED REDUCIBILITIES
- Generation Complexity Versus Distinction Rupert Holzl and Wolfgang Merkle
- Structural Properties of Bounded Relations with an Application to NP Optimization Problems
- Randomized Algorithms A short course on randomized algorithms and the probabilistic method
- Generality's Price: Inescapable De ciencies in Machine-Learned Programs
- Inaugural Dissertation Erlangung der Doktorwurde
- Collapsing PolynomialTime Degrees Klaus AmbosSpies 1 , Levke Bentzien 1 , Peter A. Fejer 2 , Wolfgang Merkle 1 , and
- Kolmogorov-Loveland Randomness and Stochasticity
- Exact Pairs for Abstract Bounded Reducibilities Wolfgang Merkle
- 5. Proving the PCPTheorem Volker Heun, Wolfgang Merkle, Ulrich Weigand
- LATTICE EMBEDDINGS FOR ABSTRACT BOUNDED REDUCIBILITIES #
- ON THE AUTOREDUCIBILITY OF RANDOM SEQUENCES # TODD EBERT + , WOLFGANG MERKLE # , AND HERIBERT VOLLMER
- Almost Complete Sets Klaus AmbosSpies 1 , Wolfgang Merkle 1 , Jan Reimann 1 and
- Randomized Algorithms A short course on randomized algorithms and the probabilistic method
- Refuting Learning Revisited Wolfgang Merkle \Lambda and Frank Stephan \Lambda
- Lattice Embeddings for Abstract Bounded Reducibilities
- SCHNORR DIMENSION RODNEY DOWNEY, WOLFGANG MERKLE, AND JAN REIMANN
- Separations by Random Oracles and ``Almost'' Classes for Generalized Reducibilities
- Kolmogorov Complexity and the Recursion Theorem
- Constructive equivalence relations on computable probability measures
- The complexity of stochastic sequences Wolfgang Merkle
- Fundamenta Informaticae XXI (2007) 13 1 A simple proof of MillerYu theorem
- THE GLOBAL POWER OF ADDITIONAL QUERIES TO P -RANDOM ORACLES
- Generality's Price: Inescapable Deficiencies in Machine-Learned Programs
- Hausdorff Dimension in Exponential Time Klaus AmbosSpies Wolfgang Merkle Jan Reimann Frank Stephan
- On the Construction of E ective Random Sets Wolfgang Merkle and Nenad Mihailovi c
- ON THE AUTOREDUCIBILITY OF RANDOM SEQUENCES TODD EBERT, WOLFGANG MERKLE, AND HERIBERT VOLLMER
- The global power of additional queries to prandom oracles
- On Selection Functions that Do Not Preserve Wolfgang Merkle Jan Reimann
- Time-Bounded Kolmogorov Complexity and Solovay Functions
- THE GLOBAL POWER OF ADDITIONAL QUERIES TO PRANDOM ORACLES #
- Habilitationsschrift eingereicht bei der
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 68 (2004) 134156
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
