1. Vol 39, No 3, 2008. 39-3.ps, 39-3.pdf
   1. Combinatorial Optimization: Packing and Covering by Gérard Cornuéjols. Review by Brian Borchers.

   2. Ordered Sets: An Introduction by Bernd S. W. Schröder. Review by Radim Belohlavek.

   3. A Joint review of
      1. General Lattice Theory (Second Edition) by George Grätzer.
      2. The congruences of a finite lattice: a proof-by picture approach Also by George Grätzer.
      Reviews by Jonathan A. Cohen.

   4. Applied Combinatorics on Words by M. Lothaire. Review by Maulik Dave.

   5. Computation engineering: applied automata theory and logic by Ganesh Lalitha Gopalakrishnan. Review by S. C. Coutinho.

2. Vol 39, No 2, 2008. 39-2.ps, 39-2.pdf
   1. The Art of Computer Programming Volume 4, Fascicles 2, 3, and 4 by Donald Knuth. Review by John Rogers.

   2. A Course in Computational Algebraic Number Theory By Henri Cohen. Review by Timothy Kelley.

   3. Foundations of Computer Security by David Salomon. Review by Richard Jankowski.

   4. Derivation and Computation: taking the Curry-Howard correspondence seriously by Harold Simmons. Review by Robert J. Irwin.

   5. Theoretical and Experimental DNA Computation. by M. Amos. Review by Maulik Dave.

3. Vol 39, No 1, 2008 39-1.ps, 39-1.pdf
   1. Cryptography in C and C++ by Michael Welschenbach. Review by S Terai.

   2. A Beginner's Guide to Discrete Mathematics by W.D. Wallis. Review by James V. Rauff.

   3. Handbook of Elliptic and Hyperelliptic Curve Cryptography Edited by H. Cohen and G. Frey. Review by Larry Washington.

   4. The Game's Afoot: Game Theory in Myth and Paradox by Alexander Mehlmann. Review by Danny Krizanc, 2008.

   5. A joint reivew of
      1. Introducing Game Theory and Its Applications by Eliott Mendelson, and
      2. Game Theory and Strategy by by Philip D. Straffin.
      The joint review is by William M. Springer II.

   6. Semantic Integration of Heterogeneous Software Specifications by Martin Grobe-Rhode. Review by Maulik A Dave.

4. Vol 38, No 4, 2007 38-4.ps, 38-4.pdf
   1. The Access Principle by John Willinsky. Review by Scott Aaronson.

   2. A Century of Scientific Publishing: A collection of essays Edited by Fredriksson. Review by William Gasarch.

   3. Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky. Review by Frederic Green.

   4. Research Problems in Discrete Geometry by Brass, Moser, Pach. Review by William Gasarch.

5. Vol 38, No 3, 2007 38-3.ps, 38-3.pdf
   1. The Political Mapping of Cyberspace by Jeremy W. Crampton.

   2. Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal.

   3. Computational Techniques of the Simplex Method by István Maros.

6. Vol 38, No 2, 2007 38-2.ps, 38-2.pdf
   1. Symbolic Asymptotics by John R. Shackell.

   2. Complexity and Crypotgraphy. An Introduction by John Talbot and Dominic Welsh.

   3. Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe.

   4. Three Complexity Blogs. Three Complexity Blogs are reviewed. The blogs are by Lance Fortnow, Scott Aaronson, and Luca Trevisan.

7. Vol 38, No1, 2007 38-1.ps, 38-1.pdf
   1. Excellence Without a Soul: How a Great University Forgot Education by Harry Lewis.

   2. Joint review of the following books on Quantum computing. The reivew is by Ronald de Wolf.
      1. An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger.

      2. Quantum Computing by Mika Hirvensalo.

      3. Classical and Quantum Computation by A. Yu. Kitaev, A. Shen, and M. N. Vyalyi.

   3. Introduction to Lattices and Order by B.A. Davey, H.A. Priestley.

   4. Computational Techniques for the Summation of Series by Anthony Sofo.

8. Vol 37, No 4, 2006 37-4.ps, 37-4.pdf
   1. Types and Programming Languages by Benjamin C. Pierce.

   2. Information Theory, Inference, and Learning Algorithms by Maulik Dave.

   3. Verification of Reactive Systems : Formal Methods and Algorithms by Klaus Schneider.

   4. Algorithmic Learning in a Random World by Vovk, Gammerman, and Shafer.

   5. The Random Projection Method by Santosh Vempala.

9. Vol 37, No 3, 2006 37-3.ps, 37-3.pdf

   1. A joint review of the following math fiction. Review by Bill Gasarch

   2. 1. Reality Conditions: Short Mathematical Fiction by Alex Kasman.
      2. Numb3rs TV show.
      3. Mathematical Apocrphia: Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz
      4. Mathematical Apocrphia Redux: Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz
   3. A joint review of the following books on particular numbers. Review by Brian Blank.
      1. A History of Pi by Petr Beckmann.
      2. The Joy of Pi by David Blatner.
      3. The Nothing That Is by Robert Kaplan.
      4. e: The Story of a Number by Eli Maor.
      5. The story of $i$: An Imaginary Tale by Paul Nahin.
      6. Zero: The Biography of a Dangerous Idea by Charles Seife.

   4. The Square Root of 2: A Dialouge Concerning a Number and a Sequence by David Flannery.

10. Vol 37, No 2, 2006 37-2.ps, 37-2.pdf

11. 1. Fair Division and Collective Welfare by Hervé Moulin. Reviewed by Varsha Dani.

    2. Algorithms: Sequential, Parallel, and Distributed by Kenneth A. Berman and Jerome L. Paul. Reviewed by William Schmeister.

    3. Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen, and M. Amiu Shokrollahi. Reviewed by Anthony Widjaja.

12. Vol 37, No 1, 2006 37-1.ps, 37-1.pdf
    1. A Computational Introduction to Number Theory and Algebra by Victor Shoup. Reviewed by Jonathan Katz.
    2. Primality Testing in Polynomial Time by Martin Dietzfelbinger. Reviewed by Jonathan Katz.
    3. Introduction to Coding Theory by Juerjen Bierbrauer.
    4. Codes: The Guide to Secrecy from Ancient to Modern Times by Richard A. Mollin. Reviewed by Adam Bender.
    5. Computational Complexity: a Quantitative Perspective by Marius Zimand. Reviewed Carlos A.S. Oliveira.
    6. Secure Communicating Systems : Design, analysis, and implementation by Michael R A Huth. Reviewed by Maulik A. Dave.
    7. Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman. Reviewed by Pierre Lescanne.

13. Vol 36, No 4, 2005 36-4.ps, 36-4.pdf
    1. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenge Edited by Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch. Reviewed by Maulik A. Dave.
    2. Genomic Perl: From Bioinformatics Basics to Working Code by Rex A. Dwyer. Review by Raymond Wan.
    3. Graphs, Networks, and Algorithms by Dieter Jungnickel. Review by William Fahle.
    4. Immunocomputing: Principles and Applications by Alexander O. Tarakanov, Victor A. Skormin, Svetlana P. Sokolova. Reviewed by Wenzhong Zhao.
    5. Term Rewriting Systems by Terese. Reviewed by Frederic Loulergue.

14. Vol 36, No 3, 2005 36-3.ps, 36-3.pdf
    1. Classical and Quantum Computing with C++ and Java Simulations by Hardy and Steeb.
    2. Integer Programming by Wolsey.
    3. Computational Line Geometry by Pottmann and Wallner.
    4. Logic for Computer Scientists by Schoning.
    5. Teaching Statistics using Baseball by Glenn.
15. 36-2.ps, 36-2.pdf
    1. Cryptological Mathematics by Robert Lewand.
    2. Data Privacy and Security by David Salomon.
    3. Cryptography: An Introduction by V.V. Yaschenko.
    4. Cryptanalysis of Number Theoretic Ciphers by Samuel Wagstaff.
    5. RSA and Public-Key Cryptography by R.A. Mollin.
    6. Foundations of Cryptography, Vol 1: Basic Tools by Oded Goldreich.
16. Vol 36, No 1, 2005 36-1.ps, 36-1.pdf
    1. Proofs that Really Count: The Art of Combinatorial Proof by J. Arthur Benjamin and Jennifer Quinn.
    2. Types and Programming Languages by Benjamin C. Pierce.
    3. Introduction To Natural Computation by Dana H. Ballard
    4. Mathematical Methods in Artificial Intelligence by Edward A. Bender.

17. Vol 35, No 4, 2004 35-4.ps, 35-4.pdf
    1. Boolean Functions and Computation Models by Clote and Kranakis.
    2. Selected Papers in Discrete Mathematics by D. Knuth.
    3. Linear Optimization and Extensions - Problems and Solutions by Dimitris Alevas and Manfred Padberg.
    4. Introduction to the Design and Analysis of Algorithms By Ananay Levitin.

18. Vol 35, No 3, 2004 35-3.ps, 35-3.pdf
    1. Handbook of Graph Theory Edited by Gross and Yellen.
    2. Reasoning about Uncertainty by Joseph Y. Halpern.
    3. Learning Kernel Classifiers: Theory and Algorithms by Ralf Herbrich, and Learning with Kernels: Support Vector Machines, Regularization Optimization and Beyond by Bernhard Schölkopf and Alexander J. Smola.
    4. Essentials of Constraint Programming by T. Frühwirth and S. Abdennadher

19. Vol 35, No 2, 2004 35-2.ps, 35-2.pdf
    1. Concurrent and Real-time Systems: The CSP Approach by Steve Schneider.
    2. Introduction to Languages, Machines and Logic: Computable Languages, Abstract Machines and Formal Logic by Alan P. Parkes.
    3. Algorithm Design: Foundations, Analysis and Internet Examples by Michael T. Goodrich and Roberto Tamassia.
    4. Theory of Semi-Feasible Algorithms by Lane Hemaspaandra and Leen Torenvliet.

20. Vol 35, No 1, 2004 35-1.ps, 35-1.pdf
    1. The Classical Decision Problem by Egon Börger, Erich Grädel and Yuri Gurevich. item Automata theory and its applications by Bakhadyr Khoussainov and Anil Nerode.
    2. Automata, Logics, and Infinite Games edited by Erich Grädel, Wolfgang Thomas, and Thomas Wilke.
    3. Automatic sequences: Theory, Applications, Generalizations by Jean-Paul Allouche and Jeffrey Shallit.

21. Vol 34, No 4, 2003 34-4.ps, 34-4.pdf
    1. Introduction to Cryptography by Johannes A. Buchmann.
    2. Coding Theory and Cryptography: The Essentials, Second Edition by Hankerson, Hoffman, Leonard, Lindner, Phelps, Rodger, Wall.
    3. Cryptography: Theory and Practice by Douglas R. Stinson.
    4. Foundations of Cryptography: Basic Tools by O. Goldreich
    5. Modelling and Analysis of Security Protocols by P. Ryan and S. Schneider
    6. Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatorics, Vol 17) by Oded Goldreich.

22. Vol 34, No 3, 2003 34-3.ps, 34-3.pdf
    1. Set Theory For Computing: From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo and Alberto Policriti.
    2. Theory of Computational Complexity by Ding-Zhu Du and Ker-I Ko.
    3. Computer Arithmetic Algorithms: A Review by Israel Koren.
    4. An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger.

23. Vol 34, No 2, 2003 34-2.ps, 34-2.pdf
    1. Algorithms Sequential & Parallel: A Unified Approach by R. Miller & L. Boxer.
    2. Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approxim ation, and Heuristics by Juraj Hromkovic.
    3. Modal and Temporal Properties of Processes by Colin Stirling.
    4. Modal Logic by Patrick Blackburn, Maarten de Rijke, and Yde Venema.

24. Vol 34, No 1, 2003 34-1.ps, 34-1.pdf
    1. Number Theory for Computing by Song Y. Yan.
    2. Type-Logical Semantics by B. Carpenter.
    3. The $\pi$-calculus: A Theory of Mobile Processes by D. Sangiorgi and D. Walker.

25. Vol 33, No 4, 2002 33-4.ps, 33-4.pdf
    1. Bioinformatics: The Machine Learning Approach by Pierre Baldi and Soren Brunak.
    2. The Clausal Theory of Types by D. A. Wolfram (Not to be confused with Stephen Wolfram.)
    3. Discrete Math Problems with Med. Apps. (DIMACS Vol. 55) Ed by Du, Pardalos, Wang.
    4. Things a Computer Scientist Rarely Talks About by Donald E. Knuth.
    5. A New Kind of Science by Stephen Wolfram.

26. Vol 33, No 3, 2002 33-3.ps, 33-3.pdf
    1. Modern Computer Algebra by Joachim von zur Gathen and Jürgen Gerhard.
    2. The Discrepancy Method --Randomness and Complexity by Bernard Chazelle.
    3. Computability and Complexity Theory by Steven Homer and Alan L. Selman.
    4. The Complexity Theory Companion by Lane A. Hemaspaandra and Mitsunori Ogihara.
    5. Mathematical Theory of Domains by Stoltenberg-Hansen, Lindström, Griffor.

27. Vol 33, No 2, 2002 33-2.ps, 33-2.pdf
    1. Model Checking by Clarke, Grumberg, and Peled.
    2. Petri Net Algebra by Best, Devillers, Koutny.
    3. Combinatorial Optimization - Theory and Algorithms by Korte and Vygen.
    4. Introduction to Distributed Algorithms by Tel.
    5. Calculated Bets by Skiena.

28. Vol 33, No. 1, 2002 33-1.ps, 33-1.pdf
    1. Algorithmic Geometry by Boissonat and Yvinec.
    2. Branching Programs and Binary Decision Diagrams: Theory and App by Wegener.
    3. Networks in Distributed Computing (DIMACS). ed. by Mavronicolas, Merritt, Shavit.
    4. Graph Theory and Its Applications by Gross, Yellen.
    5. Graph Theory by Tutte.
    6. Data Refinement: Model-Oriented Proof Methods and Their Comparison by de Roever, Engelhardt.
    7. Response to book review of Proofs and Refutations by Lakatos.

29. Vol 32, No. 4, 2001 32-4.ps, 32-4.pdf
    1. Proofs and Confirmations by David Bressoud
    2. Proofs and Refutations by Imre Lakatos
    3. Dynamic Logic by Harel, Kozen, Tiuryn.
    4. Analysis of Algorithms:An Active Learning Approach by McConnell.

30. Vol 32, No 3, 2001 32-3.ps, 32-3.pdf
    1. Automata and Languages: Theory and Applications by Meduna.
    2. External Memory Algorithms (DIMACS) ed. by Abello, Vitter.
    3. Control flow semantics by de Bakker, de Vink.
    4. Pi- Unleashed by Arndt and Haenel.
    5. Chaotic elections by Saari
    6. Math and politics by Taylor

31. Vol 32, No 2, 2001 32-2.ps, 32-2.pdf
    1. The Codebreakers: The story of secret writing by Kahn
    2. The Code Book: The Evolution of Secrecy from Mary Queen of Scots to Quantum Cryptography by Singh
    3. DNA Based Computers V (DIMACS) ed. by Gifford.
    4. Basic Proof Theory by Troelstra, Schwichtenberg,
    5. Complexity and Real Computation by L. Blum, Cucker, Shub, Smale,
32. Vol 32, No. 1, 2001 32-1.ps, 32-1.pdf
    1. Data Structures and Algorithms in Java (2nd ed) by Goodrich, Tamassia.
    2. Selected Papers on Analysis of Algorithms by Knuth.
    3. How to Solve It: Modern Heuristics by Michalewicz, B Fogel.
    4. Proof, Language, and Interaction: Essays in Honour of Robin Milner ed. by Plotkin, Stirling and Tofte

33. Vol 31, No. 4, 2000 31-4.ps, 31-4.pdf
    1. Fair Division: From Cake Cutting to Dispute Resolution by Brams and Taylor,
    2. Cake Cutting: Be Fair if You Can by Robertson and Webb,
    3. The Win-Win solution by Brams and Taylor,
    4. Fair Allocation (Proc. of Sym in App. Math, Vol 33) edited by Young.
    5. Comp Geom: Algorithms & Applications (2nd Ed) by de Berg, van Kreveld, Overmars, Schwarzkopf.
    6. Parameterized Complexity by Downey and Fellows.
    7. Modern Graph Theory by Bollobás.
    8. A=B by Petkovšek, Wilf, Zeilberger.
    9. Communicating and mobile systems: the $\pi$-calculus by Milnor.

34. Vol 31, No. 3, 2000 31-3.ps, 31-3.pdf
    1. Descriptive Complexity Theory by Immerman,
    2. Finite Model Theory by Ebbinhaus, Flum,
    3. Descriptive Complexity and Finite Models (DIMACS) ed. by Immerman, Kolaitis.
    4. Theory of Computing: A Gentle Introduction by Kinber, Smith.
    5. Microsurveys in Discrete Probability (DIMACS) ed. by Aldous, Propp.
    6. Term Rewriting and all that by Baader, Nipkow.

35. Vol 31, No. 2, 2000 31-2.ps, 31-2.pdf
    1. Gems of Theoretical Computer Science by Schönig, Pruim.
    2. Network Design: Connectivity and Facilities Location (DIMACS) ed. by Pardalos, Du.
    3. The Opt. Implementation of Functional Programming Languages by Asperti, Guerrini.
    4. Indiscrete Thoughts by Rota.

36. Vol 31, No. 1, 2000 31-1.ps, 31-1.pdf
    1. Distributed Computing by Attiya and Welch,
    2. Hilbert's Tenth Problem , by Matiyasevich.
    3. Lambda Calculi: A Guide for Computer Scientists by Hankin.
    4. Systems that Learn (second edition) by Jain, Osherson, Royer, Sharma.

37. Vol 30, No. 4, 1999 30-4.ps, 30-4.pdf
    1. Mathematical Support for Molecular Biology (DIMACS) edited by Farach-Colton, Roberts
    2. DNA Based Computers II (DIMACS) ed. by Landweber, Baum.
    3. DNA Based Computers III (DIMACS) ed. by Rubin, Wood
    4. Online Computation and Competitive Analysis by Borodin, El-Yaniv

38. Vol 30, No. 3, 1999 30-3.ps, 30-3.pdf
    1. Computational geometry in C (Second Edition) by O'Rourke.
    2. Bounded Queries in Recursion Theory by Gasarch, Martin.
    3. Logic For Applications by Nerode and Shore

39. Vol 30, No. 2, 1999 30-2.ps, 30-2.pdf
    1. Algorithms and Theory of Computation Handbook edited by Atallah.
    2. Handbook of Combinatorics (in two Volumes) edited by Graham, Grötschel, Lovász.
    3. Probabilistic Combinatorics and Its Applications, ed. by Bollobás.
    4. Spectral Graph Theory by Chung.

40. Vol 30, No. 1, 2000 30-1.ps, 30-1.pdf
    1. Stable Marriage and its Relation to Other Comb Problems: An Intro to Algorithm Anal by Knuth.
    2. The Limits of Mathematics by Chaitin.
    3. Privacy on the Line by Diffie and Landau.
    4. A Theory of Objects by Authors: Abadi, Cardelli.

41. Vol 29, No. 4, 1998. 29-4.ps, 29-4.pdf
    1. Cryptology and Computational Number Theory by Carl Pomerance
    2. Theories of Computability by Pippenger
    3. Vicious Circles by Barwise, Moss.

42. Vol 29, No 3, 1998. 29-3.ps, 29-3.pdf
    1. Algs on strings, trees, and sequences: comp sci and comp bio by Gusfield
    2. Verification of Seq. and Conc. Programs by Apt, Olderog
    3. Algorithms and Programming: Problems and Solutions by Shen.

43. Vol 29, No. 2 1998. 29-2.ps, 29-2.pdf
    1. Approximation Algorithms for NP-hard Problems ed. by Hochbaum
    2. Selected papers in computer science by Knuth.
    3. Communication Complexity by Kushilevitz and Nisan

44. Vol 29 No. 1 1998 29-1.ps, 29-1.pdf
    1. Complexity Theory Retrospective II ed. by Hemaspaandra, Selman.
    2. Basic Simple Type Theory by Hindley
    3. Discrete Mathematics in the Schools ed. by Rosenstein, Frazblau, Roberts.

45. Vol 28 No. 4 1997 28-4.ps, 28-4.pdf
    1. Metamathematics, Machines, and Godel's Proof by Shankar.
    2. Reasoning About Knowledge by Fagin, Halpern, Moses, Moshe
    3. Isoms. of Types: from $\lambda$-calc. to info. ret. & lang. design by Di Cosmo

46. Vol 28 No. 3, 1997 28-3.ps, 28-3.pdf

    An intro. to Kolg. Comp by Vitanyi, Li.