Journals in DBLP

Theor. Comput. Sci.
2002, volume: 284, number: 1

1. Paul Fischer, Hans-Ulrich Simon, Carl Smith
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:1-2 [Journal]
   
2. András Antos
   Lower bounds for the rate of convergence in nonparametric pattern recognition. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:3-24 [Journal]
   
3. Shai Fine, Ran Gilad-Bachrach, Eli Shamir
   Query by committee, linear separation and random walks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:25-51 [Journal]
   
4. Peter L. Bartlett, Shai Ben-David
   Hardness results for neural network approximation problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:53-66 [Journal]
   
5. Nigel Duffy, David P. Helmbold
   A geometric approach to leveraging weak learners. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:67-108 [Journal]
   
6. David P. Helmbold, Sandra Panizza, Manfred K. Warmuth
   Direct and indirect algorithms for on-line learning of disjunctions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:109-142 [Journal]
   
7. Sanjay Jain, Arun Sharma
   Mind change complexity of learning logic programs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:143-160 [Journal]
   
8. Matthias Ott, Frank Stephan
   Avoiding coding tricks by hyperrobust learning. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:161-180 [Journal]
   
9. Márta Pintér
   On the rate of convergence of error estimates for the partitioning classification rule. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:284, n:1, pp:181-196 [Journal]