External Links

    Journal: SIGACT News

    Volume 15, Issue 4

    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

    Volume 15, Issue 3

    24 -- 35Leona F. Fass. Learning context-free languages from their structured sentences
    36 -- 44D. John Cooke. On non-hierachical systems of binary operators
    45 -- 71Irène Guessarian. Survey on classes of interpretations and some of their applications
    72 -- 95. Abstracts and available technical reports

    Volume 15, Issue 2

    32 -- 44Irène Guessarian, Francesco Parisi-Presicce. Iterative vs. regular factor algebras
    45 -- 52Alistair Moffat. The effect of paged memory upon algorithm performance: short note
    53 -- 57Cristian Calude. On a class of independent problems related to Rice theorem
    58 -- 62Stanley Coren. The game of academe
    63 -- 74. Abstracts
    76 -- 0Dan R. Olsen, Norman Badler. An expression model for graphical command languages
    77 -- 0Nicholas V. Findler, Robert F. Cromp. An artificial intelligence technique to generate self-optimizing experimental designs
    78 -- 0Nicholas V. Findler, Ron Lo. A note on the functional estimation of values of hidden variables: an extended module for expert systems

    Volume 15, Issue 1

    18 -- 19Hamid R. Amirazizi, Martin E. Hellman. Time-memory-processor tradeoffs
    20 -- 22Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri. Compact knapsacks are polynomially solvable
    23 -- 27Manuel Blum 0001. Coin flipping by telephone a protocol for solving impossible problems
    28 -- 33Gilles Brassard. An optimally secure relativized cryptosystem
    34 -- 39Shimon Even. A protocol for signing contracts
    40 -- 44Martin E. Hellman, Ehud D. Karnin, Justin M. Reyneri. On the necessity of cryptanalytic exhaustive search
    45 -- 49Ernst Henze. The solution of a general equation for the public key system
    50 -- 55Tore Herlestam. On the feasibility of computing discrete logarithms using Adleman's subexponential algorithm
    56 -- 60Ingemar Ingemarsson. Are all injective knapsacks partly solvable after multiplication modulo q?
    61 -- 66John P. Jordan. A variant of a public key cryptosystem based on Goppa Codes
    67 -- 77Don R. Morrison. Subtractive encryptors: alternatives to the DES
    78 -- 88Stephen Wiesner. Conjugate coding
    93 -- 104. Abstracts computing research laboratory
    runs on