External Links

    Journal: J. Comput. Syst. Sci.

    Volume 13, Issue 3

    246 -- 277C. Raymond Perrault. Intercalation Lemmas for Tree Transducer Languages
    278 -- 285Leslie G. Valiant. Graph-Theoretic Properties in computational Complexity
    286 -- 299Alfred V. Aho, Jeffrey D. Ullman. Node Listings for Reducible Flow Graphs
    300 -- 317Gary L. Miller. Riemann s Hypothesis and Tests for Primality
    318 -- 334Harry B. Hunt III, Thomas G. Szymanski. Complexity Metatheorems for Context-Free Grammar Problems
    335 -- 379Kellogg S. Booth, George S. Lueker. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms

    Volume 13, Issue 2

    119 -- 135Robert M. Baer, Jan van Leeuwen. The Halting Problem for Linear Turing Assemblers
    136 -- 142Serafino Amoroso, Irving J. Epstein. Indecomposable Parallel Maps in Tessellation Structures
    143 -- 152Yukio Shibata. On the Structure of Abelian Automata
    153 -- 160Oscar H. Ibarra, Chul E. Kim. A Useful Device for Showing the Solvability of Some Decision Problems
    161 -- 171Akihiro Nozaki. Hazard Analysis of Asynchronous Circuits in Muller-Bartky s Sense
    172 -- 183Richard Laing. Automaton Introspection
    184 -- 199Arnold Schönhage, Mike Paterson, Nicholas Pippenger. Finding the Median
    200 -- 212Stephen L. Bloom. Varieties of Ordered Algebras
    213 -- 222Steve F. McCormick. Some Convergence Results on the Method of Gradients for Ax = lambda Bx
    223 -- 244André Arnold, Max Dauchet. Un Théorème de Duplication pour les Forêts Algébriques

    Volume 13, Issue 1

    1 -- 24James L. Peterson. Computation Sequence Sets
    25 -- 37Stephen A. Cook, Ravi Sethi. Storage Requirements for Deterministic Polynomial Time Recognizable Languages
    38 -- 50Kenichi Taniguchi, Tadao Kasami. A Result on the Equivalence Problem for Deterministic Pushdown Automata
    51 -- 68Patrick C. Fischer, Edward L. Robertson, Lawrence V. Saxton. On the Sequential Nature of Functions
    69 -- 73David P. Dobkin. A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems
    74 -- 89Yoshifumi Masunaga, Shoichi Noguchi, Juro Oizumi. A Characterization of Automata and a Direct Product Decomposition
    90 -- 99Grzegorz Rozenberg, Arto Salomaa. Context-Free Grammars with Graph-Controlled Tables
    100 -- 118Nancy A. Lynch. Complexity-Class-Encoding Sets
    runs on