Search the dblp DataBase
Wolfgang Merkle :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Wolfgang Merkle , Frank Stephan Refuting Learning Revisited. [Citation Graph (0, 0)][DBLP ] ALT, 2001, pp:299-314 [Conf ] Rodney G. Downey , Wolfgang Merkle , Jan Reimann Schnorr Dimension. [Citation Graph (0, 0)][DBLP ] CiE, 2005, pp:96-105 [Conf ] Klaus Ambos-Spies , Wolfgang Merkle , Jan Reimann , Frank Stephan Hausdorff Dimension in Exponential Time. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:210-217 [Conf ] Wolfgang Merkle The complexity of stochastic sequences. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2003, pp:230-0 [Conf ] John Case , Keh-Jiann Chen , Sanjay Jain , Wolfgang Merkle , James S. Royer Generality's Price: Inescapable Deficiencies in Machine-Learned Programs. [Citation Graph (0, 0)][DBLP ] COLT, 2003, pp:684-698 [Conf ] Wolfgang Merkle , Frank Stephan Trees and Learning. [Citation Graph (0, 0)][DBLP ] COLT, 1996, pp:270-279 [Conf ] Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. [Citation Graph (0, 0)][DBLP ] CSL, 1996, pp:349-368 [Conf ] Volker Heun , Wolfgang Merkle , Ulrich Weigand Proving the PCP-Theorem. [Citation Graph (0, 0)][DBLP ] Lectures on Proof Verification and Approximation Algorithms, 1997, pp:83-160 [Conf ] Ganesh Baliga , John Case , Wolfgang Merkle , Frank Stephan Unlearning Helps. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:844-855 [Conf ] Wolfgang Merkle The Global Power of Additional Queries to p-Random Oracles. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:914-925 [Conf ] Wolfgang Merkle The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:390-400 [Conf ] Wolfgang Merkle , Nenad Mihailovic , Theodore A. Slaman Some Results on Effective Randomness. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:983-995 [Conf ] Todd Ebert , Wolfgang Merkle Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:221-233 [Conf ] Wolfgang Merkle , Nenad Mihailovic On the Construction of Effective Random Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:568-580 [Conf ] Wolfgang Merkle , Jan Reimann On Selection Functions that Do Not Preserve Normality. [Citation Graph (0, 0)][DBLP ] MFCS, 2003, pp:602-611 [Conf ] Wolfgang Merkle , Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. [Citation Graph (0, 0)][DBLP ] MFCS, 1995, pp:179-190 [Conf ] Klaus Ambos-Spies , Wolfgang Merkle , Jan Reimann , Sebastiaan Terwijn Almost Complete Sets. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:419-430 [Conf ] Bjørn Kjos-Hanssen , Wolfgang Merkle , Frank Stephan Kolmogorov Complexity and the Recursion Theorem. [Citation Graph (0, 0)][DBLP ] STACS, 2006, pp:149-161 [Conf ] Wolfgang Merkle , Joseph S. Miller , André Nies , Jan Reimann , Frank Stephan Kolmogorov-Loveland Randomness and Stochasticity. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:422-433 [Conf ] Wolfgang Merkle , Joseph S. Miller , André Nies , Jan Reimann , Frank Stephan Kolmogorov-Loveland randomness and stochasticity. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:183-210 [Journal ] John Case , Keh-Jiann Chen , Sanjay Jain , Wolfgang Merkle , James S. Royer Generality's price: Inescapable deficiencies in machine-learned programs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:303-326 [Journal ] Todd Ebert , Wolfgang Merkle , Heribert Vollmer On the Autoreducibility of Random Sequences [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:056, pp:- [Journal ] Wolfgang Merkle The Global Power of Additional Queries to p-random Oracles. [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:34, pp:- [Journal ] Laurent Bienvenu , Wolfgang Merkle Effective Randomness for Computable Probability Measures. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:167, n:, pp:117-130 [Journal ] Wolfgang Merkle , Frank Stephan Trees and learning. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2004, v:68, n:1, pp:134-156 [Journal ] Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 1999, v:45, n:, pp:343-360 [Journal ] Wolfgang Merkle , Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 2001, v:47, n:2, pp:249-269 [Journal ] Todd Ebert , Wolfgang Merkle , Heribert Vollmer On the Autoreducibility of Random Sequences. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:6, pp:1542-1569 [Journal ] Wolfgang Merkle The Global Power of Additional Queries to P-Random Oracles. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:2, pp:483-495 [Journal ] Wolfgang Merkle Lattice Embeddings for Abstract Bounded Reducibilities. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2002, v:31, n:4, pp:1119-1155 [Journal ] Klaus Ambos-Spies , Wolfgang Merkle , Jan Reimann , Sebastiaan Terwijn Almost complete sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:306, n:1-3, pp:177-194 [Journal ] Wolfgang Merkle Structural properties of bounded relations with an application to NP optimization problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:250, n:1-2, pp:101-124 [Journal ] Wolfgang Merkle , Frank Stephan Refuting learning revisited. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:298, pp:145-177 [Journal ] Wolfgang Merkle , Frank Stephan On C-Degrees, H-Degrees and T-Degrees. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2007, pp:60-69 [Conf ] Laurent Bienvenu , Wolfgang Merkle Reconciling Data Compression and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP ] ICALP, 2007, pp:643-654 [Conf ] Wolfgang Merkle , Jan Reimann Selection Functions that Do Not Preserve Normality. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2006, v:39, n:5, pp:685-697 [Journal ] Wolfgang Merkle , Nenad Mihailovic , Theodore A. Slaman Some Results on Effective Randomness. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2006, v:39, n:5, pp:707-721 [Journal ] Separations of Non-monotonic Randomness Notions. [Citation Graph (, )][DBLP ] 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. [Citation Graph (, )][DBLP ] Time-Bounded Kolmogorov Complexity and Solovay Functions. [Citation Graph (, )][DBLP ] Generation Complexity Versus Distinction Complexity. [Citation Graph (, )][DBLP ] Constructive equivalence relations on computable probability measures. [Citation Graph (, )][DBLP ] Separations of non-monotonic randomness notions [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.007secs