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
    runs on