External Links

    Journal: J. Comput. Syst. Sci.

    Volume 23, Issue 3

    299 -- 325Rüdiger Valk, Guy Vidal-Naquet. Petri Nets and Regular Languages
    326 -- 332Alan L. Selman. Some Observations on NP, Real Numbers and P-Selective Sets
    333 -- 347Lawrence Snyder. Theft and Conspiracy in the Take-Grant Protection Model
    348 -- 354Ernst L. Leiss. The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata
    355 -- 365Michael L. Fredman, Dennis J. Volper. Query Time Versus Redundancy Trade-Offs for Range Queries
    366 -- 382Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda. The Equivalence Problem for Two DPDA s, One of Which is a Finite-Turn or One-Counter Machine
    383 -- 424Luigia Carlucci Aiello, Gianfranco Prini. An Efficient Interpreter for the Lambda-Calculus

    Volume 23, Issue 2

    108 -- 126Wolfgang J. Paul, Joel I. Seiferas, Janos Simon. An Information-Theoretic Approach to Time Bounds for On-Line Computation
    127 -- 150Martin Tompa. An Optimal Solution to a Wire-Routing Problem
    151 -- 165Nicholas Pippenger. Pebbling with an Auxiliary Pushdown
    166 -- 204Mark H. Overmars, Jan van Leeuwen. Maintenance of Configurations in the Plane
    205 -- 222Deborah Joseph, Paul Young. Independence Results in Computer Science?
    223 -- 253Hartmut Ehrig, Bernd Mahr. Complexity of Algebraic Implementations for Abstract Data Types
    254 -- 278Nancy A. Lynch. Upper Bounds for Static Resource Allocation in a Distributed System
    279 -- 298Albert R. Meyer, Rohit Parikh. Definability in Dynamic Logic

    Volume 23, Issue 1

    1 -- 10Hermann A. Maurer, Arto Salomaa, Derick Wood. Completeness of Context-Free Grammar Forms
    11 -- 21Gérard P. Huet. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm
    22 -- 37Katsuhiko Nakamura. Synchronous to Asynchronous Transformation of Polyautomata
    38 -- 48Arthur G. Werschulz. On Maximal Order for Local and Global Numerical Problems
    49 -- 68Ralph-Johan Back. On Correct Refinement of Programs
    69 -- 105Jean H. Gallier. Recursion-Closed Algebraic Theories
    106 -- 0Martin Tompa. Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits
    runs on