| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5091184 | 2022-07-21 | Paper |
| Unlabeled sample compression schemes and corner peelings for ample and maximum classes | 2022-04-04 | Paper |
| Mistake bounds on the noise-free multi-armed bandit game | 2019-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4558165 | 2018-11-21 | Paper |
| Learning rotations with little regret | 2018-01-12 | Paper |
| The p-norm generalization of the LMS algorithm for adaptive filtering | 2017-10-30 | Paper |
| Online PCA with optimal regret | 2016-11-22 | Paper |
| Labeled Compression Schemes for Extremal Classes | 2016-11-09 | Paper |
| Noise Free Multi-armed Bandit Game | 2016-04-13 | Paper |
| How to use expert advice | 2015-05-07 | Paper |
| Kernelization of matrix updates, when and how? | 2014-10-31 | Paper |
| Combining initial segments of lists | 2014-01-13 | Paper |
| Online PCA with Optimal Regrets | 2013-11-06 | Paper |
| Kernelization of Matrix Updates, When and How? | 2012-10-16 | Paper |
| Online variance minimization | 2012-05-23 | Paper |
| Learning permutations with exponential weights | 2012-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096194 | 2011-11-08 | Paper |
| Combining Initial Segments of Lists | 2011-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093288 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093332 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174151 | 2011-10-12 | Paper |
| Bayesian generalized probability calculus for density matrices | 2010-10-07 | Paper |
| Entropy Regularized LPBoost | 2008-10-14 | Paper |
| Learning Permutations with Exponential Weights | 2008-01-03 | Paper |
| When Is There a Free Matrix Lunch? | 2008-01-03 | Paper |
| Online Variance Minimization | 2007-09-14 | Paper |
| Continuous Experts and the Binning Algorithm | 2007-09-14 | Paper |
| Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints | 2007-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477861 | 2006-06-29 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| 10.1162/153244303321897654 | 2004-10-28 | Paper |
| 10.1162/1532443041424328 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046716 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046696 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473253 | 2004-08-04 | Paper |
| Relative loss bounds for temporal-difference learning | 2003-08-06 | Paper |
| Predicting nearly as well as the best pruning of a planar decision graph. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148798 | 2002-09-22 | Paper |
| Relative loss bounds for on-line density estimation with the exponential family of distributions | 2002-07-22 | Paper |
| Direct and indirect algorithms for on-line learning of disjunctions | 2002-07-15 | Paper |
| Relative expected instantaneous loss bounds | 2002-07-04 | Paper |
| Relative loss bounds for multidimensional regression problems | 2002-04-11 | Paper |
| Tracking the best linear predictor | 2002-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234067 | 2001-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526998 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955323 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252716 | 2000-04-26 | Paper |
| Sequential prediction of individual sequences under general loss functions | 1999-11-21 | Paper |
| Tracking the best disjunction | 1999-05-18 | Paper |
| Tracking the best expert | 1999-01-17 | Paper |
| The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant | 1998-08-13 | Paper |
| Efficient learning with virtual threshold gates | 1998-04-26 | Paper |
| How to use expert advice | 1998-02-17 | Paper |
| Exponentiated gradient versus gradient descent for linear predictors | 1997-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4714286 | 1996-12-04 | Paper |
| On weak learning | 1996-04-29 | Paper |
| On the worst-case analysis of temporal-difference learning algorithms | 1996-04-21 | Paper |
| Learning binary relations using weighted majority voting | 1995-10-29 | Paper |
| Composite geometric concepts and polynomial predictability | 1995-10-03 | Paper |
| On-line learning of linear functions | 1995-04-20 | Paper |
| Bounds on approximate steepest descent for likelihood maximization in exponential families | 1995-03-01 | Paper |
| Predicting \(\{ 0,1\}\)-functions on randomly drawn points | 1995-02-16 | Paper |
| The distributed bit complexity of the ring: From the anonymous to the non-anonymous case | 1994-02-22 | Paper |
| The weighted majority algorithm | 1994-01-01 | Paper |
| Gap Theorems for Distributed Computation | 1993-05-17 | Paper |
| The minimum consistent DFA problem cannot be approximated within any polynomial | 1993-05-16 | Paper |
| On the computational complexity of approximating distributions by probabilistic automata | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013559 | 1992-09-27 | Paper |
| Equivalence of models for polynomial learnability | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974855 | 1992-06-26 | Paper |
| The \((n^ 2-1)\)-puzzle and related relocation problems | 1990-01-01 | Paper |
| Prediction-preserving reducibility | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3468890 | 1990-01-01 | Paper |
| Learnability and the Vapnik-Chervonenkis dimension | 1989-01-01 | Paper |
| A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs | 1989-01-01 | Paper |
| Scattered versus context-sensitive rewriting | 1989-01-01 | Paper |
| Parallel approximation algorithms for bin packing | 1989-01-01 | Paper |
| Computing on an anonymous ring | 1988-01-01 | Paper |
| Occam's razor | 1987-01-01 | Paper |
| Membership for growing context-sensitive grammars is polynomial | 1986-01-01 | Paper |
| Manipulating derivation forests by scheduling techniques | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727407 | 1986-01-01 | Paper |
| Applications of scheduling theory to formal language theory | 1985-01-01 | Paper |
| Profile Scheduling of Opposing Forests and Level Orders | 1985-01-01 | Paper |
| Scheduling Flat Graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678667 | 1985-01-01 | Paper |
| On the complexity of iterated shuffle | 1984-01-01 | Paper |
| Scheduling precedence graphs of bounded height | 1984-01-01 | Paper |
