| **Warmuth, M. K.** (P. M. Long and M. K. Warmuth) -- *Composite Geometric Concepts and Polynomial Predictability* - 1994 |

| **Warmuth, M. K.** (N. Littlestone, P. M. Long and M. K. Warmuth) -- *On-line learning of linear functions* - 1995 |

| **Warmuth, M. K.** (D. Haussler, M. Kearns, N. Littlestone and M. K. Warmuth) -- *Equivalence of Models for Polynomial Learnability* - December 1991 |

| **Warmuth, M. K.** (N. Abe, J. Takeuchi and M. K. Warmuth) -- *Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence* - 1991 |

| **Warmuth, M. K.** (D. P. Helmbold, S. Panizza and M. K. Warmuth) -- *Direct and indirect algorithms for on-line learning of disjunctions* - 2002 |

| **Warmuth, M. K.** (A. Blumer, A. Ehrenfeucht, D. Haussler and M. K. Warmuth) -- *Occam's Razor* - April 1987 |

| **Warmuth, M. K.** (D. Helmbold, R. Sloan and M. K. Warmuth) -- *Learning nested differences of intersection-closed concept classes* - 1989 |

| **Warmuth, M. K.** (D. Helmbold, R. Sloan and M. K. Warmuth) -- *Learning Integer Lattices* - 1992 |

| **Warmuth, M. K.** (D. Helmbold, R. E. Schapire, Y. Singer and M. K. Warmuth) -- *A comparison of new and old algorithms for a mixture estimation problem* - 1997 |

| **Warmuth, M. K.** (J. Kivinen and M. K. Warmuth) -- *Relative Loss Bounds for Multidimensional Regression Problems* - 2001 |

| **Warmuth, M. K.** (N. Littlestone and M. K. Warmuth) -- *The weighted majority algorithm* - 1994 |

| **Warmuth, M. K.** (N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. E. Schapire and M. K. Warmuth) -- *How to use expert advice* - 1993 |

| **Warmuth, M. K.** (D. Haussler, N. Littlestone and M. K. Warmuth) -- *Predicting {0,1} Functions on Randomly Drawn Points* - 1994 |

| **Warmuth, M. K.** (L. Pitt and M. K. Warmuth) -- *Prediction Preserving Reducibility* - December 1990 |

| **Warmuth, M. K.** (N. Cesa-Bianchi, A. Krogh and M. K. Warmuth) -- *Bounds on approximate steepest descent for likelihood maximization in exponential families* - July 1994 |

| **Warmuth, M. K.** (Katy S. Azoury and M. K. Warmuth) -- *Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions* - 2001 |

| **Warmuth, M. K.** (D. P. Helmbold and M. K. Warmuth) -- *Some weak learning results* - 1992 |

| **Warmuth, M. K.** (D. Haussler and M. K. Warmuth) -- *The Probably Approximately Correct (PAC) and Other Learning Models* - 1993 |

| **Warmuth, M. K.** (N. Cesa-Bianchi, P. M. Long and M. K. Warmuth) -- *Worst-case quadratic loss bounds for on-line prediction of linear functions by gradient descent* - 1996 |

| **Warmuth, M. K.** (D. Haussler, J. Kivinen and M. K. Warmuth) -- *Sequential prediction of individual sequences under general loss functions* - 1998 |

| **Warmuth, M. K.** (M. K. Warmuth) -- *Towards Representation Independence in PAC-learning* - October 1989 |

| **Warmuth, M. K.** (J. Kivinen and M. K. Warmuth) -- *Exponentiated Gradient Versus Gradient Descent for Linear Predictors* - June 1994 |