Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Wolfgang Merkle" ( http://dblp.L3S.de/Authors/Wolfgang_Merkle )

  Author page on DBLP  Author page in RDF  Community of Wolfgang Merkle in ASPL-2

Publication years (Num. hits)
1995-2002 (19) 2003-2006 (20) 2007-2012 (16)
Publication types (Num. hits)
article(25) inproceedings(28) proceedings(2)
Venues (Conferences, Journals, ...)
ICALP(5) MFCS(5) STACS(5) Ann. Pure Appl. Logic(3) IEEE Conference on Computation...(3) SIAM J. Comput.(3) Theor. Comput. Sci.(3) Theory Comput. Syst.(3) CiE(2) COLT(2) Electronic Colloquium on Compu...(2) J. Comput. Syst. Sci.(2) J. Symb. Log.(2) Kolmogorov Complexity and Appl...(2) Math. Log. Q.(2) ALT(1) More (+10 of total 26)
Authors
Wolfgang Merkle(55) Frank Stephan(11) Jan Reimann(9) Laurent Bienvenu(7) Rupert Hölzl(5) John Case(4) Klaus Ambos-Spies(4) Nenad Mihailovic(4) André Nies(3) Thorsten Kräling(3) Todd Ebert(3) Benedikt Löwe(2) Ganesh Baliga(2) Heribert Vollmer(2) James S. Royer(2) Joseph S. Miller(2) More (+10 of total 31)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 55 publication records. Showing 55 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe Computability in Europe 2009. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Jason Teutsch Constant compression and random weights. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Wolfgang Merkle, André Nies Solovay functions and K-triviality. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rupert Hölzl, Wolfgang Merkle Traceable Sets. Search on Bibsonomy IFIP TCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Wolfgang Merkle Constructive equivalence relations on computable probability measures. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle Separations of non-monotonic randomness notions Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle Time-Bounded Kolmogorov Complexity and Solovay Functions. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle Separations of Non-monotonic Randomness Notions. Search on Bibsonomy CCA The full citation details ... 2009 DBLP  BibTeX  RDF
1Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle (eds.) Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen When unlearning helps. Search on Bibsonomy Inf. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Wolfgang Merkle, Alexander Shen A Simple Proof of Miller-Yu Theorem. Search on Bibsonomy Fundam. Inform. The full citation details ... 2008 DBLP  BibTeX  RDF
1Wolfgang Merkle The complexity of stochastic sequences. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Rupert Hölzl, Wolfgang Merkle Generation Complexity Versus Distinction Complexity. Search on Bibsonomy TAMC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Wolfgang Merkle Effective Randomness for Computable Probability Measures. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Wolfgang Merkle Reconciling Data Compression and Kolmogorov Complexity. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Frank Stephan On C-Degrees, H-Degrees and T-Degrees. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Wolfgang Merkle, Jan Reimann Schnorr dimension. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer Generality's price: Inescapable deficiencies in machine-learned programs. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan Kolmogorov-Loveland randomness and stochasticity. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman Some Results on Effective Randomness. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Jan Reimann Selection Functions that Do Not Preserve Normality. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan Kolmogorov Complexity and the Recursion Theorem. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi 06051 Abstracts Collection -- Kolmogorov Complexity and Applications. Search on Bibsonomy Kolmogorov Complexity and Applications The full citation details ... 2006 DBLP  BibTeX  RDF
1Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi (eds.) Kolmogorov Complexity and Applications, 29.01. - 03.02.2006 Search on Bibsonomy Kolmogorov Complexity and Applications The full citation details ... 2006 DBLP  BibTeX  RDF
1Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan Kolmogorov-Loveland Randomness and Stochasticity. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Wolfgang Merkle, Jan Reimann Schnorr Dimension. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Nenad Mihailovic On the construction of effectively random sets. Search on Bibsonomy J. Symb. Log. The full citation details ... 2004 DBLP  BibTeX  RDF
1Wolfgang Merkle, Frank Stephan Trees and learning. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman Some Results on Effective Randomness. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn Almost complete sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Frank Stephan Refuting learning revisited. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences. Search on Bibsonomy J. Symb. Log. The full citation details ... 2003 DBLP  BibTeX  RDF
1Todd Ebert, Wolfgang Merkle, Heribert Vollmer On the Autoreducibility of Random Sequences. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Jan Reimann On Selection Functions that Do Not Preserve Normality. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer Generality's Price: Inescapable Deficiencies in Machine-Learned Programs. Search on Bibsonomy COLT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle The complexity of stochastic sequences. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Todd Ebert, Wolfgang Merkle, Heribert Vollmer On the Autoreducibility of Random Sequences Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Wolfgang Merkle Lattice Embeddings for Abstract Bounded Reducibilities. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Todd Ebert, Wolfgang Merkle Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Nenad Mihailovic On the Construction of Effective Random Sets. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle Structural properties of bounded relations with an application to NP optimization problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle The Global Power of Additional Queries to P-Random Oracles. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Frank Stephan Refuting Learning Revisited. Search on Bibsonomy ALT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan Hausdorff Dimension in Exponential Time. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan Unlearning Helps. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle The Global Power of Additional Queries to p-Random Oracles. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn Almost Complete Sets. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. Search on Bibsonomy Math. Log. Q. The full citation details ... 1999 DBLP  BibTeX  RDF
1Wolfgang Merkle The Global Power of Additional Queries to p-random Oracles. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1Volker Heun, Wolfgang Merkle, Ulrich Weigand Proving the PCP-Theorem. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Frank Stephan Trees and Learning. Search on Bibsonomy COLT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle Exact Pairs for Abstract Bounded Reducibilities. Search on Bibsonomy CSL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Wolfgang Merkle, Yongge Wang Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #55 of 55 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.