Journal: SIGACT News

Volume 34, Issue 4

3 -- 13Donald E. Knuth. Robert W Floyd, In Memoriam
14 -- 15William I. Gasarch. The book review column
15 -- 17Andrew C. Lee. Review of Introduction to cryptography by Johannes A. Buchmann. Springer Verlag, 2001
17 -- 21Robert J. Irwin. Review of Coding theory and cryptography: the essentials, second edition, revised and expanded by D.R. Hankerson, et al. Marcel Dekker, 2000
22 -- 25William M. Springer II. Review of Cryptography: theory and practice, second edition by Douglas R. Stinson. CRC Press
32 -- 34Andrew C. Lee. Review of Modern cryptography, probabilistic proofs and pseudorandomness algorithms and combinatorics, vol 17 by Oded Goldreich. Springer Verlag, 1999
53 -- 56Sergio Rajsbaum. ACM SIGACT news distributed computing column 13
57 -- 67Ravi Kumar, Ronitt Rubinfeld. Algorithms column: sublinear time algorithms
78 -- 83Rocky Ross. Education forum

Volume 34, Issue 3

3 -- 4William I. Gasarch. The book review column
4 -- 11Robert J. Irwin. Review of Set theory for computing: from decision procedures to declarative programming with sets by Domenico Cantone, Eugenio Omodeo and Alberto Policriti. Springer-Verlag 2001
11 -- 12E. W. Cenek. Review of Theory of computational complexity by Ding-Zhu Du and Ker-I Ko. John Wiley & Sons
13 -- 15George A. Constantinides. Review of Computer arithmetic algorithms by Israel Koren. A.K. Peters
16 -- 18Andrea Marchini. Review of An introduction to quantum computing algorithms by Arthur O. Pittenger. Birkhäuser 2000
40 -- 61Sergio Rajsbaum. ACM SIGACT News distributed computing column 12
62 -- 67Rocky Ross. Education forum
68 -- 74Steven Skiena, Miguel A. Revilla. Programming challenges: the programming contest training manual
94 -- 103K. Alagarsamy. Some myths about famous mutual exclusion algorithms

Volume 34, Issue 2

2 -- 0William I. Gasarch. The book review column
3 -- 5Anthony Widjaja To. Review of Algorithms sequential & parallel: a unified approach by R. Miller & L. Boxer. Prentice Hall 2000
6 -- 8Hassan Masum. Review of Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics by Juraj Hromkovic. Springer 2001
8 -- 15Vicky Weissman. Review of Modal and temporal properties of processes by Colin Stirling. Springer Verlag 2001
15 -- 19P. Daniel Hestand. Review of Modal logic: Cambridge tracts in theoretical computer science #53 by Patrick Blackburn, Maarten de Rijke, and Yde Venema. Cambridge University Press 2001
27 -- 41Lane A. Hemaspaandra. SIGACT news complexity theory column 40
42 -- 57Sergio Rajsbaum. ACM SIGACT news distributed computing column 11
58 -- 60Joseph O Rourke. Computational geometry column 44
61 -- 68Josh Cogliati, Rocky Ross. Mathematics on the Web: part II
91 -- 94Bruce E. Litow. The Hamiltonian circuit problem and automaton theory

Volume 34, Issue 1

3 -- 0William I. Gasarch. The book review column
6 -- 17Riccardo Pucella, Stephen Chong. Review of type-logical semantics
32 -- 46Arfst Nickelsen, Till Tantau. Partial information classes
47 -- 67Romain Boichat, Partha Dutta, Svend Frølund, Rachid Guerraoui. Deconstructing paxos
68 -- 77Rocky Ross. Teaching (and research) squeezed