External Links

    Journal: SIGACT News

    Volume 14, Issue 4

    38 -- 57Whitfield Diffie. Cryptographic technology: fifteen year forecast
    58 -- 69Dino Mandrioli. On teaching theoretical foundations of Computer Science
    70 -- 71John C. Cherniavsky. Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and Warren D. Goldfarb. Addison-Wesley 1979
    72 -- 83. Research advance abstracts

    Volume 14, Issue 3

    21 -- 22Lawrence H. Landweber. CSNET: a tool for researchers in theoretical computer science
    23 -- 29Don-Min Tsou, Patrick C. Fischer. Decomposition of a relation scheme into Boyce-Codd Normal Form
    30 -- 0Etienne Grandjean. Number of universal quantifiers and computational complexity: preliminary report
    31 -- 35Siroos K. Afshar. On the complexity of permutation network design
    36 -- 53Dino Mandrioli. On teaching theoretical foundations of computer science

    Volume 14, Issue 2

    20 -- 41. Technical reports

    Volume 14, Issue 1

    18 -- 20Uwe Schöning. On NP-decomposable sets
    21 -- 35Karel Culík. Theory of computation on abstract/concrete computer automata
    36 -- 37Donald F. Stanat, Stephen F. Weiss. A pumping theorem for regular languages
    38 -- 43Timothy R. S. Walsh. The busy beaver on a one-way infinite tape
    44 -- 65. Recent technical reports
    runs on