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
Volume 40,
Number 3,
September 2009
Regular features
- William I. Gasarch:
The book review column.
21-24
- William I. Gasarch:
Review of the mathematical coloring book: mathematics of coloring and the colorful life of its creators by Alexander Soifer.
24-31
- William I. Gasarch:
Joint review of Professor Stewart's cabinet of mathematical curiosities by Ian Stewart and Five minute mathematics by Ehrhard Behrends and Aha gotcha!-aha insight! by Martin Gardner and Origami, eleusis, and the soma cube by Martin Gardner and Hexaexagons, probability paradoxes, and the tower of Hanoi by Martin Gardner and Group theory in the bedroom and other mathematical diversions by Brian Hayes.
32-37
- Miklós Bóna:
Review of Combinatorics and graph theory: (second edition) by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff.
37-39
- Miklós Bóna:
Review of Algorithmic combinatorics on partial words by Francine Blanchet-Sadri.
39-41
- Adel El-Atawy:
Review of An introduction to difference equations: third edition by Saber Elaydi.
42-46
- Miklós Bóna:
Review of Random graphs: (second edition) by Béla Bollobás.
46-48
- Eowyn Cenek:
Chases and escapes by Paul J. Nahin.
48-50
- Dean Kelley:
Technical report column.
51-52
Other contributions
Technical columns
- Lane A. Hemaspaandra:
SIGACT news complexity theory column 64.
60-76
- Idit Keidar:
ACM SIGACT news distributed computing column 35: theory and practice in large distributed systems.
77
- Lidong Zhou:
Building reliable large-scale distributed systems: when theory meets practice.
78-85
- Marek Chrobak:
SIGACT news online algorithms column 14.
86-98
Volume 40,
Number 4,
December 2009
Regular features
- William I. Gasarch:
The book review column.
8-10
- George Hacken:
Quantum computation and quantum communication: theory and experiments Author of book: Mladen Pavicic.
10-14
- S. C. Coutinho:
Quantum computing for computer scientists Noson S. Yanofsky and Mirco A. Mannucci, Cambridge University Press, 2008.
14-17
- Brad G. Kyer:
Review of 5 of biologically inspired algorithms for financial modelling by Anthony Brabazon, Michael O'Neill Springer-Verlag Berlin Heidelberg, 2006.
17-23
- Maulik A. Dave:
Review 17 of theoretical and experimental DNA computation by M. Amos Published in 2005 by Springer-Verlag Berlin Heidelberg.
23-35
- Maulik A. Dave:
Review 17 of theoretical and experimental DNA computation by M. Amos Published in 2005 by Springer-Verlag Berlin Heidelberg.
35-36
- Fatima Talib:
Review of 18 coding for data and computer communications by David Salomon Springer, 2005.
36-41
- Dean Kelley:
Technical report column.
42-44
Technical columns
Online Algorithms
Last update Mon Feb 13 04:56:22 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
