External Links

    Journal: Theoretical Computer Science

    Volume 4, Issue 3

    237 -- 244Christos H. Papadimitriou. The Euclidean Traveling Salesman Problem is NP-Complete
    245 -- 276Matthew M. Geller, Michael A. Harrison. On LR::::(k):::: Grammars and Languages
    277 -- 299Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien. Complexity of Some Problems in Petri Nets
    301 -- 319Robert P. Daley. On the Inference of Optimal Descriptions
    321 -- 349Tmima Olshansky, Amir Pnueli. A Direct Algorithm for Checking Equivalence of LL::::(k):::: Grammars

    Volume 4, Issue 2

    125 -- 135George Markowsky. Categories of Chain-Complete Posets
    137 -- 142Chiharu Hosono, Masahiko Sato. The Retracts in ::::P omega:::: do not Form a Continuous Lattice - A Solution to Scott s Problem
    143 -- 153Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. Economy of Description by Parsers, DPDA S, and PDA S
    155 -- 169Jean Françon. On the Analysis of Algorithms for Trees
    171 -- 197Hans-Georg Stork. On the Paging-Complexity of Periodic Arrangements
    199 -- 225Hermann A. Maurer, Thomas Ottmann, Arto Salomaa. On the Form Equivalence of ::::L::::-Forms
    227 -- 233Jeanne Ferrante, James R. Geiser. An Efficient Decision Procedure for the Theory of Rational Order
    235 -- 0Daniel J. Lehmann. A Note on Schnorr s Separatedness

    Volume 4, Issue 1

    1 -- 22Robin Milner. Fully Abstract Models of Typed ::::lambda::::-Calculi
    23 -- 46Zvi Galil. On the Complexity of Regular Resolution and the Davis-Putnam Procedure
    47 -- 57Marcel Paul Schützenberger. Sur une Variante des Fonctions Sequentielles
    59 -- 76Daniel J. Lehmann. Algebraic Structures for Transitive Closure
    77 -- 82Jean Vuillemin. Comment Verifier l Associativite d une Table de Groupe
    83 -- 98Matti Linna. A Decidability Result for Deterministic ::::omega::::-Context-Free Languages
    99 -- 119Toshiro Araki, Tadao Kasami. Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets
    123 -- 0Shimon Even, Robert Endre Tarjan. Corrigendum: Computing an ::::st::::-Numbering. TCS 2(1976):339-344
    runs on