External Links

    Journal: SIGACT News

    Volume 9, Issue 4

    13 -- 14Harry R. Lewis. Review of "Mariages stables et leur relations avec d'autre problèmes combinatoires: introduction à l'analyze mathématique des algorithmes" by Donald E. Knuth. Les Presses de l'Université de Montréal
    14 -- 16Y. Nisselbaum. On merging N ordered elements with three elements
    17 -- 0Michael R. Garey, David S. Johnson. A note on "A note on 'Some simplified NP-complete graph problems'"
    18 -- 21R. K. Shyamasundar. A note on the transitive closure of a boolean matrix
    22 -- 23Howard P. Katseff. From the recursive function theory newsletter
    24 -- 28. Recent technical reports

    Volume 9, Issue 3

    20 -- 22Larry H. Reeker. Review of "Programs, machines, and computation: an introduction to the theory of computing" by K. L. Clark and D. F. Cowell
    23 -- 0Kellogg S. Booth. 7 log n) bit operations
    24 -- 0M. S. Krishnamoorthy. A note on "Some simplified NP-complete graph problems"
    25 -- 27Barry K. Rosen. Arcs in graphs are NOT pairs of nodes
    28 -- 32. Recent technical reports

    Volume 9, Issue 2

    17 -- 24Donald E. Knuth. The complexity of songs
    25 -- 29Leslie M. Goldschlager. The monotone and planar circuit value problems are log space complete for P
    30 -- 35Dianne E. Britton, Ralph B. McLaughlin, Richard J. Orgass. A note concerning intermittent assertions
    36 -- 0Larry Carter. A four-gadget
    37 -- 44. Recent technical reports

    Volume 9, Issue 1

    15 -- 0John C. Cherniavsky. Book review department
    16 -- 18Gabor T. Herman. Review of "Automata, languages, development" by A. Lindenmayer and G. Rozenberg. North Holland Publishing Co. 1976
    19 -- 34. Recent technical reports
    runs on