External Links

    Journal: J. Comput. Syst. Sci.

    Volume 22, Issue 3

    265 -- 279Mark N. Wegman, Larry Carter. New Hash Functions and Their Use in Authentication and Set Equality
    280 -- 311Gilles Brassard. A Time-Luck Tradeoff in Relativized Cryptography
    312 -- 327Wolfgang J. Paul, Rüdiger Reischuk. On Time versus Space II. (Turing Machines)
    328 -- 350Dexter Kozen. Semantics of Probabilistic Programs
    351 -- 364Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa. A Time-Space Tradeoff for Sorting on Non-Oblivious Machines
    365 -- 383Walter L. Ruzzo. On Uniform Circuit Complexity
    384 -- 406Neil Immerman. Number of Quantifiers is Better Than Number of Tape Cells
    407 -- 420Ofer Gabber, Zvi Galil. Explicit Constructions of Linear-Sized Superconcentrators
    421 -- 441Janos Simon. Division in Idealized Unit Cost RAMS
    442 -- 453Michael Machtey, Paul Young. Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems
    454 -- 470Nicholas Pippenger. Computational Complexity of Algebraic Functions

    Volume 22, Issue 2

    107 -- 143Gregory A. Riccardi. The Independence of Control Structures in Abstract Programming Systems
    144 -- 177Dirk Janssens, Grzegorz Rozenberg. Decision Problems for Node Label Controlled Graph Grammars
    178 -- 197David A. Workman. SR(s, k) Parsers: A Class of Shift-Reduce Bounded-Context Parsers
    198 -- 219Michael P. Georgeff. Interdependent Translation Schemes
    220 -- 229Eitan M. Gurari, Oscar H. Ibarra. The Complexity of Decision Problems for Finite-Turn Multicounter Machines
    230 -- 242John E. Savage. Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models
    243 -- 259Theodore P. Baker. Extending Lookahead for LR Parsers

    Volume 22, Issue 1

    1 -- 8Shlomo Moran. Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies
    9 -- 28Tsuyoshi Nakamura. Regularity and Firing Sequences of Computation Graphs
    29 -- 41Stephen J. Willson. Growth Patterns of Ordered Cellular Automata
    42 -- 52Keijo Ruohonen. The Decidability of the D0L-DT0L Equivalence Problem
    53 -- 59Paul Chew, Michael Machtey. A Note on Structure and Looking Back Applied to the Complexity of Computable Functions
    60 -- 97Tatsuo Ohtsuki, Hajimu Mori, Toshinobu Kashiwabara, Toshio Fujisawa. On Minimal Augmentation of a Graph to Obtain an Interval Graph
    98 -- 105Robert Melville. An Improved Simulation Result for Ink-Bounded Turing Machines
    runs on