External Links

    Journal: SIGACT News

    Volume 5, Issue 4

    9 -- 11Louise H. Jones. Microprogramming: an opportunity for SIGACT
    11 -- 14David B. Benson. An alternate proof of Aho & Ullman's LR(k) viable prefix theorem
    15 -- 16Arnold L. Rosenberg. On the time required to recognize properties of graphs: a problem

    Volume 5, Issue 3

    19 -- 25Larry J. Stockmeyer. Planar 3-colorability is polynomial complete
    26 -- 29John Lind, Albert R. Meyer. A characterization of log-space computable functions
    29 -- 30Gabriele Ricci. Some further comments about nothing
    31 -- 32. Recent technical reports

    Volume 5, Issue 2

    17 -- 20M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson. A note on disjunctive form tautologies
    21 -- 23Gregory J. Chaitin. Some philosophical implications of information-theoretic computational complexity
    24 -- 25. Some abstracts from The Computer Science Conference
    26 -- 27. Recent technical reports

    Volume 5, Issue 1

    14 -- 17David B. Benson. Another comment on the null word definition problem
    21 -- 24. Recent technical reports
    runs on