External Links

    Journal: SIGACT News

    Volume 16, Issue 4

    46 -- 47John C. Cherniavsky. NSF news
    48 -- 52Barbara Simons. Some thoughts on running a conference
    53 -- 55Severo M. Ornstein, Lucy A. Suchman. Reliability and responsibility
    56 -- 59Paul M. B. Vitányi, Lambert G. L. T. Meertens. Big omega versus the wild functions
    60 -- 62Jacques Morgenstern. How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen

    Volume 16, Issue 3

    48 -- 0Charles B. Dunham. A sequence of uncomputable functions
    49 -- 53Andrei Broder, Jorge Stolfi. Pessimal algorithms and simplexity analysis

    Volume 16, Issue 2

    36 -- 49David S. Johnson. The genealogy of theoretical computer science: a preliminary report
    50 -- 56Nicola Santoro. Sense of direction, topological awareness and communication complexity
    57 -- 62. Abstracts

    Volume 16, Issue 1

    36 -- 0Barbara Simons. The reentry Computer Science Program at U.C. Berkeley
    37 -- 0W. Richard Stark. Combinatory automaton
    48 -- 56. Abstracts
    59 -- 0Jonathan S. Turner. On the general graph embedding problem with applications to circuit layout
    60 -- 0S. Louis Hakimi, Oded Kariv. Midwest theory of computation symposium: on a generalization of edge-coloring in graphs
    61 -- 0Ronald V. Book. Relativizations of complexity classes
    62 -- 0John Franco. Duality, finite improvement and efficiently solved optimization problems
    63 -- 64Eitan M. Gurari, Ten-Hwang Lai. Deadlock detection in communicating finite state machines
    runs on