JCSS,
Volume 75
Volume 75,
Number 1,
January 2009
- Lisa Hellerstein, Hans-Ulrich Simon:
Special Issue: Learning Theory 2006.
1
Electronic Edition (link) BibTeX
- Adam R. Klivans, Alexander A. Sherstov:
Cryptographic hardness for learning intersections of halfspaces.
2-12
Electronic Edition (link) BibTeX
- Vitaly Feldman:
Hardness of approximate two-level logic minimization and PAC learning with membership queries.
13-26
Electronic Edition (link) BibTeX
- Lance Fortnow, Adam R. Klivans:
Efficient learning algorithms yield circuit lower bounds.
27-36
Electronic Edition (link) BibTeX
- Benjamin I. P. Rubinstein, Peter L. Bartlett, J. Hyam Rubinstein:
Shifting: One-inclusion mistake bounds and sample compression.
37-59
Electronic Edition (link) BibTeX
- Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu:
Learning a circuit by injecting values.
60-77
Electronic Edition (link) BibTeX
- Maria-Florina Balcan, Alina Beygelzimer, John Langford:
Agnostic active learning.
78-89
Electronic Edition (link) BibTeX
Volume 75,
Number 2,
February 2009
Volume 75,
Number 3,
May 2009
Volume 75,
Number 4,
June 2009
- Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Broadcasting in dynamic radio networks.
213-230
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Derivation of algorithms for cutwidth and related graph layout parameters.
231-244
Electronic Edition (link) BibTeX
- Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The complexity of satisfiability problems: Refining Schaefer's theorem.
245-254
Electronic Edition (link) BibTeX
- Harumichi Nishimura, Tomoyuki Yamakami:
An application of quantum finite automata to interactive proof systems.
255-269
Electronic Edition (link) BibTeX
Volume 75,
Number 5,
August 2009
Copyright © Sun May 17 00:08:19 2009
by Michael Ley (ley@uni-trier.de)
