| Publication | Date of Publication | Type |
|---|
| Complete inverted files for efficient text retrieval and analysis | 2020-04-05 | Paper |
| How to use expert advice | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302088 | 2009-01-05 | Paper |
| New Methods for Detecting Lineage-Specific Selection | 2007-08-30 | Paper |
| Detecting the Dependent Evolution of Biosequences | 2007-08-30 | Paper |
| Generalization performance of Bayes optimal classification algorithm for learning a perceptron | 2000-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247216 | 2000-04-06 | Paper |
| Sequential prediction of individual sequences under general loss functions | 1999-11-21 | Paper |
| Mutual information, metric entropy and cumulative relative entropy risk | 1999-09-21 | Paper |
| A graph-theoretic generalization of the Sauer-Shelah lemma | 1998-09-27 | Paper |
| How to use expert advice | 1998-02-17 | Paper |
| Scale-sensitive dimensions, uniform convergence, and learnability | 1998-02-17 | Paper |
| A general minimax result for relative entropy | 1998-01-13 | Paper |
| Rigorous learning curve bounds from statistical mechanics | 1997-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4714286 | 1996-12-04 | Paper |
| A generalization of Sauer's lemma | 1996-02-11 | Paper |
| Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension | 1995-08-07 | Paper |
| The size of \(k\)-pseudotrees | 1995-07-24 | Paper |
| Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions | 1995-06-08 | Paper |
| Predicting \(\{ 0,1\}\)-functions on randomly drawn points | 1995-02-16 | Paper |
| Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension | 1994-03-03 | Paper |
| Decision theoretic generalizations of the PAC model for neural net and other learning applications | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013531 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013556 | 1992-09-27 | Paper |
| Equivalence of models for polynomial learnability | 1992-06-28 | Paper |
| Average sizes of suffix trees and DAWGs | 1989-01-01 | Paper |
| Learning decision trees from random examples | 1989-01-01 | Paper |
| A general lower bound on the number of examples needed for learning | 1989-01-01 | Paper |
| Learnability and the Vapnik-Chervonenkis dimension | 1989-01-01 | Paper |
| A new distance metric on strings computable in linear time | 1988-01-01 | Paper |
| Quantifying inductive bias: AI learning algorithms and Valiant's learning framework | 1988-01-01 | Paper |
| Applications of an infinite square-free co-CFL | 1987-01-01 | Paper |
| \(\epsilon\)-nets and simplex range queries | 1987-01-01 | Paper |
| Occam's razor | 1987-01-01 | Paper |
| Quasi-Monotonic Sequences: Theory, Algorithms and Applications | 1987-01-01 | Paper |
| Another generalization of Higman's well quasi order result on \(\Sigma ^*\) | 1985-01-01 | Paper |
| On total regulators generated by derivation relations | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687737 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738577 | 1985-01-01 | Paper |
| On DOS languages and DOS mappings | 1984-01-01 | Paper |
| On the complexity of iterated shuffle | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217631 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680300 | 1984-01-01 | Paper |
| On regularity of context-free languages | 1983-01-01 | Paper |
| Insertion languages | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959450 | 1982-01-01 | Paper |
| Model Completeness of an Algebra of Languages | 1981-01-01 | Paper |
| Very special languages and representations of recursively enumerable languages via computation histories | 1980-01-01 | Paper |
