External Links

    Journal: SIGACT News

    Volume 25, Issue 4

    2 -- 11Lane A. Hemaspaandra. Teaching Computational Complexity: Resources to Treasure
    15 -- 21Gilles Brassard. Quantum computing: the end of classical cryptography?
    22 -- 87Paris C. Kanellakis. Database querying and constraint programming
    49 -- 54Rocky Ross. Education Forum: The Dynalab Animation System
    88 -- 95Thomas Zeugmann. Report on COLT 1994
    96 -- 102Ian Parberry. A form for referees in theoretical computer science

    Volume 25, Issue 3

    12 -- 23Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet. Semi-membership algorithms: some recent advances
    24 -- 27Joseph O Rourke. Computational geometry column 23
    28 -- 32William I. Gasarch. Book Review: Finite Automata, Formal Logic, and Circuit Complexity. By Howard Straubing. (Birkhauser. 1994. xii+226pp. ISBN 0-8176-3719-2. 39.50.)
    49 -- 52Rocky Ross. EDUCATION FORUM: Project Impact: : NSF-Funded Science Education Projects
    102 -- 105H. Petersen. Two-way one-counter automata accepting bounded languages
    106 -- 113Kenneth W. Regan, Jie Wang. The quasilinear isomorphism challenge
    114 -- 121Alejandro López-Ortiz. Linear pattern matching of repeated substrings
    122 -- 123Michael T. Hallett, Todd Wareham. A compendium of parameterized complexity results
    124 -- 127James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman. Wide area technical report service - technical reports online

    Volume 25, Issue 2

    11 -- 24Yuri Gurevich. Logic activities in Europe
    26 -- 27Frank Vlach. Book Review: The Deductive Foundations of Computer Programming. By Zohar Manna and Richard Waldinger. (Addison-Wesley, 1993. xiv+717pp. ISBN 0-201-54886-0. 46.25)
    83 -- 85Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith. How hard are n2-hard problems?
    86 -- 89Rajeev Raman. A simpler analysis of algorithm 65 (find)
    90 -- 91Antônio Carlos da Rocha Costa, Vanderlei Moraes Rodrigues. Inspecting continuations

    Volume 25, Issue 1

    22 -- 30Oded Goldreich. A taxonomy of proof systems (part 2)
    87 -- 89Lance Fortnow, Stuart A. Kurtz, Duke Whang. The infinite version of an open communication complexity problem is independent of the axioms of set theory
    90 -- 96Armando B. Matos. An introduction to ultimately periodic sets of integers
    runs on