Journal: SIGACT News

Volume 23, Issue 4

77 -- 80Jeffrey Shallit. Randomized algorithms in "primitive" cultures or what is the oracle complexity of a dead chicken?
83 -- 94Paul Young. How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions

Volume 23, Issue 3

30 -- 0Tom Jacob, Bill Kaizer. Book review: A Unifying Framework for Structured Analysis and Design Models, By T. H. Tse, (Cambridge University Press, 1991, xi+179pp, ISBN 0-521-39196-2)
31 -- 32Sajal K. Das. Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
33 -- 0Rocky Ross. Education forum
98 -- 99B. Litow.
100 -- 106Bryant A. Julstrom. A bound on the shift function in terms of the Busy Beaver function
107 -- 117Paul Young. How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions

Volume 23, Issue 2

26 -- 28Joseph O'Rourke. Computational geometry
29 -- 37Patrick Lincoln. Linear logic
50 -- 53Rocky Ross. Education Forum
67 -- 71John T. Stasko. Animating algorithms with XTANGO
72 -- 75Fabrizio Luccio, Linda Pagli. The p-shovelers problem: (computing with time-varying data)
104 -- 0Zvi Galil. Renato Capocelli

Volume 23, Issue 1

14 -- 17Francine Berman. CRA status of women column
18 -- 19Rocky Ross. Education Forum
35 -- 36Joseph O'Rourke. Book Review: Intersection and Decomposition Algorithms for Planar Arrangements, by Pankaj K. Agarwal. (Cambridge University Press, Cambridge, 1991 . xvii+277 pp . $39.50 cloth. ISBN 0-521-40446-0)
37 -- 43M. A. McBeth. The Turing machine of Ackermann's function
44 -- 46Oded Goldreich 0001. Critique of some trends in the TCS community in light of two controversies
47 -- 48Varol Akman. Undaunted sets (extended abstract)