The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jürgen Forster: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jürgen Forster, Hans-Ulrich Simon
    On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:128-138 [Conf]
  2. Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans-Ulrich Simon
    How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:380-394 [Conf]
  3. Jürgen Forster
    A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:100-106 [Conf]
  4. Jürgen Forster, Niels Schmitt, Hans-Ulrich Simon
    Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:402-415 [Conf]
  5. Jürgen Forster, Manfred K. Warmuth
    Relative Expected Instantaneous Loss Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:90-99 [Conf]
  6. Jürgen Forster
    Learning Multiplicity Automata from Smallest Counterexamples. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1999, pp:79-90 [Conf]
  7. Jürgen Forster
    On Relative Loss Bounds in Generalized Linear Regression. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:269-280 [Conf]
  8. Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon
    Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:171-182 [Conf]
  9. Jürgen Forster, Manfred K. Warmuth
    Relative Loss Bounds for Temporal-Difference Learning. [Citation Graph (0, 0)][DBLP]
    ICML, 2000, pp:295-302 [Conf]
  10. Jürgen Forster
    A linear lower bound on the unbounded error probabilistic communication complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:612-625 [Journal]
  11. Jürgen Forster, Manfred K. Warmuth
    Relative Expected Instantaneous Loss Bounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:1, pp:76-102 [Journal]
  12. Jürgen Forster, Niels Schmitt, Hans-Ulrich Simon, Thorsten Suttorp
    Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2003, v:51, n:3, pp:263-281 [Journal]
  13. Jürgen Forster, Manfred K. Warmuth
    Relative Loss Bounds for Temporal-Difference Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2003, v:51, n:1, pp:23-50 [Journal]
  14. Jürgen Forster, Hans-Ulrich Simon
    On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:40-48 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002