default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWolfgang Merkle
Person information
- affiliation: Heidelberg University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j35]Nan Fang
, Wolfgang Merkle:
Extending CL-reducibility on array noncomputable degrees. Inf. Comput. 303: 105258 (2025)- 2024
- [c31]Rupert Hölzl, Philip Janicki, Wolfgang Merkle, Frank Stephan:
Randomness Versus Superspeedability. MFCS 2024: 62:1-62:14 - 2023
- [j34]Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle:
Relativized depth. Theor. Comput. Sci. 949: 113694 (2023) - 2022
- [j33]Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn:
Normalized information distance and the oscillation hierarchy. J. Comput. Syst. Sci. 124: 65-76 (2022) - 2020
- [j32]Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu:
Chaitin's ω as a continuous function. J. Symb. Log. 85(1): 486-510 (2020) - [j31]Cristian S. Calude, Sanjay Jain, Wolfgang Merkle, Frank Stephan:
Searching for shortest and least programs. Theor. Comput. Sci. 807: 114-127 (2020) - [c30]Wolfgang Merkle, Ivan Titov:
Speedable Left-c.e. Numbers. CSR 2020: 303-313
2010 – 2019
- 2019
- [j30]Wolfgang Merkle, Liang Yu:
Being low along a sequence and elsewhere. J. Symb. Log. 84(2): 497-516 (2019) - 2017
- [j29]Andrew Lewis-Pye, Wolfgang Merkle:
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015). Theory Comput. Syst. 61(4): 1252-1253 (2017) - [i5]Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn:
Normalized Information Distance and the Oscillation Hierarchy. CoRR abs/1708.03583 (2017) - 2015
- [j28]Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle:
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81(8): 1575-1591 (2015) - [j27]Elvira Mayordomo, Wolfgang Merkle:
Editorial. Theory Comput. Syst. 56(3): 437-438 (2015) - 2013
- [j26]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) - [j25]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) - [j24]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
- [j23]Wolfgang Merkle, Jason Teutsch:
Constant Compression and Random Weights. Comput. 1(2): 153-169 (2012) - [j22]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. J. Log. Comput. 22(4): 701-715 (2012) - [j21]Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe:
Computability in Europe 2009. Theory Comput. Syst. 51(1): 1-3 (2012) - [c28]Wolfgang Merkle, Jason Teutsch:
Constant compression and random weights. STACS 2012: 172-181 - 2011
- [c27]Laurent Bienvenu, Wolfgang Merkle, André Nies:
Solovay functions and K-triviality. STACS 2011: 452-463 - 2010
- [c26]Rupert Hölzl, Wolfgang Merkle:
Traceable Sets. IFIP TCS 2010: 301-315
2000 – 2009
- 2009
- [j20]Laurent Bienvenu, Wolfgang Merkle:
Constructive equivalence relations on computable probability measures. Ann. Pure Appl. Log. 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:
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 [contents] - [i4]Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. CoRR abs/0907.2324 (2009) - 2008
- [j19]Laurent Bienvenu, Wolfgang Merkle, Alexander Shen:
A Simple Proof of Miller-Yu Theorem. Fundam. Informaticae 83(1-2): 21-24 (2008) - [j18]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen:
When unlearning helps. Inf. Comput. 206(5): 694-709 (2008) - [j17]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
- [c22]Wolfgang Merkle, Frank Stephan:
On C-Degrees, H-Degrees and T-Degrees. CCC 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. Log. 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. Log. 139(1-3): 303-326 (2006) - [j14]Rodney G. Downey, Wolfgang Merkle, Jan Reimann:
Schnorr dimension. Math. Struct. Comput. Sci. 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]Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan:
Kolmogorov Complexity and the Recursion Theorem. STACS 2006: 149-161 - [c19]Laurent Bienvenu, Wolfgang Merkle:
Effective Randomness for Computable Probability Measures. CCA 2006: 117-130 - [e1]Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi:
Kolmogorov Complexity and Applications, 29.01. - 03.02.2006. Dagstuhl Seminar Proceedings 06051, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i3]Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi:
06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Kolmogorov Complexity and Applications 2006 - 2005
- [c18]Rodney G. Downey, Wolfgang Merkle, Jan Reimann:
Schnorr Dimension. CiE 2005: 96-105 - [c17]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan:
Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433 - 2004
- [j11]Wolfgang Merkle, Frank Stephan:
Trees and learning. J. Comput. Syst. Sci. 68(1): 134-156 (2004) - [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. 298(1): 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. CCC 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]Wolfgang Merkle, Nenad Mihailovic:
On the Construction of Effective Random Sets. MFCS 2002: 568-580 - [i2]Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. Electron. Colloquium Comput. Complex. TR02 (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]Wolfgang Merkle, Frank Stephan:
Refuting Learning Revisited. ALT 2001: 299-314 - [c8]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan:
Hausdorff Dimension in Exponential Time. CCC 2001: 210-217 - 2000
- [c7]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan:
Unlearning Helps. ICALP 2000: 844-855 - [c6]Wolfgang Merkle:
The Global Power of Additional Queries to p-Random Oracles. ICALP 2000: 914-925 - [c5]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn:
Almost Complete Sets. STACS 2000: 419-430
1990 – 1999
- 1999
- [j1]Wolfgang Merkle:
Exact Pairs for Abstract Bounded Reducibilities. Math. Log. Q. 45: 343-360 (1999) - [i1]Wolfgang Merkle:
The Global Power of Additional Queries to p-random Oracles. Electron. Colloquium Comput. Complex. TR99 (1999) - 1997
- [b1]Wolfgang Merkle:
A generalized account of resource bounded reducibilities. Heidelberg University, 1997, pp. 1-144 - [c4]Volker Heun, Wolfgang Merkle, Ulrich Weigand:
Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms 1997: 83-160 - 1996
- [c3]Wolfgang Merkle, Frank Stephan:
Trees and Learning. COLT 1996: 270-279 - [c2]Wolfgang Merkle:
Exact Pairs for Abstract Bounded Reducibilities. CSL 1996: 349-368 - 1995
- [c1]Wolfgang Merkle, Yongge Wang:
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. MFCS 1995: 179-190
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
