External Links

    Journal: SIGACT News

    Volume 29, Issue 4

    2 -- 4William I. Gasarch. The Book Review Column
    5 -- 10Sanjay Gupta. Book Review: Theories of Computability by Nicholas Pippenger (Cambridge University Press 1997)
    10 -- 14Alexander Dekhtyar. Book Review: Vicious Circles by Jon Barwise and Lawrence Moss (Cambridge University Press 1996)
    15 -- 16Joel I. Seiferas. Reprints from Computing Reviews
    20 -- 27Lane A. Hemaspaandra, Alan L. Selman. Writing and editing complexity theory: tales and tools
    28 -- 38Dan Suciu. An overview of semistructured data
    39 -- 50Peter W. O Hearn. Polymorphism, objects and abstract types
    51 -- 57Rocky Ross. Education forum: Web Enhanced Textbooks
    58 -- 62John E. Savage. A new approach to the first theory course
    90 -- 97Pierluigi Crescenzi, Viggo Kann. How to find the best approximation results
    98 -- 110Alexander E. Kostin, Svetlana A. Tchoudaikina. Yet another reachability algorithm for Petri nets

    Volume 29, Issue 3

    10 -- 22Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses
    23 -- 26Jan Paredaens. Database theory column: report on PODs 98
    27 -- 32Pankaj K. Agarwal, Joseph O Rourke. Computational geometry
    33 -- 42Dennis M. Volpano, Geoffrey Smith. Confinement properties for programming languages
    43 -- 0William I. Gasarch. The Book Review Column
    46 -- 48Anish Arora. Book Review: Verification of Sequential and Concurrent Programs by Krzysztof R. Apt and Ernst-Riidiger Olderog (Springer-Verlag New York, 1997)
    48 -- 52Jerry James. Book Review: Algorithms and Programming: Problems and Solutions by Alexander Shen (Birkhauser Boston, 1997)
    53 -- 54Joel I. Seiferas. Reprints from Computing Reviews
    56 -- 57Rocky Ross. Graduate degrees on the Web
    59 -- 61Andy Huang. Computation of the Knuth-Morris-Pratt skip tables
    62 -- 78Harry R. Lewis, Christos H. Papadimitriou. Elements of the Theory of Computation
    92 -- 93Luc Longpré. Report on COMPLEXITY 1998
    104 -- 111Avrim Blum, Prabhakar Raghavan. On a theory of computing symposia

    Volume 29, Issue 2

    9 -- 13Lane A. Hemaspaandra. Take-home complexity
    14 -- 20Joseph O Rourke. Computational geometry column 33
    17 -- 0William I. Gasarch. The Book Review Column
    17 -- 20Randeep Bhatia, Yoram J. Sussmann. Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997)
    21 -- 26Samir Khuller. Book review: Selected Papers on Computer Science by Donald E. Knuth
    27 -- 28Joel I. Seiferas. Reprints from Computing Reviews
    30 -- 32Rakesh K. Sinha. Technical report column
    33 -- 41Rocky Ross. Mathematics on the Web
    42 -- 49Mark Allen Weiss. Data structures and problem solving using Java
    50 -- 57Ian Parberry. Everything you wanted to know about the running time of Mergesort but were afraid to ask

    Volume 29, Issue 1

    2 -- 0William I. Gasarch. The Book Review Column
    5 -- 8Brian Postow. Book Review: Basic Simple Type Theory by J. Roger Hindley (Cambridge University Press 1997)
    8 -- 12Neal Koblitz. Book Review: Discrete Mathematics in the Schools. Ed. by Joseph G. Rosenstein, Deborah S. Franzblau, and Fred S. Roberts (American Mathematical Society)
    13 -- 14Joel I. Seiferas. Reprints from computing reviews
    15 -- 17Samir Khuller. Open problems: 16
    21 -- 31Rocky Ross. EDUCATION FORUM: Reflections on Turning Fifty
    32 -- 35Kirk Pruhs. How to design dynamic programming algorithms sans recursion
    runs on