JCSS, Volume 31

Volume 31, Number 1, August 1985

• Rami G. Melhem: Formal Analysis of a Systolic System for Finite Element Stiffness Matrices. 1-27
• Juraj Hromkovic: On the Power of Alternation in Automata Theory. 28-39
• Martin E. Kaliski, Quentin L. Klein: Behavior of a Class of Nonlinear Discrete-Time Systems. 40-62
• Mikhail J. Atallah: A Matching Problem in the Plane. 63-70
• Joost Engelfriet, Heiko Vogler: Macro Tree Transducers. 71-146

Volume 31, Number 2, October 1985

• Harold N. Gabow: Scaling Algorithms for Network Problems. 148-168
• Christopher B. Wilson: Relativized Circuit Complexity. 169-181
• Philippe Flajolet, G. Nigel Martin: Probabilistic Counting Algorithms for Data Base Applications. 182-209
• Janet Incerpi, Robert Sedgewick: Improved Upper Bounds on Shellsort. 210-224
• Joachim von zur Gathen: Irreducibility of Multivariate Polynomials. 225-264
• Joachim von zur Gathen, Erich Kaltofen: Factoring Sparse Multivariate Polynomials. 265-287
• Christos H. Papadimitriou: Games Against Nature. 288-301

Volume 31, Number 3, December 1985

• Géraud Sénizergues: The Equivalence and Inclusion Problems for NTS Languages. 303-331
• Luc Boasson, Géraud Sénizergues: NTS Languages Are Deterministic and Congruential. 332-342
• Patrick C. Fischer, Lawrence V. Saxton, Stan J. Thomas, Dirk Van Gucht: Interactions between Dependencies and Nested Relational Structures. 343-354
• Philip A. Bernstein, Nathan Goodman: Serializability Theory for Replicated Databases. 355-374
• Stephen L. Bloom, Zoltán Ésik: Axiomatizing Schemes and Their Behaviors. 375-393
• Alberto Apostolico, Franco P. Preparata: Structural Properties of the String Statistics Problem. 394-411