External Links

    Journal: SIGACT News

    Volume 31, Issue 4

    3 -- 4William I. Gasarch. The Book Review Column
    4 -- 10William I. Gasarch. Reviews of THREE books on Fair Division of Resources
    10 -- 12Hassan Masum. Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf
    15 -- 18E. W. Cenek. Review of: Modern Graph Theory by Béla Bollobás
    18 -- 24Vladik Kreinovich. Review of A=B:::5::: by Marko Petkovsek, Herbert S. Wilf, and Doron Zeilberger
    27 -- 0Joel I. Seiferas. Reprints from ::::Computing Reviews::::
    37 -- 38Dana Richards. NSF Report: Theory of Computing Program
    39 -- 51Christian Glaßer, Lane A. Hemaspaandra. A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions
    52 -- 61Sergio Rajsbaum. Principles of distributed computing: an exciting challenge
    65 -- 73Rocky Ross. Going Backwards: Introductory Programming LAnguages
    118 -- 120Ian Parberry. Report on the 6th international meeting on DNA-based computers
    121 -- 124Lila Kari. Half century of automata theory
    130 -- 133Fabrizio Luccio, Linda Pagli. Death of a monster

    Volume 31, Issue 3

    2 -- 6Jeffrey Scott Vitter. ACM SIGACT 1999-2000 annual report
    10 -- 0William I. Gasarch. The Book Review Column
    19 -- 22Judy Goldsmith. Book review: Theory of Computing: A Gentle Introduction by Kinber and Smith (Prentice-Hall, 2001)
    22 -- 24Hassan Masum. Book review: Microsurveys in Discrete Probability edited by David Aldous and James Propp. (AMS 1998)
    24 -- 26Paliath Narendran. Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages)
    27 -- 28Joel I. Seiferas. Reprints from Computing Reviews
    37 -- 42Lane A. Hemaspaandra, Christian Glaßer. A moment of perfect clarity I: the parallel census technique
    43 -- 46Georg Gottlob. Report on PODS 2000
    50 -- 53Rocky Ross. International efforts in computer science education
    86 -- 95Gregory C. Harfst, Edward M. Reingold. A potential-based amortized analysis of the union-find data structure

    Volume 31, Issue 2

    2 -- 5Danny Krizanc. Book review: Gems of Theoretical Computer Science by Uwe Schöning and Randall Pruim (Springer-Verlag, 1998)
    2 -- 0William I. Gasarch. The Book Review Column
    5 -- 9Boris Goldengorin. Book review: Network Design: Connectivity and Facilities Location. Proceedings from DIMACS workshop in April-1997 (AMS 1998)
    9 -- 11William I. Gasarch. Book review: Indiscrete Thoughts by Gina-Carlo Rota (Birkhauser, 1996)
    12 -- 13Joel I. Seiferas. Reprints from Computing Reviews
    22 -- 33Ulrich Hertrampf. Algebraic acceptance mechanisms for polynomial time machines
    34 -- 38Rocky Ross. Education forum
    60 -- 61Eric Allender. Report on the annual summer meeting of the New Zealand mathematics research institute
    69 -- 0Charles B. Dunham. Partially Wrong Completions

    Volume 31, Issue 1

    1 -- 0Ian Parberry. Editor s Letter
    2 -- 3William I. Gasarch. The Book Review Column
    3 -- 0Maurice Herlihy. Review of Distributed Computing by Attiya and Welch
    4 -- 0Randall Pruim. Review of Hilbert s Tenth Problem by Yttri Matiyasevich
    8 -- 13Christopher League. Lambda Calculi: A Guide for Computer Scientists by Chris Hankin
    12 -- 13Carl Smith. Review of Systems that Learn (second edition) by Jain, Osherson, Royer, Sharma
    14 -- 15David J. Haglin. Technical Report Column
    16 -- 27Madhu Sudan. List decoding: algorithms and applications
    31 -- 42Martin Hofmann. Programming languages capturing complexity classes
    43 -- 48Rocky Ross. Education Forum
    75 -- 76Jouni Järvinen, Tomi Pasanen. Two exercises
    77 -- 86Ian Parberry. How to present a paper in theoretical computer science: a speaker s guide for students
    runs on