- Richard J. Anderson, Ernst W. Mayr, and Manfred K. Warmuth. Parallel approximation algorithms
for bin packing. Information and Computation,
82(3):262-277, September 1989.
Abstract,
References,
and Citations.
- David Haussler, Michael Kearns, Nick Littlestone, and Manfred K.
Warmuth. Equivalence
of models for polynomial learnability. Information and
Computation, 95(2):129-161, December 1991.
Citations.
- Hans L. Bodlaender, Shlomo Moran, and Manfred K. Warmuth. The distributed bit complexity
of the ring: From the anonymous to the non-anonymous case.
Information and Computation, 108(1):34-50, January 1994.
Abstract
and References.
- Nick Littlestone and Manfred K. Warmuth. The weighted majority
algorithm. Information and Computation, 108(2):212-261,
1 February 1994.
References
and Citations.
- Philip M. Long and Manfred K. Warmuth. Composite geometric concepts and
polynomial predictability. Information and Computation,
113(2):230-252, September 1994.
References
and Citations.
- D. Haussler, N. Littlestone, and M. K. Warmuth. Predicting {0,1}-functions on
randomly drawn points. Information and Computation,
115(2):248-292, December 1994.
Abstract,
References,
and Citations.
- Jyrki Kivinen and Manfred K. Warmuth. Exponentiated gradient versus
gradient descent for linear predictors. Information and
Computation, 132(1):1-63, 10 January 1997.
Abstract,
References,
Citations,
etc.
- Wolfgang Maass and Manfred K. Warmuth. Efficient learning with virtual
threshold gates. Information and Computation,
141(1):66-83, 25 February 1998.
Abstract
and References.
Shortcuts: