External Links

    Journal: SIGACT News

    Volume 20, Issue 4

    13 -- 0Gilles Brassard. Cryptology - column 2
    14 -- 16Cynthia Dwork. Distributed computing column
    17 -- 23Paris C. Kanellakis, Serge Abiteboul. Database Theory Column: Deciding Bounded Recursion in Database Logic Programs
    24 -- 0Samir Khuller. Open problems: 3
    25 -- 0D. T. Lee. NSF report - computer and computation research
    26 -- 29Michael C. Loui. Reprint from computing reviews
    31 -- 37Ian Parberry. The journal review column
    43 -- 47W. M. Farmer, A. J. Kfoury. Minutes of the 4th annual LICS business meeting
    48 -- 49Joan Feigenbaum. Report on DIMACS seminar series
    50 -- 53Irène Guessarian, D. Perrin. LITP: Laboratoire D Informatique theorique et programmation Paris Presentation of scientific activity
    74 -- 77M. Stallman. Course outline: course announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability
    78 -- 80Charles H. Bennett, Gilles Brassard. Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working]
    83 -- 86Marek Chrobak, Howard J. Karloff. A lower bound on the size of universal sets for planar graphs
    87 -- 91M. J. Fischer, R. P. Fischer, R. Beigel. Primitive recursion without implicit predecessor
    92 -- 99Ian Parberry. A guide for new referees in theoretical computer science

    Volume 20, Issue 3

    15 -- 19Gilles Brassard. Cryptology column
    25 -- 26Joseph O Rourke. Computational geometry column
    57 -- 59Joost Engelfriet. The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction
    60 -- 63Peter Salenieks, Michael G. Farringdon. How To Answer It

    Volume 20, Issue 1

    60 -- 61Lyle Ramshaw. Suitening our nomenclature
    62 -- 71Martin Tompa. Figures of merit
    runs on