Volume 40,
Number 1,
March 2009
Regular features
- William I. Gasarch:
The book review column.
8-10
- William I. Gasarch:
Review of blown to bits: your life, liberty, and happiness after the digital explosion by Hal Abelson, Ken Ledeen, and Harry Lewis (Addison Wesley, 2008).
10-13
- S. C. Coutinho:
Review of solving polynomial equation systems II: Macaulay's paradigm and Gröbner technology by Teo Mora (Cambridge University Press 2005).
14-17
- Brent Smith:
Review of how to prove it: a structured approach by Daniel J. Velleman (Cambridge University Press, 2006).
18-20
- Brian Borchers:
Review of practical optimization: algorithms and engineering applications by Andreas Antoniou and Wu-Sheng Lu (Springer Verlag, 2007).
20-22
- William I. Gasarch:
Review of rock, paper, scissors: game theory for everyday life by Len Fisher (Basic Books, 2008).
22-23
- Dean Kelley:
Technical report column.
24-25
Technical columns
- Lane A. Hemaspaandra:
SIGACT news complexity theory column 62.
26
- Emanuele Viola:
Guest Column: correlation bounds for polynomials over {0 1}.
27-44
- Idit Keidar:
ACM SIGACT news distributed computing column 33: teaching concurrency.
45-46
- Danny Hendler:
Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006).
47-50
- Alan Fekete:
Teaching about threading: where and what?
51-57
- Leslie Lamport:
Teaching concurrency.
58-62
Volume 40,
Number 2,
June 2009
Regular features
- William I. Gasarch:
The book review column.
10-13
- Kyriakos N. Sgarbas:
Review of how to think about algorithms by Je Edmonds (Cambridge University Press, 2008).
13-17
- Dean Kelley:
Review of a programmer's companion to algorithm analysis by Ernst Leiss (Chapman & Hall/CRC, 2007).
18-22
- Dean Kelley:
Joint review of algorithms by Richard Johnsonbaugh and Marcus Schaefer (Pearson/Prentice-Hall, 004) and algorithms by Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani (McGraw-Hill, 008).
23-25
- Marios Mavronicolas:
Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer).
25-27
- Jakub Marecek:
Review of theoretical aspects of local search by Wil P. A. J. Michiels, Emile H. L. Aarts, and Jan H. M. Korst (Springer in the EATCS Series Monographs in Theoretical Computer Science, 007).
27-30
- William M. Springer II:
Review of the traveling salesman problem: a computational study by Applegate, Bixby, Chvátal, and Cook (Princeton University Press).
30-32
- Alice M. Dean:
Review of visibility algorithms in the plane by Subir Kumar Ghosh (Cambridge University Press, 2007).
33-35
- Elisa Schae:
Review of a course on the web graph by Anthony Bonato (American Mathematical Society, Providence, Rhode Island, USA).
35-37
- Brittany Terese Fasy, David L. Millman:
Review of higher arithmetic: an algorithmic introduction to number theory by H. M. Edwards (American Mathematical Society Student Mathematical Library Vol. 45 (2008).
38-41
- Dean Kelley:
Technical report column.
42-44
- R. Demontis:
A simple NP-hard problem.
45-48
Technical columns
Copyright © Tue Nov 24 20:51:54 2009
by Michael Ley (ley@uni-trier.de)
