next up previous
Next: About this document ...

  1. Vol 45, No 4. 45-4.pdf

    1. The Universal Computer. The road from Leibniz to Turing by Martin Davis. Review by Haim Kilov.
    2. From Zero to Infinity by Constance Reid. Review by John Tucker Bane.
    3. The LLL Algorithm Edited by Phong Nguyen and Brigitte Vallée. Review by Krishnan Narayanan.
    4. Classic Papers in Combinatorics Edited by Ira Gessel and Gian-Carlo Rota. Review by Arya Mazumdar.
    5. Mathematical Treks by Ivars Peterson. Review by John Tucker Bane.
    6. Six Sources of Collapse by Charles Hadlock. Review by Eowyn Cenek.
    7. Visions of Infinity: The Great Mathematical Problems by Ian Stewart. Review by Aravind Srinivasan.
    8. The Satisfiability Problem: Algorithms and Analyses by Uwe Schoning and Jacobo Toranns. Review by William Gasarch.
  2. Vol 45, No 3. 45-3.pdf
    1. Understanding Cryptography: A Textbook for Students and Practitioners by Christof Paar and Jan Pelzl. Review by Subhayan Roy Moulick.
    2. The Erdos Distance Problem by Julia Garibaldi, Alex Iosevich, Steven Senger. Review by William Gasarch.
    3. Clustering in Bioinformatics and Drug Design by John D. MacCuish and Norah E. MacCuish. Review by Mohsen Mahmoudi Aznaveh.
    4. The Block Cipher Companion by Lars R. Knudsen and Matthew J.B. Robshaw. Review by Jonathan Katz.
    5. Networked Life: 20 Questions and Answers by Mung Chiang. Review by Jonathan Katz.
    6. Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach by Bruno Courcelle and Joost Engelfriet. Review by Michaël Cadilhac.
    7. Basic Phylogenetic Combinatorics by Andreas Dress, Katharina T. Huber. Review by Kipper Fletez-Brant.
    8. Analytic Combinatorics in Several Variables by Robin Pemantle and Mark Wilson. Review by Miklós Bóna.
    9. The Tower of Hanoi - Myths and Maths by Andreas M. Hinz, Sandi Klavzar, Uroš Milutinovic, Ciril Petr. Review by László Kozma.
  3. Vol 45, No 2, 2014 45-2.pdf
    1. Selected Papers on Discrete Mathematics by Donald E. Knuth. Review by Daniel Apon.
    2. Selected Papers on Design of Algorithms by Donald E. Knuth. Review by Daniel Apon
    3. Selected Papers on Fun & Games by Donald E. Knuth. Review by William Gasarch.
    4. Companion to the Papers of Donald Knuth by Donald E. Knuth. Review by William Gasarch.
      • Horizons of Combinatorics (Conference on Combinatorics Edited by Ervin Györi, Gyula Katona, László Lovász.
      • Building Bridges (In honor of László Lovász's 60th birthday-Vol 1) Edited by Martin Grötschel and Gyula Katona.
      • Fete of Combinatorics and Computer Science (In honor of László Lovász's 60th birthday-Vol 2) Edited by Gyula Katona, Alexander Schrijver, and Tamás.
      • Erdos Centennial (In honor of Paul Erdos's 100th birthday) Edited by László Lovász, Imre Ruzsa, Vera Sós.
      Joint Review by William Gasarch (four books).
    5. Bayesian Reasoning and Machine Learning by David Barber Review by Matthias Gallé.
    6. Integrated Methods for Optimization by John Hooker. Review by S.V.Nagaraj.
    7. Programming with Higher-Order Logic by Dale Miller and Gopalan Nadathur. Review by Vaishak Belle.
    8. People, Problems, and Proofs by Richard Lipton and Ken Regan. Review by William Gasarch.
    9. Who's Bigger? Where Historical Figures Really Rank by Steven Skiena and Charles B. Ward. Review by Nicholas Mattei.
  4. Vol 45, No 1, 2014 45-1.pdf
    1. In Pursuit of the Unknown: 17 Equations That Changed the World by Ian Stewart. Review by Omar Shehab.
    2. Unauthorized Access: The Crisis in Online Privacy and Security by Robert H. Sloan and Richard Warner. Review by Harry Lewis
    3. Boolean Functions - Theory, Algorithms, and Applicationsby Yves Crama and Peter L. Hammer. Review by Haris Aziz.
    4. Additive Combinatorics by Terence Tao and Van H. Vu. Review by Raghunath Tewari.
    5. Discrete and Computational Geometry by by Satyan L. Devadoss and Joseph O'Rourke. Review by Brittany Terese Fasy and David L. Millman.
    6. Iterative Methods in Combinatorial Optimization by by Lap Chi Lau, R Ravi and Mohit Singh. Review by Yang D. Li.
    7. Perspectives on Projective Geometry by Jürgen Richter-Gebert. Review by S. C. Coutinho, 2012.
    8. Who's #1?: The Science of Ranking and Rating by Amy N. Langville and Carl D. Meyer. Review by Nicholas Mattei.
    9. Boosting : Foundations and Algorithms by Robert E. Schapire and Yoav Freund. Review by Shiva Kintali.
  5. Vol 44, No 4, 2013 44-4.pdf
      • The Honor Class: Hilbert's Problems and Their Solver by Ben Yandell.
      • Mathematical Developments arising from Hilbert's Problems edited by Felix Browder. (Note this book is from 1974).
      Joint Review by William Gasarch (three books).
    1. Variable-length Codes for Data Compression by David Salomon. Review by Farhan Nasim.
    2. History of Mathematics - Highways and Byways by Amy Dahan-Dalmedico and Jeanne Peiffer (Translated by Sanford Segal). Review by S.V.Nagaraj.
    3. Identity-Based Encryption by Sanjit Chattarjee and Palash Sarkar. Review by Jon Katz.
    4. Resources for Teaching Discrete Mathematics edited by Brian Hopkins. Review by Myriam Abramson.
    5. Proofs and Algorithms by Gilles Dowek (translation by Maribel Fernandez). Review by Michaël Cadilhac.
    6. Introduction to Computational Proteomics by Golan Yona. Review by Dimitris Papamichail.
    7. Computability and Complexity Theory by Steven Homer and Alan L. Selman. Review by Jeffrey Shallit.
    8. Quantum Computing Since Democritus by Scott Aaronson. Review by Frederic Green.
    9. Algorithmic Puzzles by Anany Levitin and Maria Levitin. Review by William Gasarch.
  6. Vol 44, No 3, 2013 44-3.pdf
    1. Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography by Juraj Hromkovic. Review by Richard Jankowski.
    2. The Mathematics of Life by Ian Stewart. Review by Aaron Sterling.
    3. Universal Semantic Communication by B. Juba. Review by Wesley Calvert.
    4. Graph Algorithms (2nd edition) by Shimon Even, edited by Guy Even. Review by Anthony Labarre.
    5. How to Fold It by J. O'Rourke. Review by Brittany Terese Fasy and David L. Millman.
    6. Bioinformatics for Biologists Edited by Pavel Pevzner and Ron Shamir. Review by Dimitris Papamichail.
    7. Extremal Combinatorics with Applications to Computer Science (2nd edition) by Stasys Jukna. Review by Miklós Bóna.
    8. Enumerative Combinatorics, Volume 1, Second Edition by Richard P. Stanley. Review by Angèle M. Hamel.
    9. Combinatorial Optimization by B. Korte and J. Vygen. Review by Akash Kumar.
    10. The Golden Ticket: P, NP, and the Search for the Impossible by Lance Fortnow. Review by Cynthia DiPaula and Andrew Wonnacott.
    11. Probably Approximately Correct by Leslie Valiant. Review by Joshua Brulé.
  7. Vol 44, No 2, 2013 44-2.pdf
      • How to Solve It: A New Aspect of Mathematical Method by Polya.
      • Street-Fighting Mathematics by Mahajan.
      Joint Review by Mohsen Vakilian (two books).
    1. Grammatical inference: learning automata and grammars by Colin de la Higuera. Review by Matthias Gallé.
    2. Logical Foundation of Proof Complexity by Stephen Cook and Phuong Nguyen. Review by Arthur MILCHIOR.
    3. Exact Exponential Algorithms by Fedor V. Fomin and Dieter Kratsch. Review by Michael Lampis.
    4. Bioinspired Computation in Combinatorial Optimization by Frank Neumann and Carsten Witt. Review by Sven Herrmann.
    5. Triangulations: Structure for Algorithms and Applications by Jesús A. De Lorea, Jörg Rambau, and Francisco Santos. Review by Michael Murphy.
    6. Flows in Networks by L. R. Ford Jr. and D. R. Fulkerson. Review by Yixin Cao.
    7. Quantum Computing - A Gentle Introduction by Eleanor Rieffel and Wolfgang Polak. Review by Kyriakos N. Sgarbas.
    8. The Art of Computer Programming: Volume 4A by Donald E. Knuth. Review by John D. Rogers.
    9. Boolean Function Complexity: Advances and Frontiers by Stasys Jukna. Review by William Gasarch.
  8. 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. Review by Mohsen Mahmoudi Aznaveh.
    12. The Dots and Boxes Game: Sophisticated Child's Play by Elwyn Berlekamp. Review by Omar Shehab.
  9. Vol 43, No 4, 2012 43-4.pdf
    1. Algorithmic Cryptanalysis. By Antoine Joux. Review by Alexandra Anzala-Yamajako.
    2. Algorithmic Bioprocesses. Edited by Condon, Harel, Kok, Salomaa, Winfree. Review by Aaron Sterling.
    3. Vehicular Networks, from Theory to Practice. Edited by Stephan Olariu and Michele C. Weigle. Review by Yu Wang.
    4. Graph Theory and Interconnection Networks. By Lih-Hsing Hsu and Cheng-Kuan Lin. Review by Francesco Silvestri.
    5. Transitions and Trees: An Introduction to Structural Operational Semantics. By Hans Hüttel. Review by Steven Falke.
    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. Review by Ben Fulton.
    8. Semantic Techniques in Quantum Computation. Edited by Simon Gay and Ian Mackie. Review by Kyriakos Sgarbars.
    9. Modern Computer Arithmetic. By Richard Brent and Paul Zimmermann. Review by Song Yan.
  10. Vol 43, No 3, 2012 43-3.pdf
    1. Combinatorial Games: Tic-Tac-Toe Theory by Jozsef Beck. Review by William Gasarch.
    2. Algorithmic Adventures: From Knowledge to Magic by Juraj Hromkovic. Review by Antonio E. Porreca.
    3. Applied Algebra: Codes, Ciphers and Discrete Algorithms by Darel W. Hardy, Fred Richman, and Carol L. Walker. Review by Yulai Xie.
    4. Models of Computation - An Introduction to Computability Theory by Maribel Fernández. Review by José de Oliveira Guimarães.
    5. Handbook of weighted Automata Edited by Manfred Droste, Werner Kuich and Heiko Vogler. Review by Michael Cadilhac
    6. Matching Theory by László Lovász and Michael D. Plummer. Review by Haris Aziz.
    7. Introduction to Mathematics of Satisfiability by Victor W. Marek. Review by Stephen Falke.
    8. Elements of Automata Theory by Jacques Sakarovitch. Review by Shiva Kintali.
    9. Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R by Gabriel Valiente. Review by Anthony Labarre.
    10. In Pursuit of the Traveling Salesman by William J. Cook. Review by Haris Aziz.
    11. Permutation Patterns Edited by Steve Linton, Nik Ruškuc, Vincent Vatter. Review by Karolina Soltys.
  11. Vol 43, No 2, 2012 43-2.pdf
    1. A Concise Introduction to Data Compression by David Salomon. Review by Ville Hautamaki (vishv@i2r.a-star.edu.sg)
    2. Parallel Algorithms by Henri Casanova, Arnaud Legrand, and Yves Robert. Review by Mihai Pop.
    3. Polynomia And Related Realms by Dan Kalman. Review by Akash Kumar.
    4. Biscuits of Number Theory Edited by Arthur T. Benjamin and Ezra Brown. Review by Jeffrey Shallit.
    5. Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures by János Pach and Micha Sharir. Review by Sergio Cabello.
    6. Handbook of Large-Scale Random Networks Edited by : Bela Bollobás, Robert Kozma and Deszo Miklós. Review by Gabriel Istrate.
    7. Algorithms and Theory of Computation Handbook Edited by : Mikhail J. Atallah and Marina Blanton. Review by Nick Papanikolaou.
    8. Primality testing and integer factorization in public key cryptography by Song Y. Yan. Review by S. C. Coutinho
    9. Process Algebra: Equational Theories of Communicating Processes by J. C. M. Baeten, T. Basten, and M. A. Reniers. Review by Wesley Calvert.
    10. Insider Threats in Cyber Security Edited by Probst, Hunker, Gollman, and Bishop. Review by Kim-Kwang Raymond Choo.
  12. 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. Review by Abu Mohammad Omar Shehab Uddin Ayub.
    2. Cryptanalytic Attacks on RSA by Song Y. Yan. Review by Leo Irakliotis.
    3. Cryptanalysis of RSA and its variants by Jason Hinek. Review by Antoine ROJAT.
    4. Understanding and Applying Cryptography and Data Security by Adam J. Elbirt Review by Jérémy Barbay.
    5. Efficient Secure Two-Party Protocols: Techniques and Constructions by Carmit Hazay and Yehuda Lindell. Review by Jonathan Katz.
    6. Theory of Computation by Dexter C. Kozen. Review by Daniel Apon.
    7. Codes: an introduction to information communication and cryptography by Normal L Biggs. Review by Robert J Low.
    8. Finite Fields and Applications by Gary L. Mullen and Carl Mummert Review by Jeffrey Shallit
    9. The Life and Times of the Central Limit Theorem by William J. Adams. Review by Miklós Bóna.
    10. Pearls of Discrete Mathematics by Martin Erickson. Review by Robert Szarka.
    11. Design Theory by C. C. Lindner and C. A. Rodger. Review by Dimitris Papamichail.
    12. An Introduction to the History of Algebra: Solving Equations from Mesopotamian Times to the Renaissance by Jacques Sesiano. Review by William Gasarch.
  13. Vol 42, No. 4, 2011
    1. Foundations of Logic and Mathematics: Applications to Computer Science and Cryptography by Yves Nievergelt. Review by Saif Terai.
    2. Rippling: Meta-Level Guidance For Mathematical Reasoning by Alan Bundy, David Basin, Dieter Hutter, and Andrew Ireland. Review by Maulik Dave.
    3. Handbook of Nature-Inspired and Innovative Computing Edited by Albert Y. Zomaya. Review by Aaron Sterling.
    4. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders. Review by Hal C. Elrod.
    5. The Algorithm Design Manual (Second Edition) By Steven S. Skiena. Review by Neelakantan Kartha.
    6. Graph Theory: A Problem Oriented Approach by Daniel Marcus. Review by Haris Aziz.
    7. Proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler. Review by Miklós Bóna.
    8. Handbook of Chemoinformatics Algorithms Edited by Faulon, Bender. Review by Aaron Sterling.
    9. Dynamic Fuzzy Logic and its Applications by Fanzhang. Review by Song Yan.
  14. Vol 42, No. 3, 2011
    1. Erdos on Graphs: His Legacy of Unsolved Problems by Fan Chung and Ron Graham. Review by Andy Parrish.
    2. Roots to Research by Judith D. Sally and Paul J. Sally, Jr. Review by Eowyn Cenek.
    3. Chromatic Graph Theory by Gary Chartrand and Ping Zhang. Review by Vance Faber.
    4. Applied Combinatorics by Fred S. Roberts and Barry Tesman. Review by Dimitris Papamichail, and Review by Miklós Bóna.
    5. Combinatorics, A Guided Tour by David R. Mazur. Review by Michaël Cadilhac.
    6. Famous Puzzles of Great Mathematicians by Miodrag Petkovi. Review by Lev Reyzin.
    7. Combinatorics - A Problem Oriented Approach by Daniel Marcus. Review by Myriam Abramson.
    8. Probability: Theory and Examples by Rick Durrett. Review by Miklós Bóna.
    9. Games, Puzzles, & Computation by Robert Hearn and Erik Demaine. Review by Daniel Apon.
  15. 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 Greene and Donald Knuth.
    3. Algebraic Cryptanalysis by Gregory 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 Simovici and Chabane Djeraba.
  16. Vol 42, No. 1, 2011 42-1.pdf
    1. Proceedings from the Gatherings for Gardner Conference. Edited by a variety of people. Review by William Gasarch.
    2. Comprehensive Mathematics for Computer Scientists 1 by Guerino Mazzola, Gerard Milmeister, Jody Weissmann. Review by Sage LaTorra.
    3. Creative Mathematics by H.S. Wall. Review by Jason Dyer.
    4. Nonlinear Integer Programming by Duan Li and Xiaoling Sun. Review by Justin Melvin.
    5. Complex Social Networks by Fernando Vega-Redondo. Review by Carl Kingsford.
    6. The Calculus of Computation:Decision Procedures with Applications to Verification by Aaron Bradley and Zohar Manna. Review by Carlo Furia.
    7. Algorithms on Strings by Crochemore, Hanchart and Lecroq. Review by Yiorgos Adamopoulos.
    8. A View from the Top:Analysis, Combinatorics and Number Theory by Alex Iosevich. Review by Yannis Haralambous.
    9. Geometric Folding Algorithms by Eric Demaine and Joseph O'Rourke. Review by Brittany Terese Fasy and David Millman.
    10. Geometric Algebra: An Algebraic System for Computer Games and Animation by Author: J. Vince. Review by Brittany Terese Fasy and David Millman.
    11. Dude, Can You Count? by Christian Constanda. Review by William Gasarch.
  17. Vol 41, No. 4, 2010 41-4.pdf
      • Computational Complexity: A Conceptual Perspective by Oded Goldreich and
      • Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak.
      Joint Review by Daniel Apon (two books).
    1. Algorithmic Game Theory A collection of articles on Algorithmic Game Theory edited by Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay Vazirani. Review by David Levin.
    2. The $P=NP$ Question and Godel's Lost Letter by Richard Lipton. Review by William Gasarch.
    3. The Pea and the Sun: A Mathematical Paradox by Leonard Wapner. Review by William Gasarch.
    4. Coding for Data and Computer Communications by by David Salomon. Review by David Werden.
    5. Binary Quadratic Forms: An Algorithmic Approach by by Johannes Buchmann and Ulrich Vollmer. Review by Graham Coleman.
    6. Elliptic Curves by Lawrence Washington. Review by David Chen.
    7. Concurrent Zero-Knowledge by Alon Rosen. Review by Sarvagya Upadhyay.
    8. Introduction to Cryptography by Hans Delfs and Helmut Knebl. Review by Cillian Murphy.
    9. Introduction to Modern Cryptography by Jonathan Katz and Yehuda Lindell. Review by Ben Fulton.
    10. An Introduction to Mathematical Cryptography by Jeffrey Hoffstein, Jill Pipher, and Joseph Silverman. Review by Sarah Meiklejohn.
    11. Software Abstractions: Logic, Language and Analysis by Daniel Jackson. Review by Andrew Lee.
  18. Vol 41, No. 3, 2010 41-3.pdf
    1. Random Curves: Journeys of a Mathematician by Neal Koblitz. Review by William Gasarch.
      • 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.
      Joint Review by William Gasarch (three books).
    2. Mathematical Treks: From Surreal Numbers to Magic Circles by Ivars Peterson. Review by William Gasarch.
    3. Decisions and Elections: Explaining the Unexpected. by Donald Saari. Review by David Pritchard.
    4. The Mathematics of Voting and Elections: A Hands-On Approach by Jonathan Hodge and Richard Klima. Review by Mark Wilson.
    5. Branching Programs and Binary Decision Diagrams: Theory and Applications by Ingo Wegener. Review by Samuel Johnson.
    6. Quantum Computer Science: An Introduction by N. David Mermin. Review by Eleanor Rieffel.
    7. Cryptographic Applications of Analytic Number Theory: Lower Bounds and Pseudorandomness by Igor Shparlinski. Review by Jeffrey Shallit.
    8. When Least is Best. How Mathematicians Discovered Many Clever Ways to Make Things as Small (or as Large) as Possible by Paul Nahin. Review by Yannis Haralambous.
    9. The Space and Motion of Communicating Agents by Robin Milner. Review by Nick Papanikolaou.
  19. Vol 41, No. 2, 2010 41-2.pdf
    1. Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick. Review by Miklós Bóna.
    2. Combinatorics The Rota Way by Joesph Kung, Gian-Carlo Rota and Catherine Yan. Review by John Mount.
    3. A Course in Enumeration by Martin Aigner. Review by Peter Boothe.
    4. A Combinatorial Approach to Matrix Theory And Its Applications by Richard Brualdi and Dragos Cvetkovic. Review by Miklós Bóna.
    5. The Annotated Turing by Charles Petzoid. Review by Kevin Wilson.
    6. Logicomix Text by Apostolos Doxiadis and Christos Papadimitriou! Art by Alecos Papadatos and Annie di Donna Review by William Gasarch! This is a comic book! Honest!
    7. Proof and Other Dilemmas: Mathematics and Philosophy Edited by Bonnie Gold & Roger Simons. Review by Christopher Pincock.
    8. Essays in Constructive Mathematics by Harold Edwards. Review by S. C. Coutinho.
    9. Is Mathematics Inevitable? A Miscellany Edited by Underwood Dudley. Review by José Guimarães, 2010.
    10. A Concise Introduction To Languages and Machines by Alan Parkes. Review by Mike Williams.
    11. A Second Course in Formal Languages and Automata Theory by Jeffrey Shallit. Review by Kevin Wilson.
    12. Automata Theory with Modern Applications by James Anderson. Review by Kyriakos Sgarbas.
    13. Change is Possible: Stories of Women and Minorities in Mathematics by Patricia Clark Kenschaft. Review by Sorelle Friedler.
      • Riot at the Calc Exam and other Mathematically Bent Stories by Colin Adams;
      • The Great $\pi$/e Debate: Which is the Best Number? by Colin Adams VS Thomas Garrity, Moderated by Edward Burger;
      • The United States of Mathematics: Presidential Debate by Colin Adams VS Thomas Garrity, moderated by Edward Burger
      Joint Review by William Gasarch (one book, two videos).
  20. Vol 41, No. 1, 2010 41-1.pdf
    1. Data Structures and Algorithms Using Python and C++. by David Reed and John Zelle. Review by Richard Jankowski. An Introduction to Data Structures and Algorithms. by James Storer. Review by Adel El-Atawy
    2. Advanced Data Structures by Peter Brass. Review by Richard Jankowski.
    3. The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching by Donald Adjeroh, Timothy Bell and Amar Mukherjee. Review by Shoshana Neuburger.
    4. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis by Tamal Dey. Review by Matthew Sottile.
    5. Concentration of Measure for the Analysis of Randomized Algorithms by Devdatt Dubhashi and Alessandro Panconesi. Review by Aravind Srinivasan.
    6. The Modern Algebra of Information Retrieval by Sandor Dominich. Review by John Griffin.
    7. Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations by Y. Shoham and K. Leyton-Brown. Review by Haris Aziz.
    8. The Political Mapping of Cyberspace by Jeremy Crampton. Review by Rajesh Natarajan.
    9. The Princeton Companion to Mathematics by Timothy Gowers, June Barrow-Green and Imre Leader. Review by Haris Aziz.
    10. Computer Viruses and Malware by John Aycock. Review by Michael Sanford.
    11. Formal Correctness of Security Protocols by Giampaolo Bella. Review by Yannis Stamatiou.
    12. Computability of Julia Sets by Mark Braverman and Michael Yampolsky. Review:by Wesley Calvert.
  21. Vol 40, No. 4, 2009 40-4.pdf
    1. Quantum Computation and Quantum Communication: Theory and Experiments. by Mladen Pavicic. Review: George Hacken.
    2. Quantum Computing for Computer Scientists By Noson Yanofsky and Mirco Mannucci. Review by S.C. Coutinho.
    3. Biologically Inspired Algorithms for Financial Modelling by Anthony Brabazon, Michael O'Neil. Review by Brad Kyer.
    4. The Handbook of Bioinspired Algorithms and Applications Editors of Book: Stephan Olariu and Albert Zomaya. Review by Kushal Chakrabarti.
    5. Theoretical and Experimental DNA Computation. By M. Amos. Review by Maulik Dave.
    6. Coding for Data and Computer Communications By David Salomon. Review by Fatima Talib.

  22. 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 Yanofsky and Mirco 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 Zomaya.
    5. Theoretical and Experimental DNA Computation. By by M. Amos.
    6. Coding for Data and Computer Communications by by David Salomon.
  23. Vol 40, No. 3, 2009. 40-3.pdf
    1. The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators by Alexander Soifer. Review by William Gasarch.
      • Professor Stewart's Cabinet of Mathematical Curiosities by Ian Stewart,
      • Five Minute Mathematics by Ehrhard Behrends,
      • Aha Gotcha!- Aha Insight! by Martin Gardner,
      • Origami, Eleusis, and the Soma Cube by Martin Gardner,
      • Hexaflexagons, Probability Paradoxes, and The Tower of Hanoi by Martin Gardner,
      • Group Theory in the Bedroom and Other Mathematical Diversions by Brian Hayes.
      Joint Review by William Gasarch (six books).
    2. Combinatorics and Graph Theory by Harris, Hirst, Mossinghoff. Review by Miklós Bóna 2009.
    3. Algorithmic Combinatorics on Partial Words by Francine Blanchet-Sadri. Review by Miklós Bóna 2009.
    4. An Introduction to Difference Equations, Third Edition by Saber Elaydi. Review by Adel El-Atawy.
    5. Random Graphs (Second Edition) by Béla Bollobás. Review by Miklós Bóna 2009.
    6. Chases and Escapes by Paul Nahin. Review by Eowyn Cenek.
  24. Vol 40, No 2, 2009 40-2.pdf
    1. How to Think about Algorihtms by Jeff Edmonds. Review by Kryiakos Sgarbas.
    2. A Programmer's Companion to Algorithm Analysis by Ernst Leiss. Review by Dean Kelley.
      • Algorithms by Johnonbaugh and Schaefer
      • Algorithms by Dasgupta, Christos Papadimitriou, and Umesh Vazirani.
      Joint Review by Dean Kelley (two books).
    3. Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms by Juraj Hromkovic. Review by Marious Mavronicolas.
    4. Theoretical Aspects of Local Search by Michiels, Aarts, and Korst. Review by Jakub Marecek.
    5. The Traveling Salesman Problem: A Computational Study by Applegate, Bixby, Chvátal, and Cook. Review by William pringer.
    6. Visibility Algorithms in the Plane by Ghosh. Review by Alice Dean.
    7. A Course on the Web Graph by Anthony Bonato. Review by Elisa Schaeffer.
    8. Higher Arithmetic by Edwards. Review by Brittany Terese Fasy and David Millman.
  25. 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. Review by William Gasarch.
    2. Solving polynomial equation systems II: Macaulay's paradigm and Gröbner technology by Teo Mora. Review by S. C. Coutinho.
    3. How To Prove It: A Structured Approach by Daniel Velleman. Review by Brent Smith.
    4. Practical Optimization: Algorithms and Engineering Applications by Andreas Antoniou and Wu-Sheng Lu. Review by Brian Borchers.
    5. Rock, Paper, Scissors: Game Theory for Everyday Life by Len Fisher. Review by William Gasarch.
  26. Vol 39, No 4, 2008. 39-4.pdf
    1. Combinatorial Designs: Constructions and Analysis by Douglas Stinson. Review by Gregory Taylor.
    2. Combinatorics of Permutations by Miklós Bóna. Review by Gregory Taylor.
    3. Enumerative Combinatorics by Charalambos Charalambides. Review by Sergey Kitaev, 2008.
    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. Review by Richard Jankowski.
  27. Vol 39, No 3, 2008. 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 Schröder. Review by Radim Belohlavek.
      • General Lattice Theory (Second Edition) by George Grätzer.
      • The congruences of a finite lattice: a proof-by picture approach by George Grätzer.
      Joint Review by Jonathan Cohen (two books).
    3. Applied Combinatorics on Words by M. Lothaire. Review by Maulik Dave.
    4. Computation engineering: applied automata theory and logic by Ganesh Lalitha Gopalakrishnan. Review by S. C. Coutinho.
  28. Vol 39, No 2, 2008. 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 Irwin.
    5. Theoretical and Experimental DNA Computation by M. Amos. Review by Maulik Dave.
  29. Vol 39, No 1, 2008 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 Rauff.
    3. Handbook of Elliptic and Hyperelliptic Curve Cryptography Edited by H. Cohen and G. Frey. Review by Lawrence Washington.
    4. The Game's Afoot: Game Theory in Myth and Paradox by Alexander Mehlmann. Review by Danny Krizanc, 2008.
      • Introducing Game Theory and Its Applications by Eliott Mendelson, and
      • Game Theory and Strategy by Philip Straffin.
      Joint Review by William Springer (two books).
    5. Semantic Integration of Heterogeneous Software Specifications by Martin Grobe-Rhode. Review by Maulik A Dave.
  30. Vol 38, No 4, 2007 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 Blum and Sergey Lototsky. Review by Frederic Green.
    4. Research Problems in Discrete Geometry by Brass, Moser, Pach. Review by William Gasarch.
  31. Vol 38, No 3, 2007 38-3.pdf
    1. The Political Mapping of Cyberspace by Jeremy Crampton. Review by Rajesh Natarajan.
    2. Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal. Review by Jonathan Katz Review by Yannis Stamatiou.
    3. Computational Techniques of the Simplex Method by István Maros. Review by Brian Borchers.
  32. Vol 38, No 2, 2007 38-2.pdf
    1. Symbolic Asymptotics by John Shackell. Review by James Beaumont.
    2. Complexity and Cryptography. An Introduction by John Talbot and Dominic Welsh. Review by Jörg Rothe.
    3. Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe. Review by Piotr Faliszewski.
    4. Three Blogs by Theorists. The blogs are by Lance Fortnow, Scott Aaronson, and Luca Trevisan. Review of these three blog by William Gasarch.
  33. Vol 38, No 1, 2007 38-1.pdf
    1. Excellence Without a Soul: How a Great University Forgot Education by Harry Lewis. Review by William Gasarch.
      • An Introduction to Quantum Computing Algorithms by Arthur Pittenger.
      • Quantum Computing by Mika Hirvensalo.
      • Classical and Quantum Computation by A. Yu. Kitaev, A. Shen, and M. N. Vyalyi.
      Joint Review by Ronald de Wolf (three books).
    2. Introduction to Lattices and Order by B.A. Davey, H.A. Priestley. Review by Jonathan Cohen.
    3. Computational Techniques for the Summation of Series by Anthony Sofo. Review by Vladik Kreinovich.
  34. Vol 37, No 4, 2006 37-4.pdf
    1. Types and Programming Languages by Benjamin Pierce. Review by Mats Kindah.
    2. Information Theory, Inference, and Learning Algorithms by David MacKay. Review by Maulik Dave.
    3. Verification of Reactive Systems : Formal Methods and Algorithms by Klaus Schneider. Review by Maulik Dave.
    4. Algorithmic Learning in a Random World by Vovk, Gammerman, and Shafer. Review by James Law.
    5. The Random Projection Method by Santosh Vempala. Review by Aravind Srinivasan.
  35. Vol 37, No 3, 2006 37-3.pdf
      • Reality Conditions: Short Mathematical Fiction, by Alex Kasman.
      • Numb3rs, TV show.
      • Mathematical Apocryphia: Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz
      • Mathematical Apocryphia Redux: More Stories and Annecdotes of Mathematicians and the Mathematical by Steven Kranz.
      Joint Review by William Gasarch (three books, one TV show).
      • A History of Pi by Petr Beckmann.
      • The Joy of Pi by David Blatner.
      • The Nothing That Is by Robert Kaplan.
      • e: The Story of a Number by Eli Maor.
      • The story of $i$: An Imaginary Tale by Paul Nahin.
      • Zero: The Biography of a Dangerous Idea by Charles Seife.
      Joint Review by Brian Blank (6 books). (This joint review originally appeared in College Math Journal Volume 32, No. 2, March 2001, pages 155-160. It appears here with their permission.)
    1. The Square Root of 2: A Dialogue Concerning a Number and a Sequence by David Flannery. Review in the form of a dialogue between William Gasarch, Alexander Kruskal, Justin Kruskal, and Rebecca Kruskal. (The Kruskal Triplets.)
  36. Vol 37, No 2, 2006 37-2.pdf
    1. Fair Division and Collective Welfare by Hervé Moulin. Review by Varsha Dani.
    2. Algorithms: Sequential, Parallel, and Distributed by Kenneth Berman and Jerome Paul. Review by William Schmeister.
    3. Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen, and M. Amiu Shokrollahi. Review by Anthony Widjaja To (This is not a typo. The middle name is Widjaja and his last name is To.)
  37. Vol 37, No 1, 2006 37-1.pdf
    1. A Computational Introduction to Number Theory and Algebra by Victor Shoup. Review by Jonathan Katz. Primality Testing in Polynomial Time by Martin Dietzfelbinger. Review by Jonathan Katz.
    2. Introduction to Coding Theory by Juerjen Bierbrauer. Review by William Springer.
    3. Codes: The Guide to Secrecy from Ancient to Modern Times by Richard Mollin. Review by Adam Bender.
    4. Computational Complexity: a Quantitative Perspective by Marius Zimand. Review Carlos Oliveira.
    5. Secure Communicating Systems : Design, analysis, and implementation by Michael R A Huth. Review by Maulik Dave.
    6. Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman. Review by Pierre Lescanne.
  38. Vol 36, No 4, 2005 36-4.pdf
    1. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenge Edited by Michael Goldwasser, David Johnson, Catherine McGeoch. Review by Maulik Dave.
    2. Genomic Perl: From Bioinformatics Basics to Working Code by Rex Dwyer. Review by Raymond Wan.
    3. Graphs, Networks, and Algorithms by Dieter Jungnickel. Review by William Fahle.
    4. Immunocomputing: Principles and Applications by Alexander Tarakanov, Victor Skormin, Svetlana Sokolova. Review by Wenzhong Zhao.
    5. Term Rewriting Systems by Terese. Review by Frederic Loulergue.
  39. Vol 36, No 3, 2005 36-3.pdf
    1. Classical and Quantum Computing with C++ and Java Simulations by Yorick Hardy and Willi-Hans Steeb. Review by Nick Papanikolaou, 2005.
    2. Integer Programming By Laurence Wolsey. Review by E. Jonathan Chapin.
    3. Computational Line Geometry by H. Pottmann and J. Wallner. Review by Georg Essl.
    4. Logic for Computer Scientists by Uwe Schöning. Review by Riccardo Pucella.
    5. Teaching Statistics Using Baseball by Jim Albert. Review by James Glenn.
  40. Vol 36, No 2, 2005 36-2.pdf
    1. Cryptological Mathematics by Robert Lewand. Review by William Gasarch.
    2. Data Privacy and Security by David Salomon. Review by Nick Papanikolaou.
      • Cryptography: An Introduction by V.V. Yaschenko,
      • Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr.,
      • RSA and Public-Key Cryptography by R.A. Mollin, and
      • Foundations of Cryptography, Vol. 1: Basic Tools, by Oded Goldreich.
      Joint Review by Jonathan Katz (four books).
  41. Vol 36, No 1, 2005 36-1.pdf
    1. Proofs that Really Count: The Art of Combinatorial Proof by Arthur Benjamin and Jennifer Quinn. Review by William Gasarch.
    2. Types and Programming Languages by Benjamin Pierce. Review by Mats Kindahl
      • Introduction To Natural Computation by Dana Ballard
      • Mathematical Methods in Artificial Intelligence by Edward Bender.
      Joint Review by Lawrence Moss (two books).
  42. Vol 35, No 4, 2004 35-4.pdf
    1. Boolean Functions and Computation Models by Clote and Kranakis. Review by R. Gregory Taylor.
    2. Selected Papers in Discrete Mathematics by Donald Knuth. Review by Carlos Oliveira.
    3. Linear Optimization and Extensions - Problems and Solutions by Dimitris Alevas and Manfred Padberg. Review by Carlos Oliveira.
    4. Introduction to the Design and Analysis of Algorithms By Ananay Levitin. Review by William Fahle.
  43. Vol 35, No 3, 2004 35-3.pdf
    1. Handbook of Graph Theory Edited by Gross and Yellen. Review by William Gasarch.
    2. Reasoning about Uncertainty by Joseph Y. Halpern. Review by Wenzhong Zhao.
      • Learning Kernel Classifiers: Theory and Algorithms by Ralf Herbrich.
      • Learning with Kernels: Support Vector Machines, Regularization Optimization and Beyond by Bernhard Schölkopf and Alexander J. Smola.
      Joint Review by Luc T. Wille (two books).
    3. Essentials of Constraint Programming by T. Frühwirth and S. Abdennadher Review by Carlos Oliveira.
  44. Vol 35, No 2, 2004 35-2.pdf
    1. Concurrent and Real-time Systems: The CSP Approach by Steve Schneider. Review by Sabina Petride.

    2. Introduction to Languages, Machines and Logic: Computable Languages, Abstract Machines and Formal Logic by Alan P. Parkes. Review by Robert McNaughton.

    3. Algorithm Design: Foundations, Analysis and Internet Examples by Michael T. Goodrich and Roberto Tamassia. Review by Pavol Navrat.

    4. Theory of Semi-Feasible Algorithms by Lane Hemaspaandra and Leen Torenvliet. Review by Lance Fortnow.

  45. Vol 35, No 1, 2004 35-1.pdf
    1. The Classical Decision Problem by Egon Börger, Erich Grädel and Yuri Gurevich. Review by Dan A. Simovici.

    2. Automata theory and its applications by Bakhadyr Khoussainov and Anil Nerode. Review by Lawrence S. Moss and Hans-Jörg Tiede.

    3. Automata, Logics, and Infinite Games edited by Erich Grädel, Wolfgang Thomas, and Thomas Wilke. Review by Lawrence S. Moss and Hans-Jörg Tiede

    4. Automatic sequences: Theory, Applications, Generalizations by Jean-Paul Allouche and Jeffrey Shallit. Review by Jean Berstel.

  46. Vol 34, No 4, 2003 34-4.pdf

    1. Introduction to Cryptography by Johannes A. Buchmann. Review by Andrew Lee.

    2. Coding Theory and Cryptography: The Essentials, Second Edition by D.R. Hankerson, D.G. Hoffman, D.A. Leonard, C.C. Lindner, K.T. Phelps, C.A. Rodger, J.R. Wall. Review by Robert J. Irwin.

    3. Cryptography: Theory and Practice by Douglas R. Stinson. Review by William M. Springer II.

    4. Foundations of Cryptography: Basic Tools by O. Goldreich Review by Riccardo Pucella.

    5. Modelling and Analysis of Security Protocols by P. Ryan and S. Schneider Review by Riccardo Pucella.

    6. Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatorics, Vol 17) by Oded Goldreich. Review by Andrew Lee.

  47. 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. Review by Robert J. Irwin.

    2. Theory of Computational Complexity by Ding-Zhu Du and Ker-I Ko. Review by Eowyn Cenek.

    3. Computer Arithmetic Algorithms: A review by Israel Koren. Review by George A. Constantinides

    4. An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger. Review by Andrea Marchini.

  48. Vol 34, No 2, 2003 34-2.pdf

    1. Algorithms Sequential & Parallel: A Unified Approach by R. Miller & L. Boxer. Review by Anthony Widjaja.

    2. Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Juraj Hromkovic. Review by Hassan Masum.

    3. Modal and Temporal Properties of Processes by Colin Stirling. Review by Vicky Weissman.

    4. Modal Logic by Patrick Blackburn, Maarten de Rijke, and Yde Venema. Review by P. Daniel Hestand.

  49. Vol 34, No 1, 2003 34-1.pdf
    1. Number Theory for Computing by Song Y. Yan. Review by Prodromos Saridis.

    2. Type-Logical Semantics by B. Carpenter. Review by Riccardo Pucella and Stephen Chong.

    3. The $\pi$-calculus: A Theory of Mobile Processes by D. Sangiorgi and D. Walker. Review by Riccardo Pucella.

  50. Vol 33, No 4, 2002 33-4.pdf

    1. Bioinformatics: The Machine Learning Approach by Pierre Baldi and Soren Brunak. Review by Ivelin Ivanov.

    2. The Clausal Theory of Types by D. A. Wolfram (Not to be confused with Stephen Wolfram, whose book is also reviewed in this column.) Review by Maulik Dave.

    3. Discrete Mathematical Problems with Medical Applications (DIMACS Volume 55) Edited by D-Z. Du, P. M. Pardalos, and J. Wang. Review by Suresh Venkatasubramanian.

    4. Things a Computer Scientist Rarely Talks About by Donald E. Knuth. Review by Ian Parberry.

    5. A New Kind of Science by Stephen Wolfram. Review by Hassan Masum.

  51. Vol 33, No 3, 2002 33-3.pdf

    1. Modern Computer Algebra by Joachim von zur Gathen and Jürgen Gerhard. Review by R. Gregory Taylor.

    2. The Discrepancy Method --Randomness and Complexity by Bernard Chazelle. Review by Jin-Yi Cai.

      • Computability and Complexity Theory by Steven Homer and Alan L. Selman, and
      • The Complexity Theory Companion by Lane A. Hemaspaandra and Mitsunori Ogihara.
      Joint Review by Eowyn Cenek (two books).

    3. Mathematical Theory of Domains by Viggo Stoltenberg-Hansen, Ingrid Lindström, and Edward R. Griffor. Review by P. Daniel Hestand.

  52. Vol 33, No 2, 2002 33-2.pdf

    1. Model Checking by Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Review by Vicky Weissman.

    2. Petri Net Algebra by Eike Best, Raymond Devillers, Maciej Koutny. Review by Ivelin Ivanov.

    3. Combinatorial Optimization - Theory and Algorithms by Bernhard Korte and Jens Vygen Review by Ivelin Ivanov.

    4. Calculated Bets by Steven Skiena. Review by William Gasarch.

  53. Vol 33, No. 1, 2002 33-1.pdf

    1. Algorithmic Geometry by Jean-Daniel Boissonat and Mariette Yvinec. Review by Eowyn Cenek.

    2. Branching Programs and Binary Decision Diagrams: Theory and Applications by Ingo Wegener. Review by Lance Fortnow.

    3. Networks in Distributed Computing (DIMACS proceedings) Edited by Marios Mavronicolas, Michael Merritt, and Nir Shavit. Review by Ivelin Ivanov.

    4. Graph Theory and Its Applications by Jonathan Gross and Jay Yellen. Review by David Marcus.

    5. Graph Theory by William Tutte. Review by Christopher Jennings.

    6. Data Refinement: Model-Oriented Proof Methods and Their Comparison by Willem-Paul de Roever and Kai Engelhardt. Review by Dan Hestand.

    7. In the last column William Gasarch reviewed Proofs and Refutations by Lakatos. Included in that review were some remarks about the relevancey of Philosophy of Math for theoretical computer scientists. David Molnar disagrees with some of what was said and was invited to write a response. This is included, as well as a response to the response.

  54. Vol 32, No. 4, 2001 32-4.pdf

    1. Proofs and Confirmations: the story of the alternating sign matrix conjecture , by David Bressoud. Review by Jeremy Avigad.
    2. Proofs and Refutations by Imre Lakatos. Review by William Gasarch.
    3. Dynamic Logic (Foundations of Computing) by David Harel, Dexter Kozen and Jeryz Tiuryn. Review by Riccardo Pucella.
    4. Analysis of Algorithms:An Active Learning Approach by Jeffrey McConnell. Review by Christopher Jennings

  55. Vol 32, No 3, 2001 32-3.pdf

    1. Automata and Languages: Theory and Applications by Alexander Meduna. Review by James Rauff.

    2. Control Flow Semantics , by J. de Bakker and E. de Vink. Review by Riccardo Pucella.

    3. External Memory Algorithms (proceedings of DIMACS Workshop, May 20-22,1998) Edited by J.M. Abello and J.S. Vitter. Review by Gianluca Della Vedova.

    4. $\pi$ - Unleashed By Jorg Arndt and Christoph Haenel. Review by David Marcus.

      • Chaotic Elections! by Donald Saari and
      • Mathematics and Politics by Alan Taylor.
      Joint Review by William Gasarch (three books).

  56. Vol 32, No 2, 2001 32-2.pdf

    1. The Codebreakers: The story of secret writing , by David Kahn Review by William Gasarch.

    2. The Code Book: The Evolution of Secrecy from Mary Queen of Scots to Quantum Cryptography , by Simon Singh. Review by Jim Reeds.
    3. Basic Proof Theory by Anne Troelstra and Helmut Schwichtenberg. Review by Jeremy Avigad.
    4. Complexity and Real Computation by Lenore Blum, Felipe Cucker, Michael Shub, and Steven Smale. Review by Tim McNicholl.

  57. Vol 32, No. 1, 2001 32-1.pdf

    1. Data Structures and Algorithms in Java (2nd ed) by Michael T Goodrich and Roberto Tamassia. Review by Hassan Masum.
    2. Selected Papers on Analysis of Algorithms by Donald Knuth. Review by Timothy McNicholl.
    3. How to Solve It: Modern Heuristics by Zbigniew Michalewicz and David B Fogel. Review by Hassan Masum.
    4. Proof, Language, and Interaction: Essays in Honour of Robin Milner Edited by Plotkin, Stirling and Tofte. Review by Riccardo Pucella.

  58. Vol 31, No. 4, 2000 31-4.pdf

      • Fair Division: From Cake Cutting to Dispute Resolution) , by Brams and Taylor,
      • Cake Cutting: Be Fair if You Can by Robertson and Webb,
      • The Win-Win Solution by Brams and Taylor,
      • Fair Allocation (Proceedings of Symposia in Applied Mathematics, Vol 33) Edited by H. Peyton Young.
      Joint Review by William Gasarch (four books).
    1. Computational Geometry: Algorithms and Applications (2nd Ed) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Review by Hassan Masum.
    2. Parameterized Complexity , by Downey and Fellows. Review by Gabriel Istrate.
    3. Modern Graph Theory by Bollobás. Review by Eowyn Cenek.
    4. A$=$B by Marko Petkovšek, Herbert Wilf, and Doron Zeilberger. Review by Vladik Kreinovich.
    5. Communicating and mobile systems: the $\pi$-calculus by Robin Milner. Review by Riccardo Pucella.

  59. Vol 31, No. 3, 2000 31-3.pdf

      • Descriptive Complexity Theory by Neal Immerman,
      • Finite Model Theory by Heinz-Dieter Ebbinhaus and Jorg Flum,
      • Descriptive Complexity and Finite Models (Proceedings from a DIMACS workshop) edited by Neil Immerman and Phokion Kolaitis.
      Joint Review by William Gasarch (three books).
    1. Theory of Computing: A Gentle Introduction by Efim Kinber and Carl Smith. Review by Judy Goldsmith.
    2. Microsurveys in Discrete Probability (Proceedings from a DIMACS workshop) edited by David Aldous and James Propp. Revie by Hassan Masum.
    3. Term Rewriting and all that by Franz Baader and Tobias Nipkow. Review by Paliath Narendran.

  60. Vol 31, No. 2, 2000 31-2.pdf

    1. Gems of Theoretical Computer Science by Uwe Schonig and Randall Pruim. Review by: Danny Krizanc.
    2. Network Design: Connectivity and Facilities Location, DIMACS Workshop edited by Pardalos and Du. Review by Boris Goldengorin.
    3. The Optimal Implementation of Functional Programming Languages by Andrea Asperti and Stefano Guerrini. Review by Christopher League.
    4. Indiscrete Thoughts by Gina-Carlo Rota. Review by William Gasarch. This is a collection of essays on math, mathematicians, and related topics. Some of his insights area applicable to Computer Science as well. This review originally appeared in Journal of Logic and Computation Vol. 9, No. 4, Aug 1999, pages 595-596. It is reprinted here with permission.

  61. Vol 31, No. 1, 2000 31-1.pdf

    1. Distributed Computing by Attiya and Welch, Review by Maurice Herlihy. This is a textbook aimed at grad students, and advanced undergrads, for a course on Distributed Computing.
    2. Hilbert's Tenth Problem , by Yuri Matiyasevich. Review by Randall Pruim.
    3. Lambda Calculi: A Guide for Computer Scientists by Chris Hankin. Review by Christopher League.
    4. Systems that Learn (second edition) by Jain, Osherson, Royer, Sharma. Review by Carl Smith.

  62. Vol 30, No. 4, 1999 30-4.pdf
    1. Mathematical Support for Molecular Biology edited by Martin Farach-Colton, Fred Roberts, Martin Vingron, and Michael Waterman. Review by Chrystopher Nehaniv.
    2. DNA Based Computers II, edited by Lauara Landweber and Eric Baum. Review by Mitsunori Ogihara and Animesh Ray.
    3. DNA Based Computers III edited by Harvey Rubin and David Harlan Wood. Review by Martyn Amos.
    4. Online Computation and Competitive Analysis by Allan Borodin and Ran El-Yaniv. Review by Neal Young.

  63. Vol 30, No. 3, 1999 30-3.pdf

    1. Computational geometry in C (Second Edition) , by Joseph O'Rourke. Review by: Michael Dekhtyar.
    2. Bounded Queries in Recursion Theory by William Gasarch and Georgia Martin. Review by Lance Fortnow.
    3. Logic For Applications (Second Edition) , By Anil Nerode and Richard Shore. Review by Alexander Dekhtyar.

  64. 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.

  65. Vol 30, No. 1, 1999 30-1.pdf

    1. Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to Algorithm Analysis by Donald Knuth. Review by Tim McNichol.
    2. The Limits of Mathematics by Gregory Chaitin. Review by Vladimir Tasic.
    3. Privacy on the Line by Whitfield Diffie and Susan Landau. Review by Joseph Maklevitch.
    4. A Theory of Objects by Authors: Marti n Abadi and Luca Cardelli. Review by Brian Postow.

  66. Vol 29, No. 4, 1998. 29-4.pdf

    1. Cryptology and Computational Number Theory by Carl Pomerance. Review by Andreas Stein.
    2. Theories of Computability by Nick Pippenger. Review by Sanjay Gupata.
    3. Vicious Circles by Barwise and Moss. Review by Alexander Dekhtyar.

  67. Vol 29, No 3, 1998. 29-3.pdf

    1. Algorithms on strings, trees, and sequences: computer science and computational biology by Dan Gusfield. Review by Gary Benson.
    2. Verification of Sequential and Concurrent Programs by Krzysztof Apt and Ernst-Rüdiger Olderog. Review by Anish Arora.
    3. Algorithms and Programming: Problems and Solutions by Alexander Shen. Review by Jerry James.
  68. Vol 29, No. 2 1998. 29-2.pdf
    1. Approximation Algorithms for NP-hard Problems , Edited by Dorit Hochbaum. Review by Randeep Bhatia and Yoram Sussmann.
    2. Selected Papers on Computer Science by Donald Knuth. Review by Samir Khuller.
    3. Communication Complexity by Eyal Kushilevitz and Noam Nisan. Review by William Gasarch.
  69. Vol 29 No. 1 1998 29-1.pdf
    1. Complexity Theory Retrospective II, edited by: Lane Hemaspaandra and Alan Selman. Review by: Eric Allender.
    2. Basic Simple Type Theory by J. Roger Hindley. Review by Brian Postow.
    3. Discrete Mathematics in the Schools, Edited by Joseph Rosenstein, Deborah Franzblau, and Fred Roberts. Review by Neal Koblitz.
  70. Vol 28 No. 4 1997 28-4.pdf
    1. Metamathematics, Machines, and Godel's Proof by N. Shankar. Review by K. Purang.
    2. Reasoning About Knowledge by Ronald Fagin, Joseph Halpern, Yoram Moses and Moshe Vardi. Review by Alexander Dekhtyar.
    3. Isomorphisms of Types: From $\lambda$-calculus to information retrieval and language design by Roberto Di Cosmo. Review by Christopher League.
  71. Vol 28 No. 3, 1997 28-3.pdf
    1. An intro. to Kolg. Comp by Vitanyi, Li. Review by William Gasarch



next up previous
Next: About this document ...
Bill Gasarch 2014-12-20