dblp: SIGACT News, Volume 25, 1994

Oded Goldreich: A taxonomy of proof systems (part 2). 22-30

Joseph O'Rourke: Computational geometry. 31-33

Lance Fortnow, Stuart A. Kurtz, Duke Whang: The infinite version of an open communication complexity problem is independent of the axioms of set theory. 87-89

Armando B. Matos: An introduction to ultimately periodic sets of integers. 90-96

Lane A. Hemaspaandra: Complexity theory column 5: the not-ready-for-prime-time conjectures. 5-10

Yuri Gurevich: Logic activities in Europe. 11-24

Jean-Pierre Jouannaud: Book Review: A Proof Theory for General Unification. By Wayne Snyder. (Birkhauser, 1991. vi+175 pages. ISBN 0-8176-3593-9. $28.00). 25

Frank 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). 26-27

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: How hard are n2-hard problems? 83-85

Rajeev Raman: A simpler analysis of algorithm 65 (find). 86-89

Antônio Carlos da Rocha Costa, Vanderlei Moraes Rodrigues: Inspecting continuations. 90-91

Derek Denny-Brown, Yenjo Han, Lane A. Hemaspaandra, Leen Torenvliet: Semi-membership algorithms: some recent advances. 12-23

Joseph O'Rourke: Computational geometry column 23. 24-27

William 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.). 28-32

Rocky Ross: EDUCATION FORUM: Project Impact: : NSF-Funded Science Education Projects. 49-52

H. Petersen: Two-way one-counter automata accepting bounded languages. 102-105

Kenneth W. Regan, Jie Wang: The quasilinear isomorphism challenge. 106-113

Alejandro López-Ortiz: Linear pattern matching of repeated substrings. 114-121

Michael T. Hallett, Todd Wareham: A compendium of parameterized complexity results. 122-123

James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman: Wide area technical report service - technical reports online. 124-127

Lane A. Hemaspaandra: Teaching Computational Complexity: Resources to Treasure. 2-11

Joseph O'Rourke: Computational Geometry Column 24. 12-14

Gilles Brassard: Quantum computing: the end of classical cryptography? 15-21

Paris C. Kanellakis: Database querying and constraint programming. 22-87

Rocky Ross: Education Forum: The Dynalab Animation System. 49-54

Thomas Zeugmann: Report on COLT 1994. 88-95

Ian Parberry: A form for referees in theoretical computer science. 96-102

In memoriam Eugene L. Lawler. 108-109

SIGACT News, Volume 25, 1994

Volume 25, Number 1, March 1994

Volume 25, Number 2, June 1994

Volume 25, Number 3, September 1994

Volume 25, Number 4, December 1994