default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Forster
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j5]Jürgen Forster, Hans Ulrich Simon
:
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci. 350(1): 40-48 (2006)- 2003
- [j4]Jürgen Forster, Manfred K. Warmuth:
Relative Loss Bounds for Temporal-Difference Learning. Mach. Learn. 51(1): 23-50 (2003) - [j3]Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, Thorsten Suttorp:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. Mach. Learn. 51(3): 263-281 (2003) - 2002
- [j2]Jürgen Forster, Manfred K. Warmuth:
Relative Expected Instantaneous Loss Bounds. J. Comput. Syst. Sci. 64(1): 76-102 (2002) - [j1]Jürgen Forster:
A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci. 65(4): 612-625 (2002) - [c9]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. ALT 2002: 128-138 - [c8]Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans Ulrich Simon:
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. ALT 2002: 380-394 - 2001
- [c7]Jürgen Forster:
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity. CCC 2001: 100-106 - [c6]Jürgen Forster, Niels Schmitt, Hans Ulrich Simon:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. COLT/EuroCOLT 2001: 402-415 - [c5]Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon:
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. FSTTCS 2001: 171-182 - 2000
- [c4]Jürgen Forster, Manfred K. Warmuth:
Relative Expected Instantaneous Loss Bounds. COLT 2000: 90-99 - [c3]Jürgen Forster, Manfred K. Warmuth:
Relative Loss Bounds for Temporal-Difference Learning. ICML 2000: 295-302
1990 – 1999
- 1999
- [c2]Jürgen Forster:
Learning Multiplicity Automata from Smallest Counterexamples. EuroCOLT 1999: 79-90 - [c1]Jürgen Forster:
On Relative Loss Bounds in Generalized Linear Regression. FCT 1999: 269-280
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
