JCSS, Volume 59

Volume 59, Number 1, August 1999

• Oscar H. Ibarra, Jianwen Su: A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries. 1-28
• Yuri Breitbart, Henry F. Korth: Replication and Consistency in a Distributed Environment. 29-69
• Zhixiang Chen, Foued Ameur: The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space. 70-83
• Pranay Chaudhuri: A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph. 84-93
• Marianne Baudinet, Jan Chomicki, Pierre Wolper: Constraint-Generating Dependencies. 94-115
• Gösta Grahne, Matti Nykänen, Esko Ukkonen: Reasoning about Strings in Databases. 116-162

Volume 59, Number 2, October 1999

• Eric Allender, Klaus Reinhardt, Shiyu Zhou: Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. 164-181
• Harry Buhrman, Lance Fortnow: Two Queries. 182-194
• Amos Beimel, Anna Gál: On Arithmetic Branching Programs. 195-220
• Jin-yi Cai, Ajay Nerurkar: Approximating the SVP to within a Factor (1+1/dim^xi) Is NP-Hard under Randomized Reductions. 221-239
• Lance Fortnow, John D. Rogers: Complexity Limitations on Quantum Computation. 240-252
• Oded Goldreich, Madhu Sudan: Computational Indistinguishability: A Sample Hierarchy. 253-269
• D. Sivakumar: On Membership Comparable Sets. 270-280
• John Watrous: Space-Bounded Quantum Complexity. 281-326
• Harry Buhrman, Dieter van Melkebeek: Hard Sets Are Hard to Find. 327-345
• Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin: Arthur-Merlin Games in Boolean Decision Trees. 346-372

Volume 59, Number 3, December 1999

• Stephane Gaubert, Alessandro Giua: Petri Net Languages and Infinite Subsets of m. 373-391
• Nicolò Cesa-Bianchi: Analysis of Two Gradient-Based Algorithms for On-Line Regression. 392-411
• Flavio Corradini, Rocco De Nicola, Anna Labella: Models of Nondeterministic Regular Expressions. 412-449
• Lin Chen: Graph Isomorphism and Identification Matrices: Sequential Algorithms. 450-475
• Petr Jancar, Javier Esparza, Faron Moller: Petri Nets and Regular Processes. 476-503
• Bob P. Weems: Bistable Versions of the Marriages and Roommates Problems. 504-520
• Leo Liberti: Structure of the Invertible CA Transformations Group. 521-536
• Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigliola Vaglini: Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems. 537-556
• Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht: On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases - CORRIGENDUM. 557-562