Journal: J. Comput. Syst. Sci.

Volume 71, Issue 4

385 -- 405Jochen 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
406 -- 439Narayan Vikas. A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
440 -- 466Jonathan Goldstine, Hing Leung, Detlef Wotschke. Measuring nondeterminism in pushdown automata
467 -- 479Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
480 -- 494Mehmet Hakan Karaata. An optimal self-stabilizing strarvation-free alternator
495 -- 505Stavros G. Kolliopoulos, Neal E. Young. Approximation algorithms for covering/packing integer programs
506 -- 519Juha Honkala. An ::::n:::::::2:::-bound for the ultimate equivalence problem of certain D0L systems over an ::::n::::-letter alphabet
520 -- 534Philipp Woelfel. Bounds on the OBDD-size of integer multiplication via universal hashing
535 -- 575Roberta Gori, Giorgio Levi. On the verification of finite failure

Volume 71, Issue 3

249 -- 0Sally A. Goldman. Special Issue: Learning Theory 2003
250 -- 265Nader H. Bshouty, Elchanan Mossel, Ryan O Donnell, Rocco A. Servedio. Learning DNF from random walks
266 -- 290Adam Tauman Kalai, Rocco A. Servedio. Boosting in the presence of noise
291 -- 307Adam Tauman Kalai, Santosh Vempala. Efficient algorithms for online decision problems
308 -- 332John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi. On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
333 -- 359Matthias Hein, Olivier Bousquet, Bernhard Schölkopf. Maximal margin classification for metric spaces
360 -- 383Moses Charikar, Venkatesan Guruswami, Anthony Wirth. Clustering with qualitative information

Volume 71, Issue 2

145 -- 162Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao. Tight approximability results for test set problems in bioinformatics
163 -- 173Baowen Xu, Yuming Zhou, Hongmin Lu. An improved accuracy measure for rough sets
174 -- 184Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo. Kernels in planar digraphs
185 -- 212Eike Kiltz, Hans-Ulrich Simon. Threshold circuit lower bounds on cryptographic functions
213 -- 247Amos Beimel, Yuval Ishai, Eyal Kushilevitz. General constructions for information-theoretic private information retrieval

Volume 71, Issue 1

1 -- 33Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce. Graph-based specification of access control policies
34 -- 69Ruggero Lanotte, Andrea Maggiolo-Schettini. Monotonic hybrid systems
70 -- 85Tetz C. Huang. A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
86 -- 143John H. Reif. Efficient parallel factorization and solution of structured and unstructured linear systems