JCSS, Volume 71

Volume 71, Number 1, July 2005

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

Volume 71, Number 2, August 2005

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

Volume 71, Number 3, October 2005

• Sally A. Goldman:
  Special Issue: Learning Theory 2003. 249
  
• Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
  Learning DNF from random walks. 250-265
  
• Adam Tauman Kalai, Rocco A. Servedio:
  Boosting in the presence of noise. 266-290
  
• Adam Tauman Kalai, Santosh Vempala:
  Efficient algorithms for online decision problems. 291-307
  
• 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
  
• Matthias Hein, Olivier Bousquet, Bernhard Schölkopf:
  Maximal margin classification for metric spaces. 333-359
  
• Moses Charikar, Venkatesan Guruswami, Anthony Wirth:
  Clustering with qualitative information. 360-383
  

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
  
• 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
  
• Jonathan Goldstine, Hing Leung, Detlef Wotschke:
  Measuring nondeterminism in pushdown automata. 440-466
  
• 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
  
• Mehmet Hakan Karaata:
  An optimal self-stabilizing strarvation-free alternator. 480-494
  
• Stavros G. Kolliopoulos, Neal E. Young:
  Approximation algorithms for covering/packing integer programs. 495-505
  
• Juha Honkala:
  An n²-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet. 506-519
  
• Philipp Woelfel:
  Bounds on the OBDD-size of integer multiplication via universal hashing. 520-534
  
• Roberta Gori, Giorgio Levi:
  On the verification of finite failure. 535-575