JCSS,
Volume 71
Volume 71,
Number 1,
July 2005
Volume 71,
Number 2,
August 2005
- Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight approximability results for test set problems in bioinformatics.
145-162
Electronic Edition (link) BibTeX
- Baowen Xu, Yuming Zhou, Hongmin Lu:
An improved accuracy measure for rough sets.
163-173
Electronic Edition (link) BibTeX
- Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo:
Kernels in planar digraphs.
174-184
Electronic Edition (link) BibTeX
- Eike Kiltz, Hans-Ulrich Simon:
Threshold circuit lower bounds on cryptographic functions.
185-212
Electronic Edition (link) BibTeX
- Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
General constructions for information-theoretic private information retrieval.
213-247
Electronic Edition (link) BibTeX
Volume 71,
Number 3,
October 2005
Learning Theory 2003
- Sally A. Goldman:
Special Issue: Learning Theory 2003.
249
Electronic Edition (link) BibTeX
- Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning DNF from random walks.
250-265
Electronic Edition (link) BibTeX
- Adam Tauman Kalai, Rocco A. Servedio:
Boosting in the presence of noise.
266-290
Electronic Edition (link) BibTeX
- Adam Tauman Kalai, Santosh Vempala:
Efficient algorithms for online decision problems.
291-307
Electronic Edition (link) BibTeX
- John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi:
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms.
308-332
Electronic Edition (link) BibTeX
- Matthias Hein, Olivier Bousquet, Bernhard Schölkopf:
Maximal margin classification for metric spaces.
333-359
Electronic Edition (link) BibTeX
- Moses Charikar, Venkatesan Guruswami, Anthony Wirth:
Clustering with qualitative information.
360-383
Electronic Edition (link) BibTeX
Volume 71,
Number 4,
November 2005
- Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
A refined search tree technique for Dominating Set on planar graphs.
385-405
Electronic Edition (link) BibTeX
- Narayan Vikas:
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results.
406-439
Electronic Edition (link) BibTeX
- Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring nondeterminism in pushdown automata.
440-466
Electronic Edition (link) BibTeX
- Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan:
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
467-479
Electronic Edition (link) BibTeX
- Mehmet Hakan Karaata:
An optimal self-stabilizing strarvation-free alternator.
480-494
Electronic Edition (link) BibTeX
- Stavros G. Kolliopoulos, Neal E. Young:
Approximation algorithms for covering/packing integer programs.
495-505
Electronic Edition (link) BibTeX
- Juha Honkala:
An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet.
506-519
Electronic Edition (link) BibTeX
- Philipp Woelfel:
Bounds on the OBDD-size of integer multiplication via universal hashing.
520-534
Electronic Edition (link) BibTeX
- Roberta Gori, Giorgio Levi:
On the verification of finite failure.
535-575
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:08:17 2009
by Michael Ley (ley@uni-trier.de)