1. Vol 44, No 2, 2013 44-2.pdf
   1. Joint review of How to Solve It: A New Aspect of Mathematical Method by Polya and the new Street-Fighting Mathematics by Mahajan. Review by Mohsen Vakilian.
   2. Grammatical inference: learning automata and grammars by Colin de la Higuera. Review by Matthias Gallé.
   3. Logical Foundation of Proof Complexity by Stephen Cook and Phuong Nguyen. Review by Arthur MILCHIOR.
   4. Exact Exponential Algorithms by Fedor V. Fomin and Dieter Kratsch. Review by Michael Lampis.
   5. Bioinspired Computation in Combinatorial Optimization by Frank Neumann and Carsten Witt. Review by Sven Herrmann.
   6. Triangulations: Structure for Algorithms and Applications by Jesús A. De Lorea, Jörg Rambau, and Francisco Santos. Review by Michael Murphy.
   7. Flows in Networks by L. R. Ford Jr. and D. R. Fulkerson. Review by Yixin Cao.
   8. Quantum Computing - A Gentle Introduction by Eleanor Rieffel and Wolfgang Polak. Review by Kyriakos N. Sgarbas.
   9. The Art of Computer Programming: Volume 4A by Donald E. Knuth. Review by John D. Rogers.
   10. Boolean Function Complexity: Advances and Frontiers by Stasys Jukna. Review by William Gasarch.
2. Vol 44, No 1, 2013 44-1.pdf
   1. P, NP, and NP-Completeness by Oded Goldreich. Review by S.V.Nagaraj.
   2. Bijective Combinatorics by Nicholas Loehr. Review by Miklós Bóna.
   3. Surveillance or Security? By Susan Landau. Review by Tal Moran.
   4. Spyware and Adware by John Aycock. Review by Dave Werden
   5. Burdens of Proof by Jean-François Blanchette. Review by Harry Lewis.
   6. Boolean Models and Methods in Mathematics, Computer Science, and Engineering Edited by Yves Crama and Peter L. Hammer. Review by Marcin Kaminski.
   7. Algorithmic Randomness and Complexity by Downey and Hirschfeldt. Review by Jason Teutsch.
   8. Information Retrieval By Buettcher, Clarke, Cormack. Review by Paul Rubin.
   9. Models of Conflict and Cooperation by Rick Gillman and David Housman. Review by Mark C. Wilson.
   10. Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer. Review by Jonathan Katz.
   11. Introduction to Bio-Ontologies by Peter N. Robinson and Sebastian Bauer.
   12. The Dots and Boxes Game: Sophisticated Child's Play by Elwyn Berlekamp. Review by Omar Shehab.
3. Vol 43, No 4, 2012 43-4.pdf
   1. Algorithmic Cryptanalysis. By Antoine Joux.
   2. Algorithmic Bioprocesses. Edited by Condon, Harel, Kok, Salomaa, Winfree.
   3. Vehicular Networks, from Theory to Practice. Edited by Stephan Olariu and Michele C. Weigle.
   4. Graph Theory and Interconnection Networks. By Lih-Hsing Hsu and Cheng-Kuan Lin.
   5. Transitions and Trees: An Introduction to Structural Operational Semantics. By Hans Hüttel.
   6. Origins and Foundations of Computing. By Friedrich L. Bauer. Review by Haim Kilov.
   7. Introduction to Scheduling. Edited by Yves Robert and Frederic Vivien.
   8. Semantic Techniques in Quantum Computation. Edited by Simon Gay and Ian Mackie.
   9. Modern Computer Arithmetic. By Richard Brent and Paul Zimmermann.
4. Vol 43, No 3, 2012 43-3.pdf
   1. Combinatorial Games: Tic-Tac-Toe Theory by Jozsef Beck.
   2. Algorithmic Adventures: From Knowledge to Magic by Juraj Hromkovic.
   3. Applied Algebra: Codes, Ciphers and Discrete Algorithms by Darel W. Hardy, Fred Richman, and Carol L. Walker.
   4. Models of Computation - An Introduction to Computability Theory by Maribel Fernández.
   5. Handbook of weighted Automata Edited by Manfred Droste, Werner Kuich and Heiko Vogler.
   6. Matching Theory by László Lovász and Michael D. Plummer.
   7. Introduction to Mathematics of Satisfiability by Victor W. Marek.
   8. Elements of Automata Theory by Jacques Sakarovitch.
   9. Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R by Gabriel Valiente.
   10. In Pursuit of the Traveling Salesman by William J. Cook.
   11. Permutation Patterns Edited by Steve Linton, Nik Ruškuc, Vincent Vatter.
5. Vol 43, No 2, 2012 43-2.pdf
   1. A Concise Introduction to Data Compression by David Salomon.
   2. Parallel Algorithms by Henri Casanova, Arnaud Legrand, and Yves Robert.
   3. Polynomia And Related Realms by Dan Kalman.

   4. Biscuits of Number Theory Edited by Arthur T. Benjamin and Ezra Brown.

   5. Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures by János Pach and Micha Sharir.

   6. Handbook of Large-Scale Random Networks Edited by : Bela Bollobás, Robert Kozma and Deszo Miklós.
   7. Algorithms and Theory of Computation Handbook Edited by : Mikhail J. Atallah and Marina Blanton.
   8. Primality testing and integer factorization in public key cryptography by Song Y. Yan.
   9. Process Algebra: Equational Theories of Communicating Processes by J. C. M. Baeten, T. Basten, and M. A. Reniers.
   10. Insider Threats in Cyber Security Edited by Probst, Hunker, Gollman, and Bishop.
6. Vol 43, No. 1, 2012 43-1.pdf
   1. The Cryptoclub: Using Mathematics to Make and Break Secret Codes by Janet Beissinger and Vera Pless.
   2. Cryptanalytic Attacks on RSA by Song Y. Yan.
   3. Cryptanalysis of RSA and its variants by Jason Hinek.
   4. Understanding and Applying Cryptography and Data Security by Adam J. Elbirt
   5. Efficient Secure Two-Party Protocols: Techniques and Constructions by Carmit Hazay and Yehuda Lindell.
   6. Theory of Computation by Dexter C. Kozen.
   7. Codes: an introduction to information communication and cryptography by Normal L Biggs.
   8. Finite Fields and Applications by Gary L. Mullen and Carl Mummert
   9. The Life and Times of the Central Limit Theorem by William J. Adams.
   10. Pearls of Discrete Mathematics by Martin Erickson.
   11. Design Theory by C. C. Lindner and C. A. Rodger.
   12. An Introduction to the History of Algebra: Solving Equations from Mesopotamian Times to the Renaissance

7. Vol 42, No. 4, 2011 42-4.pdf
   1. Foundations of Logic and Mathematics: Applications to Computer Science and Cryptography by Yves Nievergelt.
   2. Rippling: Meta-Level Guidance For Mathematical Reasoning by Alan Bundy, David Basin, Dieter Hutter, and Andrew Ireland.
   3. Handbook of Nature-Inspired and Innovative Computing Edited by Albert Y. Zomaya.
   4. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders.
   5. The Algorithm Design Manual (Second Edition) By Steven S. Skiena. Reviewed by Neelakantan Kartha.
   6. Graph Theory: A Problem Oriented Approach by Daniel Marcus.
   7. Proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler.
   8. Handbook of Chemoinformatics Algorithms Edited by Faulon, Bender.
   9. Dynamic Fuzzy Logic and its Applications by Fanzhang.

8. Vol 42, No 3, 2011 42-3.pdf
   1. Erdos on Graphs: His Legacy of Unsolved Problems by Fan Chung and Ron Graham.
   2. Roots to Research by Judith D. Sally and Paul J. Sally, Jr.
   3. Chromatic Graph Theory by Gary Chartrand and Ping Zhang.
   4. Applied Combinatorics by Fred S. Roberts and Barry Tesman.
   5. Combinatorics, A Guided Tour by David R. Mazur.
   6. Famous Puzzles of Great Mathematicians by Miodrag S. Petkovi.
   7. Combinatorics - A Problem Oriented Approach by Daniel A. Marcus.
   8. Probability: Theory and Examples by Rick Durrett.
   9. Games, Puzzles, & Computation by Robert A. Hearn and Erik D. Demaine.

9. Vol 42, No. 2, 2011 42-2.pdf
   1. From Zero to Infinity: What Makes Numbers Interesting by Constance Reid.
   2. Mathematics for the Analysis of Algorithms by Daniel H. Greene and Donald E. Knuth.
   3. Algebraic Cryptanalysis by Gregory V. Bard.
   4. Algebraic Function Fields and Codes by Henning Stichtenoth.
   5. Those Fascinating Numbers by Jean-Marie De Konick.
   6. Polya Urn Models by Hosam Mahmoud.
   7. Not always buried deep: a second course in elementary number theory by Paul Pollack.
   8. Pioneering Women in American Mathematics: The Pre-1940 PhD's by Judy Green and Jeanne LaDuke.
   9. A Guide to Elementary Number Theory by Underwood Dudley.
   10. Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics by Dan A. Simovici and Chabane Djeraba.

10. Vol 42, No. 1, 2011 42-1.pdf
    1. Proceedings from the Gatherings for Gardner Conference. Edited by a variety of people.
    2. Comprehensive Mathematics for Computer Scientists 1 by Guerino B. Mazzola, Gerard Milmeister, Jody Weissmann.
    3. Creative Mathematics by H.S. Wall.
    4. Nonlinear Integer Programming by Duan Li and Xiaoling Sun.
    5. Complex Social Networks by Fernando Vega-Redondo.
    6. The Calculus of Computation:Decision Procedures with Applications to Verification by Aaron R. Bradley and Zohar Manna.
    7. Algorithms on Strings by Crochemore, Hanchart and Lecroq. Yiorgos Adamopoulos.
    8. A View from the Top:Analysis, Combinatorics and Number Theory by Alex Iosevich.
    9. Geometric Folding Algorithms by E.D. Demaine and J. O'Rourke.
    10. Geometric Algebra: An Algebraic System for Computer Games and Animation by Author: J. Vince.
    11. Dude, Can You Count? by Christian Constanda.

11. Vol 41, No. 4, 2010 41-4.pdf
    1. Joint review of Computational Complexity: A Conceptual Perspective by Oded Goldreich and Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak.
    2. Algorithmic Game Theory edited by Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani.
    3. The ${\rm P}={\rm NP}$ Question and Godel's Lost Letter by Richard J. Lipton.
    4. The Pea and the Sun: A Mathematical Paradox by Leonard Wapner.
    5. Coding for Data and Computer Communications by by David Salomon.
    6. Binary Quadratic Forms: An Algorithmic Approach by by Johannes Buchmann and Ulrich Vollmer.
    7. Elliptic Curves by Lawrence C. Washington.
    8. Concurrent Zero-Knowledge by Alon Rosen.
    9. Introduction to Cryptography by Hans Delfs and Helmut Knebl.
    10. Introduction to Modern Cryptography by Jonathan Katz and Yehuda Lindell.
    11. An Introduction to Mathematical Cryptography by Jeffrey Hoffstein, Jill Pipher, and Joseph Silverman.
    12. Software Abstractions: Logic, Language and Analysis by Daniel Jackson.

12. Vol 41, No. 3, 2010 41-3.pdf
    1. Random Curves: Journeys of a Mathematician by Neal Koblitz.
    2. Games of No Chance (1998, Edited by Richard Nowakowski), More Games of No Chance (2002, Edited by Richard Nowakowski), and Games of No Chance III (2009, Edited by Michael Albert and Richard Nowakowski.
    3. Mathematical Treks: From Surreal Numbers to Magic Circles by Ivars Peterson.
    4. Decisions and Elections: Explaining the Unexpected. by Donald G. Saari.
    5. The Mathematics of Voting and Elections: A Hands-On Approach by Jonathan K. Hodge and Richard E. Klima.
    6. Branching Programs and Binary Decision Diagrams: Theory and Applications by Ingo Wegener.
    7. Quantum Computer Science: An Introduction by N. David Mermin. Review of Eleanor Rieffel.
    8. Cryptographic Applications of Analytic Number Theory: Lower Bounds and Pseudorandomness by Igor Shparlinski.
    9. When Least is Best. How Mathematicians Discovered Many Clever Ways to Make Things as Small (or as Large) as Possible by Paul J. Nahin.
    10. The Space and Motion of Communicating Agents by Robin Milner.
13. Vol 41, No. 2, 2010 41-2.pdf
    1. Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics and defines the term and the field.
    2. Combinatorics The Rota Way by Joesph P.S. Kung, Gian-Carlo Rota and Catherine H. Yan.
    3. A Course in Enumeration by Martin Aigner.
    4. A Combinatorial Approach to Matrix Theory And Its Applications by Richard Brualdi and Dragos Cvetkovic.
    5. The Annotated Turing by Charles Petzoid.
    6. Logicomix Text by Apostolos Doxiadis and Christos Papadimitriou! Art by Alecos Papadatos and Annie di Donna (This is a Comic Book.)
    7. Proof and Other Dilemmas: Mathematics and Philosophy Edited by Bonnie Gold & Roger A. Simons.
    8. Essays in Constructive Mathematics by Harold Edwards.
    9. Is Mathematics Inevitable? A Miscellany Edited by Underwood Dudley.
    10. A Concise Introduction To Languages and Machines by Alan P. Parkes.
    11. A Second Course in Formal Languages and Automata Theory by Jeffrey Shallit.
    12. Automata Theory with Modern Applications by James A. Anderson.
    13. Change is Possible: Stories of Women and Minorities in Mathematics by Patricia Clark Kenschaft.
    14. Joint review of (1) Riot at the Calc Exam and other Mathematically Bent Stories by Colin Adams; (2) The Great $\pi$/e Debate: Which is the Best Number? by Colin Adams VS Thomas Garrity, Moderated by Edward Burger; (3) The United States of Mathematics: Presidential Debate by Colin Adams VS Thomas Garrity, moderated by Edward Burger
14. Vol 41, No. 1, 2010 41-1.pdf
    1. Data Structures and Algorithms Using Python and C++. by David M. Reed and John Zelle.
    2. An Introduction to Data Structures and Algorithms. by James A. Storer.
    3. Advanced Data Structures by Peter Brass.
    4. The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching by Donald Adjeroh, Timothy Bell and Amar Mukherjee.
    5. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis by Tamal K. Dey.
    6. Concentration of Measure for the Analysis of Randomized Algorithms by Devdatt P. Dubhashi and Alessandro Panconesi.
    7. The Modern Algebra of Information Retrieval by Sandor Dominich.
    8. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations by Y. Shoham and K. Leyton-Brown.
    9. The Political Mapping of Cyberspace by Jeremy W. Crampton.
    10. The Princeton Companion to Mathematics by Timothy Gowers, June Barrow-Green and Imre Leader.
    11. Computer Viruses and Malware by John Aycock.
    12. Formal Correctness of Security Protocols by Giampaolo Bella.
    13. Computability of Julia Sets by Mark Braverman and Michael Yampolsky. Review:by Wesley Calvert.

15. Vol 40, No. 4, 2009 40-4.pdf
    1. Quantum Computation and Quantum Communication: Theory and Experiments. by Mladen Pavicic.
    2. Quantum Computing for Computer Scientists by Noson S. Yanofsky and Mirco A. Mannucci.
    3. Biologically Inspired Algorithms for Financial Modelling . by Anthony Brabazon, Michael O'Neil.
    4. The Handbook of Bioinspired Algorithms and Applications Edited by Stephan Olariu and Albert Y. Zomaya.
    5. Theoretical and Experimental DNA Computation. By by M. Amos.
    6. Coding for Data and Computer Communications by by David Salomon.

16. Vol 40, No. 3, 2009. 40-3.ps, 40-3.pdf
    1. The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators by Alexander Soifer.
    2. A Joint review of the following six books: (1) Professor Stewart's Cabinet of Mathematical Curiosities by Ian Stewart, (2) Five Minute Mathematics by Ehrhard Behrends, (3) Aha Gotcha!- Aha Insight! by Martin Gardner, (4) Origami, Eleusis, and the Soma Cube by Martin Gardner, (5) Hexaflexagons, Probability Paradoxes, and The Tower of Hanoi by Martin Gardner, (6) Group Theory in the Bedroom and Other Mathematical Diversions by Brian Hayes.
    3. Combinatorics and Graph Theory by Harris, Hirst, Mossinghoff.
    4. Algorithmic Combinatorics on Partial Words by Francine Blanchet-Sadri.
    5. An Introduction to Difference Equations, Third Edition by Saber Elaydi.
    6. Random Graphs (Second Edition) by Béla Bollobás.
    7. Chases and Escapes by Paul J. Nahin.

17. Vol 40, No 2, 2009 40-2.pdf
    1. How to Think about Algorihtms by Jeff Edmonds.
    2. A Programmer's Companion to Algorithm Analysis by Ernst Leiss.
    3. Joint review of Algorithms by Johnonbaugh and Schaefer and Algorithms by Dasgupta, Papadimitriou, and U. Vazirani.
    4. Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. by Juraj Hromkovic.
    5. Theoretical Aspects of Local Search by Michiels, Aarts, and Korst.
    6. The Traveling Salesman Problem: A Computational Study by Applegate, Bixby, Chvátal, and Cook.
    7. Visibility Algorithms in the Plane by Ghosh.
    8. A Course on the Web Graph by Anthony Bonato.
    9. Higher Arithmetic by Edwards. and David L. Millman.

18. Vol 40, No 1, 2009 40-1.pdf
    1. Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion by Hal Abelson, Ken Ledeen, and Harry Lewis.
    2. Solving polynomial equation systems II:Macaulay 's paradigm and Gröbner technology by Teo Mora.
    3. How To Prove It: A Structured Approach by Daniel J. Velleman.
    4. Practical Optimization: Algorithms and Engineering Applications by Andreas Antoniou and Wu-Sheng Lu.
    5. Rock, Paper, Scissors: Game Theory for Everyday Life by Len Fisher.
19. Vol 39, No 4, 2008. 39-4.pdf
    1. Combinatorial Designs: Constructions and Analysis by Douglas R. Stinson.
    2. Combinatorics of Permutations by Miklós Bóna.
    3. Enumerative Combinatorics by Charalambos A. Charalambides.
    4. Geometric Algebra for Computer Science by L. Dorst, D. Fontijne, and S. Mann.
    5. Privacy on the Line: The Politics of Wiretapping and Encryption by Whitfield Diffie and Susan Landau.
20. Vol 39, No 3, 2008. 39-3.pdf
    1. Combinatorial Optimization: Packing and Covering by Gérard Cornuéjols.
    2. Ordered Sets: An Introduction by Bernd S. W. Schröder.
    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.
    4. Applied Combinatorics on Words by M. Lothaire.
    5. Computation engineering: applied automata theory and logic by Ganesh Lalitha Gopalakrishnan.

21. Vol 39, No 2, 2008. 39-2.pdf
    1. The Art of Computer Programming Volume 4, Fascicles 2, 3, and 4 by Donald Knuth.
    2. A Course in Computational Algebraic Number Theory By Henri Cohen.
    3. Foundations of Computer Security by David Salomon.
    4. Derivation and Computation: taking the Curry-Howard correspondence seriously by Harold Simmons.
    5. Theoretical and Experimental DNA Computation. by M. Amos.

22. Vol 39, No 1, 2008 39-1.ps, 39-1.pdf
    1. Cryptography in C and C++ by Michael Welschenbach.
    2. A Beginner's Guide to Discrete Mathematics by W.D. Wallis.
    3. Handbook of Elliptic and Hyperelliptic Curve Cryptography Edited by H. Cohen and G. Frey.
    4. The Game's Afoot: Game Theory in Myth and Paradox by Alexander Mehlmann.
    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.
    6. Semantic Integration of Heterogeneous Software Specifications by Martin Grobe-Rhode.
23. Vol 38, No 4, 2007 38-4.pdf
    1. The Access Principle by John Willinsky.
    2. A Century of Scientific Publishing: A collection of essays Edited by Fredriksson.
    3. Mathematics of Physics and Engineering by Edward K. Blum and Sergey V. Lototsky.
    4. Research Problems in Discrete Geometry by Brass, Moser, Pach.
24. Vol 38, No 3, 2007 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.
25. Vol 38, No 2, 2007 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.
26. Vol 38, No1, 2007 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.
       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.
27. Vol 37, No 4, 2006 37-4.pdf
    1. Types and Programming Languages by Benjamin C. Pierce.
    2. Information Theory, Inference, and Learning Algorithms by David J. C. MacKay.
    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.

28. Vol 37, No 3, 2006 37-3.pdf
    1. A joint review of the following math fiction.
       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
    2. A joint review of the following books on particular numbers.
       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.
    3. The Square Root of 2: A Dialouge Concerning a Number and a Sequence by David Flannery. Reviewed by Gasarch, Kruskal, Kruskal, and Kruskal.
29. Vol 37, No 2, 2006 37-2.pdf
    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.
30. Vol 37, No 1, 2006 37-1.ps, 37-1.pdf
    1. A Computational Introduction to Number Theory and Algebra by Victor Shoup.
    2. Primality Testing in Polynomial Time by Martin Dietzfelbinger.
    3. Introduction to Coding Theory by Juerjen Bierbrauer.
    4. Codes: The Guide to Secrecy from Ancient to Modern Times by Richard A. Mollin.
    5. Computational Complexity: a Quantitative Perspective by Marius Zimand.
    6. Secure Communicating Systems : Design, analysis, and implementation by Michael R A Huth.
    7. Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman.
31. 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.
    2. Genomic Perl: From Bioinformatics Basics to Working Code by Rex A. Dwyer.
    3. Graphs, Networks, and Algorithms by Dieter Jungnickel.
    4. Immunocomputing: Principles and Applications by Alexander O. Tarakanov, Victor A. Skormin, Svetlana P. Sokolova.
    5. Term Rewriting Systems by Terese. Reviewed by Frederic Loulergue.
32. Vol 36, No 3, 2005 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.
33. 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.
34. 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.
35. Vol 35, No 4, 2004 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.
36. Vol 35, No 3, 2004 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
37. Vol 35, No 2, 2004 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.
38. Vol 35, No 1, 2004 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.
39. Vol 34, No 4, 2003 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.

40. Vol 34, No 3, 2003 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.

41. Vol 34, No 2, 2003 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.

42. Vol 34, No 1, 2003 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.

43. Vol 33, No 4, 2002 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.
44. Vol 33, No 3, 2002 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.
45. Vol 33, No 2, 2002 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.
46. Vol 33, No. 1, 2002 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.
47. Vol 32, No. 4, 2001 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.
48. Vol 32, No 3, 2001 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
49. Vol 32, No 2, 2001 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,
50. Vol 32, No. 1, 2001 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
51. Vol 31, No. 4, 2000 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.
52. Vol 31, No. 3, 2000 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.
53. Vol 31, No. 2, 2000 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.
54. Vol 31, No. 1, 2000 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.
55. Vol 30, No. 4, 1999 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
56. Vol 30, No. 3, 1999 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
57. Vol 30, No. 2, 1999 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.
58. Vol 30, No. 1, 2000 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.
59. Vol 29, No. 4, 1998. 29-4.pdf
    1. Cryptology and Computational Number Theory by Carl Pomerance
    2. Theories of Computability by Pippenger
    3. Vicious Circles by Barwise, Moss.
60. Vol 29, No 3, 1998. 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.
61. Vol 29, No. 2 1998. 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
62. Vol 29 No. 1 1998 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.
63. Vol 28 No. 4 1997 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
64. Vol 28 No. 3, 1997 28-3.pdf An intro. to Kolg. Comp by Vitanyi, Li.