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]
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]
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]
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.005secs
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