Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Forster, J{\"u}rgen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
Jürgen Forster
,
Hans Ulrich Simon
Theoretical Computer Science
350
(1), 2006, pp. 40-48
Relative expected instantaneous loss bounds
Jürgen Forster
,
Manfred K. Warmuth
Journal of Computer and System Sciences
64
(1), 2002, pp. 76-102
A linear lower bound on the unbounded error probabilistic communication complexity
Jürgen Forster
Journal of Computer and System Sciences
65
(4), 2002, pp. 612-625
Relations between communication complexity, linear arrangements, and computational complexity
Jürgen Forster
,
Matthias Krause
,
Satyanarayana V. Lokam
,
Rustam Mubarakzjanov
,
Niels Schmitt
,
Hans Ulrich Simon
Lecture Notes in Computer Science
2245
, 2001, pp. 171-182
A linear lower bound on the unbounded error probabilistic communication complexity
Jürgen Forster
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 100-106