External Links

    Journal: J. Comput. Syst. Sci.

    Volume 21, Issue 3

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

    Volume 21, Issue 2

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

    Volume 21, Issue 1

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