Volume 284, Number 1, July 2002
- Paul Fischer, Hans-Ulrich Simon, Carl Smith:
Foreword.
1-2
- András Antos:
Lower bounds for the rate of convergence in nonparametric pattern recognition.
3-24
- Shai Fine, Ran Gilad-Bachrach, Eli Shamir:
Query by committee, linear separation and random walks.
25-51
- Peter L. Bartlett, Shai Ben-David:
Hardness results for neural network approximation problems.
53-66
- Nigel Duffy, David P. Helmbold:
A geometric approach to leveraging weak learners.
67-108
- David P. Helmbold, Sandra Panizza, Manfred K. Warmuth:
Direct and indirect algorithms for on-line learning of disjunctions.
109-142
- Sanjay Jain, Arun Sharma:
Mind change complexity of learning logic programs.
143-160
- Matthias Ott, Frank Stephan:
Avoiding coding tricks by hyperrobust learning.
161-180
- Márta Pintér:
On the rate of convergence of error estimates for the partitioning classification rule.
181-196
Volume 284, Number 2, July 2002
- Ker-I Ko, Anil Nerode, Klaus Weihrauch:
Foreword.
197
- Markus Bläser:
Uniform computational complexity of the derivatives of Cinfinity-functions.
199-206
- Jens Blanck, Viggo Stoltenberg-Hansen, J. V. Tucker:
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
207-240
- Vasco Brattka, Peter Hertling:
Topological properties of real number representations.
241-257
- Douglas S. Bridges, Nicholas Dudley Ward:
Kernels of seminorms in constructive analysis.
259-267
- Cristian Calude:
Chaitin Omega numbers, Solovay machines, and Gödel incompleteness.
269-277
- Douglas A. Cenzer, Jeffrey B. Remmel:
Effectively closed sets and graphs of computable real functions.
279-318
- Abbas Edalat, André Lieutier:
Foundation of a computable solid modelling.
319-345
- Armin Hemmerling:
Effective metric spaces and representations of the reals.
347-372
- Michal Konecný:
Real functions computable by finite automata using affine representations.
373-396
- Vladimir Krupski:
Effective simultaneous approximability of reals.
397-417
- Takakazu Mori:
On the computability of Walsh functions.
419-436
- Dag Normann:
Exact real number computations relative to hereditarily total functionals.
437-453
- Ludwig Staiger:
The Kolmogorov complexity of real numbers.
455-466
- Hideki Tsuiki:
Real number computation through Gray code embedding.
467-485
- Atsushi Yoshikawa:
Interpolation functor and computability.
487-498
- Xizhong Zheng:
The closure properties on real numbers under limits and computable operators.
499-518
- Matthias Schröder:
Extended admissibility.
519-538
- Rodney G. Downey, Geoffrey LaForte:
Presentations of computably enumerable reals.
539-555
Last update Mon May 20 18:32:14 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
