Journal: SIGACT News

Volume 27, Issue 4

3 -- 7Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich. The future of computational complexity theory: part II
8 -- 10Richard Hull. Report on PODS 96
11 -- 0Samir Khuller. Open Problems 14
15 -- 19Rockford J. Ross. Education forum: loops and induction proofs
38 -- 45Susan H. Rodger. Report on The First International Workshop on Implementing Automata 1996
52 -- 61Steven S. Seiden. Theoretical computer science cheat sheet
62 -- 65Ian Parberry. Paul Erdos (1913-1996)

Volume 27, Issue 3

6 -- 12Christos H. Papadimitriou, Oded Goldreich, Avi Wigderson, Alexander A. Razborov, Michael Sipser. The future of computational complexity theory: part I
13 -- 24Gilles Brassard, Claude Crépeau. 25 years of quantum cryptography
50 -- 54Cynthia Dwork. Distributed computing column
69 -- 70Rocky Ross. Education forum: retrospective
89 -- 0Leonid A. Levin. Fundamentals of computing (a cheatlist)
125 -- 0David S. Johnson. A Brief History of SIGACT News and its Editors
126 -- 0Stephen A. Fenner, Lance Fortnow, William I. Gasarch. Complexity Theory Newsflash

Volume 27, Issue 2

5 -- 6Michael Luby. SICACT Treasurer s Report
18 -- 19Joseph O Rourke. Computational geometry column 28
20 -- 29Judy Goldsmith, Matthew A. Levy, Martin Mundhenk. Limited nondeterminism
30 -- 44Stéphane Grumbach, Leonid Libkin, Tova Milo, Limsoon Wong. Query languages for bags: expressive power and complexity
38 -- 44Mark Allen Weiss. Journal Backlog Report
45 -- 46Michael C. Loui. Reprints from Computing Reviews
58 -- 64Rocky Ross. Education Forum: Making Theory Come Alive
87 -- 0David S. Johnson. How to do experiments (extended advertisement)
88 -- 96William I. Gasarch, Wayne Kelly, William Pugh. Finding the ith largest of n for small i, n

Volume 27, Issue 1

14 -- 15Michael C. Loui. Reprint from Computing Reviews
16 -- 23Mark Allen Weiss. Technical Report Column
24 -- 27Rocky Ross. Education Forum: Java...H o t Java!: What is that Brewing on the Web?
27 -- 29Michael Sipser. Introduction to the Theory of Computation
89 -- 90Harry Buhrman. A short note on Shor s factoring algorithm