JCSS, Volume 21

Volume 21, Number 1, August 1980

• 
  Daniel J. Lehmann:
  On the Algebra of Order. 1-23
• 
  Lazaros P. Mavrides:
  A Finite Step-Size Procedure for the F-W Method. 24-29
• 
  Shigeko Seki, Youichi Kobuchi:
  On DIL Schemes Simulated by D0L Schemes. 30-45
• 
  Dana Angluin:
  Finding Patterns Common to a Set of Strings. 46-62
• 
  Satoru Fujishige:
  An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. 63-86
• 
  Tom Head:
  A-Transducers and the Monotonicity of IL Schemes. 87-91
• 
  Jeffrey M. Jaffe:
  The Equivalence of RE Program Schemes and Data Flow Schemes. 92-109
• 
  Hermann A. Maurer, Arto Salomaa, Derick Wood:
  Context-Free Grammar Forms with Strict Interpretations. 110-135
• 
  Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
  Structure Preserving Reductions among Convex Optimization Problems. 136-153

Volume 21, Number 2, October 1980

Selected Papers from

STOC 1979

• 
  Ashok K. Chandra, David Harel:
  Computable Queries for Relational Data Bases. 156-178
• 
  Richard E. Ladner:
  The Complexity of Problems in Systems of Communicating Sequential Processes. 179-194
• 
  Michael Sipser:
  Lower Bounds on the Size of Sweeping Automata. 195-202
• 
  Zvi Galil, Amnon Naamad:
  An O(EVlog²V) Algorithm for the Maximal Flow Problem. 203-217
• 
  Walter L. Ruzzo:
  Tree-Size Bounded Alternation. 218-235
• 
  J. Ian Munro, Hendra Suwanda:
  Implicit Data Structures for Fast Search and Update. 236-250

Volume 21, Number 3, December 1980

• 
  Nancy A. Lynch:
  Straight-Line Program Length as a Parameter for Complexity Analysis. 251-280
• 
  G. Naudé:
  A Duality Theory for Decomposable Systems in a Category. 281-291
• 
  Franz-Josef Brandenburg:
  Multiple Equality Sets and Post Machines. 292-316
• 
  Harry R. Lewis:
  Complexity Results for Classes of Quantificational Formulas. 317-353
• 
  Gaston H. Gonnet:
  Open-Addressing Hashing with Unequal-Probability Keys. 354-367
• 
  David Maier, Alberto O. Mendelzon, Fereidoon Sadri, Jeffrey D. Ullman:
  Adequacy of Decompositions of Relational Databases. 368-379