Relations between communication complexity, linear arrangements and computational complexity,
Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam
Mubarakzjanov, Niels Schmitt and Hans Ulrich Simon.
To appear in Proceedings of the 21st Conference on Foundations
of Software Technology and Theoretical Computer Science, 2001.
Estimating the optimal margins of embeddings in Euclidean half spaces,
Jürgen Forster, Niels Schmitt and Hans Ulrich Simon.
Proceedings of the 14th Annual Conference on Computational
Learning Theory, pages 402-415, Berlin, Springer, 2001.
A linear lower bound on the unbounded error probablistic
communication complexity,
Jürgen Forster.
Proceedings of the 16th Annual IEEE Conference on Computational
Complexity, pages 100-106, IEEE Computer Society Press, 2001.
Relative expected instantaneous loss bounds,
Jürgen Forster and Manfred Warmuth.
To appear in the Journal of Computer and System Sciences.
A preliminary version appeared in
Proceedings of the 13th Conference on
Computational Learning Theory, pages 90-99, San Francisco, Morgan
Kaufmann, 2000.
Relative loss bounds for temporal-difference learning,
Jürgen Forster and Manfred Warmuth.
To appear in the Journal of Machine Learning.
A preliminary version appeared in
Proceedings of the 17th International Conference on Machine
Learning, pages 295-302, San Francisco, Morgan
Kaufmann, 2000.
On Relative loss bounds in generalized linear regression,
Jürgen Forster.
In Gabriel Ciobanu, Gheorge Paun (Eds.),
Proceedings of the 12th International Symposium on Fundamentals
of Computation Theory, pages 269-280, Berlin, Springer, 1999.
Lernen von Multiplicity-Automaten aus kürzesten Gegenbeispielen,
Diplomarbeit Informatik, Universität Dortmund, 1998. Also
appeared as
Learning multiplicity automata from smallest counterexamples
in Paul Fischer and Hans Ulrich Simon (Eds.),
Proceedings of the
4th European Conference on Computational Learning Theory,
pages 79-90, Berlin, Springer, 1999.
Der Funktor Ext^1 und Anwendungen auf das Zerfallen kurzer exakter
Sequenzen von Frecheträumen,
Diplomarbeit Mathematik, Universität Dortmund, 1998.