Learning Multiplicity Automata from Smallest Counterexamples. - Jürgen Forster (EuroCOLT, 1999)

On Relative Loss Bounds in Generalized Linear Regression. - Jürgen Forster (FCT, 1999)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. - Jürgen Forster; Niels Schmitt; Hans Ulrich Simon (COLT/EuroCOLT, 2001)

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. - Jürgen Forster; Matthias Krause 001; Satyanarayana V. Lokam; Rustam Mubarakzjanov; Niels Schmitt; Hans Ulrich Simon (FSTTCS, 2001)

How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. - Dietrich Braess; Jürgen Forster; Tomas Sauer; Hans Ulrich Simon (ALT, 2002)

On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution. - Jürgen Forster; Hans Ulrich Simon (ALT, 2002)

A linear lower bound on the unbounded error probabilistic communication complexity. - Jürgen Forster (J. Comput. Syst. Sci., 2002)

Relative Expected Instantaneous Loss Bounds. - Jürgen Forster; Manfred K. Warmuth (J. Comput. Syst. Sci., 2002)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. - Jürgen Forster; Niels Schmitt; Hans Ulrich Simon; Thorsten Suttorp (Mach. Learn., 2003)

Relative Loss Bounds for Temporal-Difference Learning. - Jürgen Forster; Manfred K. Warmuth (Mach. Learn., 2003)

On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. - Jürgen Forster; Hans Ulrich Simon (Theor. Comput. Sci., 2006)