Next: About this document ...
- I was SIGACT NEWS book review editor from
1997 until 2015. All of the columns I edited are
here. The editor is now Fred Green.
His columns are
here
- Vol 46, No 1, 2015.
46-1.pdf
- Digital Signatures by Jonathan Katz.
Reviewed by Subhayan Roy Moulick.
- A Walk Through Combinatorics by Miklós Bóna.
Review by Bill Gasarch.
- A Wealth of Numbers: An Anthology of 500 Years of Popular Mathematics writing
by Benjamin Wardhaugh.
Review by Omar Shehab.
- A Guide to Experimental Algorithms by Catherine McGeoch.
Review by Shoshana Marcus.
- Fundamentals of Parameterized Complexity (second edition).
by Rodney Downey and Michael Fellows.
Review by Rajesh Chitnis.
- The King of Infinite Space: Euclid and his
Elements by David Berlinski.
Review by Eownyn Cenek.
- Vol 45, No 4. 2015
45-4.pdf
- The Universal Computer. The road from Leibniz to Turing
by Martin Davis.
Review by Haim Kilov.
- From Zero to Infinity
by Constance Reid.
Review by John Tucker Bane.
- The LLL Algorithm
Edited by Phong Nguyen and Brigitte Vallée.
Review by Krishnan Narayanan.
- Classic Papers in Combinatorics
Edited by Ira Gessel and Gian-Carlo Rota.
Review by Arya Mazumdar.
- Mathematical Treks by Ivars Peterson.
Review by John Tucker Bane.
- Six Sources of Collapse by
Charles Hadlock.
Review by Eowyn Cenek.
- Visions of Infinity: The Great Mathematical Problems
by Ian Stewart.
Review by Aravind Srinivasan.
- The Satisfiability Problem: Algorithms and Analyses
by Uwe Schoning and Jacobo Toranns.
Review by William Gasarch.
- Vol 45, No 3. 2015
45-3.pdf
- Understanding Cryptography: A Textbook for Students and Practitioners
by Christof Paar and Jan Pelzl.
Review by Subhayan Roy Moulick.
- The Erdos Distance Problem
by Julia Garibaldi, Alex Iosevich, Steven Senger.
Review by William Gasarch.
- Clustering in Bioinformatics and Drug Design
by John MacCuish and Norah MacCuish.
Review by Mohsen Mahmoudi Aznaveh.
- The Block Cipher Companion
by Lars Knudsen and Matthew Robshaw.
Review by Jonathan Katz.
- Networked Life: 20 Questions and Answers
by Mung Chiang.
Review by Jonathan Katz.
- Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
by Bruno Courcelle and Joost Engelfriet.
Review by Michaël Cadilhac.
- Basic Phylogenetic Combinatorics by
Andreas Dress, Katharina Huber.
Review by Kipper Fletez-Brant.
- Analytic Combinatorics in Several Variables
by Robin Pemantle and Mark Wilson.
Review by Miklós Bóna.
- The Tower of Hanoi - Myths and Maths
by Andreas Hinz, Sandi Klavzar, Uroš Milutinovic, Ciril Petr.
Review by László Kozma.
- Vol 45, No 2, 2014
45-2.pdf
- Selected Papers on Discrete Mathematics
by Donald Knuth.
Review by Daniel Apon.
- Selected Papers on Design of Algorithms
by Donald Knuth.
Review by Daniel Apon
- Selected Papers on Fun & Games
by Donald Knuth.
Review by William Gasarch.
- Companion to the Papers of Donald Knuth
by Donald 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).
- Bayesian Reasoning and Machine Learning
by David Barber
Review by Matthias Gallé.
- Integrated Methods for Optimization
by John Hooker.
Review by Shyamala Nagaraj.
- Programming with Higher-Order Logic
by Dale Miller and Gopalan Nadathur.
Review by Vaishak Belle.
- People, Problems, and Proofs by
Richard Lipton and Ken Regan.
Review by William Gasarch.
- Who's Bigger? Where Historical Figures Really Rank
by Steven Skiena and Charles Ward.
Review by Nicholas Mattei.
- Vol 45, No 1, 2014
45-1.pdf
- In Pursuit of the Unknown: 17 Equations That Changed the World
by Ian Stewart.
Review by Omar Shehab.
- Unauthorized Access: The Crisis in Online Privacy and Security
by Robert Sloan and Richard Warner.
Review by Harry Lewis
- Boolean Functions - Theory, Algorithms, and Applicationsby
Yves Crama and Peter Hammer.
Review by Haris Aziz.
- Additive Combinatorics by
Terence Tao and Van Vu.
Review by Raghunath Tewari.
- Discrete and Computational Geometry by
by Satyan Devadoss and Joseph O'Rourke.
Review by Brittany Terese Fasy and David Millman.
- Iterative Methods in Combinatorial Optimization by
by Lap Chi Lau, R Ravi and Mohit Singh.
Review by Yang Li.
- Perspectives on Projective Geometry
by Jürgen Richter-Gebert.
Review by Servino Coutinho.
- Who's #1?: The Science of Ranking and Rating by
Amy Langville and Carl Meyer.
Review by Nicholas Mattei.
- Boosting : Foundations and Algorithms
by Robert Schapire and Yoav Freund.
Review by Shiva Kintali.
- 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).
- Variable-length Codes for Data Compression
by David Salomon.
Review by Farhan Nasim.
- History of Mathematics - Highways and Byways
by Amy Dahan-Dalmedico and Jeanne Peiffer (Translated by Sanford Segal).
Review by Shyamala Nagaraj.
- Identity-Based Encryption
by Sanjit Chattarjee and Palash Sarkar.
Review by Jonathan Katz.
- Resources for Teaching Discrete Mathematics
edited by Brian Hopkins.
Review by Myriam Abramson.
- Proofs and Algorithms
by Gilles Dowek (translation by Maribel Fernandez).
Review by Michaël Cadilhac.
- Introduction to Computational Proteomics
by Golan Yona.
Review by Dimitris Papamichail.
- Computability and Complexity Theory
by Steven Homer and Alan Selman.
Review by Jeffrey Shallit.
- Quantum Computing Since Democritus
by Scott Aaronson.
Review by Frederic Green.
- Algorithmic Puzzles by Anany Levitin and Maria Levitin.
Review by William Gasarch.
- Vol 44, No 3, 2013
44-3.pdf
- Theoretical Computer Science: Introduction to Automata,
Computability, Complexity, Algorithmics, Randomization,
Communication, and Cryptography
by Juraj Hromkovic.
Review by Richard Jankowski.
- The Mathematics of Life
by Ian Stewart.
Review by Aaron Sterling.
- Universal Semantic Communication
by Brendan Juba.
Review by Wesley Calvert.
- Graph Algorithms (2nd edition)
by Shimon Even, edited by Guy Even.
Review by Anthony Labarre.
- How to Fold It
by Joseph O'Rourke.
Review by Brittany Terese Fasy and David Millman.
- Bioinformatics for Biologists
Edited by Pavel Pevzner and Ron Shamir.
Review by Dimitris Papamichail.
- Extremal Combinatorics with Applications to Computer Science (2nd edition)
by Stasys Jukna.
Review by Miklós Bóna.
- Enumerative Combinatorics, Volume 1, Second Edition
by Richard Stanley.
Review by Angèle Hamel.
- Combinatorial Optimization
by B. Korte and J. Vygen.
Review by Akash Kumar.
- The Golden Ticket: P, NP, and the Search for the Impossible
by Lance Fortnow.
Review by Cynthia DiPaula and Andrew Wonnacott.
- Probably Approximately Correct
by Leslie Valiant.
Review by Joshua Brulé.
- 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).
- Grammatical inference: learning automata and grammars by Colin de la Higuera.
Review by Matthias Gallé.
- Logical Foundation of Proof Complexity by Stephen Cook and Phuong Nguyen.
Review by Arthur Milchior.
- Exact Exponential Algorithms by Fedor Fomin and Dieter Kratsch.
Review by Michael Lampis.
- Bioinspired Computation in Combinatorial Optimization by Frank Neumann and Carsten Witt.
Review by Sven Herrmann.
- Triangulations: Structure for Algorithms and Applications by Jesús De Lorea, Jörg Rambau, and Francisco Santos.
Review by Michael Murphy.
- Flows in Networks
by Lester Ford and Delbert Fulkerson.
Review by Yixin Cao.
- Quantum Computing - A Gentle Introduction
by Eleanor Rieffel and Wolfgang Polak.
Review by Kyriakos Sgarbas.
- The Art of Computer Programming: Volume 4A by Donald Knuth.
Review by John Rogers.
- Boolean Function Complexity: Advances and Frontiers by Stasys Jukna.
Review by William Gasarch.
- Vol 44, No 1, 2013
44-1.pdf
- P, NP, and NP-Completeness by Oded Goldreich.
Review by Shyamala Nagaraj.
- Bijective Combinatorics by Nicholas Loehr.
Review by Miklós Bóna.
- Surveillance or Security? By Susan Landau.
Review by Tal Moran.
- Spyware and Adware by John Aycock.
Review by Dave Werden
- Burdens of Proof by Jean-François Blanchette.
Review by Harry Lewis.
- Boolean Models and Methods in Mathematics, Computer Science, and Engineering Edited by Yves Crama and Peter Hammer.
Review by Marcin Kaminski.
- Algorithmic Randomness and Complexity by Downey and Hirschfeldt.
Review by Jason Teutsch.
- Information Retrieval By Buettcher, Clarke, Cormack.
Review by Paul Rubin.
- Models of Conflict and Cooperation by Rick Gillman and David Housman.
Review by Mark Wilson.
- Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer.
Review by Jonathan Katz.
- Introduction to Bio-Ontologies by Peter Robinson and Sebastian Bauer.
Review by Mohsen Mahmoudi Aznaveh.
- The Dots and Boxes Game: Sophisticated Child's Play by Elwyn Berlekamp.
Review by Omar Shehab.
- Vol 43, No 4, 2012
43-4.pdf
- Algorithmic Cryptanalysis. By Antoine Joux.
Review by Alexandra Anzala-Yamajako.
- Algorithmic Bioprocesses. Edited by Condon, Harel, Kok, Salomaa, Winfree.
Review by Aaron Sterling.
- Vehicular Networks, from Theory to Practice. Edited by Stephan Olariu and Michele Weigle.
Review by Yu Wang.
- Graph Theory and Interconnection Networks. By Lih-Hsing Hsu and Cheng-Kuan Lin.
Review by Francesco Silvestri.
- Transitions and Trees: An Introduction to Structural Operational Semantics. By Hans Hüttel.
Review by Steven Falke.
- Origins and Foundations of Computing. By Friedrich Bauer.
Review by Haim Kilov.
- Introduction to Scheduling. Edited by Yves Robert and Frederic Vivien.
Review by Ben Fulton.
- Semantic Techniques in Quantum Computation. Edited by Simon Gay and Ian Mackie.
Review by Kyriakos Sgarbas.
- Modern Computer Arithmetic. By Richard Brent and Paul Zimmermann.
Review by Song Yan.
- Vol 43, No 3, 2012
43-3.pdf
- Combinatorial Games: Tic-Tac-Toe Theory
by Jozsef Beck.
Review by William Gasarch.
- Algorithmic Adventures: From Knowledge to Magic
by Juraj Hromkovic.
Review by Antonio Porreca.
- Applied Algebra: Codes, Ciphers and Discrete Algorithms
by Darel Hardy, Fred Richman, and Carol Walker.
Review by Yulai Xie.
- Models of Computation - An Introduction to Computability Theory
by Maribel Fernández.
Review by José de Oliveira Guimarães.
- Handbook of weighted Automata
Edited by Manfred Droste, Werner Kuich and Heiko Vogler.
Review by Michaël Cadilhac
- Matching Theory
by László Lovász and Michael Plummer.
Review by Haris Aziz.
- Introduction to Mathematics of Satisfiability
by Victor Marek.
Review by Stephen Falke.
- Elements of Automata Theory
by Jacques Sakarovitch.
Review by Shiva Kintali.
- Combinatorial Pattern Matching Algorithms
in Computational Biology Using Perl and R
by Gabriel Valiente.
Review by Anthony Labarre.
- In Pursuit of the Traveling Salesman by William Cook.
Review by Haris Aziz.
- Permutation Patterns
Edited by Steve Linton, Nik Ruškuc, Vincent Vatter.
Review by Karolina Soltys.
- Vol 43, No 2, 2012
43-2.pdf
- A Concise Introduction to Data Compression
by David Salomon.
Review by Ville Hautamaki.
- Parallel Algorithms
by Henri Casanova, Arnaud Legrand, and Yves Robert.
Review by Mihai Pop.
- Polynomia And Related Realms
by Dan Kalman.
Review by Akash Kumar.
- Biscuits of Number Theory
Edited by Arthur Benjamin and Ezra Brown.
Review by Jeffrey Shallit.
- Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures
by János Pach and Micha Sharir.
Review by Sergio Cabello.
- Handbook of Large-Scale Random Networks
Edited by : Bela Bollobás, Robert Kozma and Deszo Miklós.
Review by Gabriel Istrate.
- Algorithms and Theory of Computation Handbook
Edited by : Mikhail Atallah and Marina Blanton.
Review by Nick Papanikolaou.
- Primality testing and integer factorization in public key cryptography
by Song Yan.
Review by Severino Coutinho
- Process Algebra: Equational Theories of Communicating Processes
by Jos Baeten, Twan Basten, and Michel Reniers.
Review by Wesley Calvert.
- Insider Threats in Cyber Security
Edited by Probst, Hunker, Gollman, and Bishop.
Review by Kim-Kwang Raymond Choo.
- Vol 43, No. 1, 2012
43-1.pdf
- The Cryptoclub: Using Mathematics to Make and Break Secret Codes
by Janet Beissinger and Vera Pless.
Review by Abu Mohammad Omar Shehab Uddin Ayub.
- Cryptanalytic Attacks on RSA
by Song Yan.
Review by Leo Irakliotis.
- Cryptanalysis of RSA and its variants
by Jason Hinek.
Review by Antoine Rojat.
- Understanding and Applying Cryptography and Data Security
by Adam Elbirt
Review by Jérémy Barbay.
- Efficient Secure Two-Party Protocols: Techniques and Constructions
by Carmit Hazay and Yehuda Lindell.
Review by Jonathan Katz.
- Theory of Computation
by Dexter Kozen.
Review by Daniel Apon.
- Codes: an introduction to information communication and cryptography
by Normal L Biggs.
Review by Robert Low.
- Finite Fields and Applications
by Gary Mullen and Carl Mummert
Review by Jeffrey Shallit
- The Life and Times of the Central Limit Theorem
by William Adams.
Review by Miklós Bóna.
- Pearls of Discrete Mathematics
by Martin Erickson.
Review by Robert Szarka.
- Design Theory
by Charles Lindner and Chrisopher Rodger.
Review by Dimitris Papamichail.
- An Introduction to the History of Algebra:
Solving Equations from Mesopotamian Times to the Renaissance
by Jacques Sesiano.
Review by William Gasarch.
- Vol 42, No. 4, 2011
- Foundations of Logic and Mathematics:
Applications to Computer Science and Cryptography
by Yves Nievergelt.
Review by Saif Terai.
- Rippling: Meta-Level Guidance For Mathematical Reasoning
by Alan Bundy, David Basin, Dieter Hutter, and Andrew Ireland.
Review by Maulik Dave.
- Handbook of Nature-Inspired and Innovative Computing
Edited by Albert Zomaya.
Review by Aaron Sterling.
- Algorithms and Data Structures: The Basic Toolbox
by Kurt Mehlhorn and Peter Sanders.
Review by Hal Elrod.
- The Algorithm Design Manual (Second Edition)
By Steven Skiena.
Review by Neelakantan Kartha.
- Graph Theory: A Problem Oriented Approach
by Daniel Marcus.
Review by Haris Aziz.
- Proofs from THE BOOK (4th edition)
by Martin Aigner and Günter Ziegler.
Review by Miklós Bóna.
- Handbook of Chemoinformatics Algorithms
Edited by Faulon, Bender.
Review by Aaron Sterling.
- Dynamic Fuzzy Logic and its Applications
by Fanzhang.
Review by Song Yan.
- Vol 42, No. 3, 2011
- Erdos on Graphs: His Legacy of Unsolved Problems
by Fan Chung and Ron Graham.
Review by Andy Parrish.
- Roots to Research
by Judith Sally and Paul Sally, Jr.
Review by Eowyn Cenek.
- Chromatic Graph Theory
by Gary Chartrand and Ping Zhang.
Review by Vance Faber.
- Applied Combinatorics
by Fred Roberts and Barry Tesman.
Review by Dimitris Papamichail.
Review by Miklós Bóna.
- Combinatorics, A Guided Tour
by David Mazur.
Review by Michaël Cadilhac.
- Famous Puzzles of Great Mathematicians
by Miodrag Petkovi.
Review by Lev Reyzin.
- Combinatorics - A Problem Oriented Approach
by Daniel Marcus.
Review by Myriam Abramson.
- Probability: Theory and Examples
by Rick Durrett.
Review by Miklós Bóna.
- Games, Puzzles, & Computation
by Robert Hearn and Erik Demaine.
Review by Daniel Apon.
- Vol 42, No. 2, 2011
42-2.pdf
- From Zero to Infinity: What Makes Numbers Interesting
by Constance Reid.
- Mathematics for the Analysis of Algorithms
by Daniel Greene and Donald Knuth.
- Algebraic Cryptanalysis by Gregory Bard.
- Algebraic Function Fields and Codes
by Henning Stichtenoth.
- Those Fascinating Numbers by Jean-Marie De Konick.
- Polya Urn Models by Hosam Mahmoud.
- Not always buried deep: a second course in elementary number theory
by Paul Pollack.
- Pioneering Women in American Mathematics: The Pre-1940 PhD's
by Judy Green and Jeanne LaDuke.
- A Guide to Elementary Number Theory
by Underwood Dudley.
- Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics
by Dan Simovici and Chabane Djeraba.
- Vol 42, No. 1, 2011
42-1.pdf
- Proceedings from the Gatherings for Gardner Conference.
Edited by a variety of people.
Review by William Gasarch.
- Comprehensive Mathematics for Computer Scientists 1
by Guerino Mazzola, Gerard Milmeister, Jody Weissmann.
Review by Sage LaTorra.
- Creative Mathematics by Hubert Wall.
Review by Jason Dyer.
- Nonlinear Integer Programming
by Duan Li and Xiaoling Sun.
Review by Justin Melvin.
- Complex Social Networks by
Fernando Vega-Redondo.
Review by Carl Kingsford.
- The Calculus of Computation:Decision Procedures with Applications to Verification
by Aaron Bradley and Zohar Manna.
Review by Carlo Furia.
- Algorithms on Strings
by Crochemore, Hanchart and Lecroq.
Review by Yiorgos Adamopoulos.
- A View from the Top:Analysis, Combinatorics and Number Theory
by Alex Iosevich.
Review by Yannis Haralambous.
- Geometric Folding Algorithms
by Eric Demaine and Joseph O'Rourke.
Review by Brittany Terese Fasy and David Millman.
- Geometric Algebra: An Algebraic System for Computer Games and Animation
by John Vince.
Review by Brittany Terese Fasy and David Millman.
- Dude, Can You Count?
by Christian Constanda.
Review by William Gasarch.
- 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).
- 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.
- The Question and Godel's Lost Letter
by Richard Lipton.
Review by William Gasarch.
- The Pea and the Sun: A Mathematical Paradox
by Leonard Wapner.
Review by William Gasarch.
- Coding for Data and Computer Communications by
by David Salomon.
Review by David Werden.
- Binary Quadratic Forms: An Algorithmic Approach by
by Johannes Buchmann and Ulrich Vollmer.
Review by Graham Coleman.
- Elliptic Curves by
Lawrence Washington.
Review by David Chen.
- Concurrent Zero-Knowledge
by Alon Rosen.
Review by Sarvagya Upadhyay.
- Introduction to Cryptography
by Hans Delfs and Helmut Knebl.
Review by Cillian Murphy.
- Introduction to Modern Cryptography by
Jonathan Katz and Yehuda Lindell.
Review by Ben Fulton.
- An Introduction to Mathematical Cryptography
by Jeffrey Hoffstein, Jill Pipher, and Joseph Silverman.
Review by Sarah Meiklejohn.
- Software Abstractions: Logic, Language and Analysis
by Daniel Jackson.
Review by Andrew Lee.
- Vol 41, No. 3, 2010
41-3.pdf
- 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).
- Mathematical Treks: From Surreal Numbers to Magic Circles
by Ivars Peterson.
Review by William Gasarch.
- Decisions and Elections: Explaining the Unexpected.
by Donald Saari.
Review by David Pritchard.
- The Mathematics of Voting and Elections: A Hands-On Approach
by Jonathan Hodge and Richard Klima.
Review by Mark Wilson.
- Branching Programs and Binary Decision Diagrams: Theory and Applications
by Ingo Wegener.
Review by Samuel Johnson.
- Quantum Computer Science: An Introduction
by N. David Mermin.
Review by Eleanor Rieffel.
- Cryptographic Applications of Analytic Number Theory:
Lower Bounds and Pseudorandomness
by Igor Shparlinski.
Review by Jeffrey Shallit.
- 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.
- The Space and Motion of Communicating Agents
by Robin Milner.
Review by Nick Papanikolaou.
- Vol 41, No. 2, 2010
41-2.pdf
- Analytic Combinatorics
by
Philippe Flajolet and Robert Sedgewick.
Review by Miklós Bóna.
- Combinatorics The Rota Way
by Joesph Kung, Gian-Carlo Rota and Catherine Yan.
Review by John Mount.
- A Course in Enumeration by
Martin Aigner.
Review by Peter Boothe.
- A Combinatorial Approach to Matrix Theory And Its Applications
by Richard Brualdi and Dragos Cvetkovic.
Review by Miklós Bóna.
- The Annotated Turing
by Charles Petzoid.
Review by Kevin Wilson.
- 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!
- Proof and Other Dilemmas: Mathematics and Philosophy
Edited by Bonnie Gold & Roger Simons.
Review by Christopher Pincock.
- Essays in Constructive Mathematics
by Harold Edwards.
Review by Severino Coutinho.
- Is Mathematics Inevitable? A Miscellany
Edited by Underwood Dudley.
Review by José Guimarães.
- A Concise Introduction To Languages and Machines
by Alan Parkes.
Review by Mike Williams.
- A Second Course in Formal Languages and Automata Theory
by Jeffrey Shallit.
Review by Kevin Wilson.
- Automata Theory with Modern Applications
by James Anderson.
Review by Kyriakos Sgarbas.
- 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 /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).
- Vol 41, No. 1, 2010
41-1.pdf
- 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
- Advanced Data Structures by Peter Brass.
Review by Richard Jankowski.
- The Burrows-Wheeler Transform:
Data Compression, Suffix Arrays, and Pattern Matching
by Donald Adjeroh, Timothy Bell and Amar Mukherjee.
Review by Shoshana Neuburger.
- Curve and Surface Reconstruction: Algorithms with Mathematical Analysis
by Tamal Dey.
Review by Matthew Sottile.
- Concentration of Measure for the Analysis of Randomized Algorithms
by Devdatt Dubhashi and Alessandro Panconesi.
Review by Aravind Srinivasan.
- The Modern Algebra of Information Retrieval
by Sandor Dominich.
Review by John Griffin.
- Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
by Yoav Shoham and Kevin Leyton-Brown.
Review by Haris Aziz.
- The Political Mapping of Cyberspace by
Jeremy Crampton.
Review by Rajesh Natarajan.
- The Princeton Companion to Mathematics
by Timothy Gowers, June Barrow-Green and Imre Leader.
Review by Haris Aziz.
- Computer Viruses and Malware
by John Aycock.
Review by Michael Sanford.
- Formal Correctness of Security Protocols by
Giampaolo Bella.
Review by Yannis Stamatiou.
- Computability of Julia Sets
by Mark Braverman and Michael Yampolsky.
Review:by Wesley Calvert.
- Vol 40, No. 4, 2009
40-4.pdf
- Quantum Computation and Quantum Communication: Theory and Experiments.
by Mladen Pavicic.
Review: George Hacken.
- Quantum Computing for Computer Scientists
By Noson Yanofsky and Mirco Mannucci.
Review by Severino Coutinho.
- Biologically Inspired Algorithms for Financial Modelling
by Anthony Brabazon, Michael O'Neil.
Review by Brad Kyer.
- The Handbook of Bioinspired Algorithms and Applications
Editors of Book: Stephan Olariu and Albert Zomaya.
Review by Kushal Chakrabarti.
- Theoretical and Experimental DNA Computation.
By Martyn Amos.
Review by Maulik Dave.
- Coding for Data and Computer Communications
By David Salomon.
Review by Fatima Talib.
- Vol 40, No. 4, 2009
40-4.pdf
- Quantum Computation and Quantum Communication: Theory and Experiments.
by Mladen Pavicic.
- Quantum Computing for Computer Scientists
by Noson Yanofsky and Mirco Mannucci.
- Biologically Inspired Algorithms for Financial Modelling
by Anthony Brabazon, Michael O'Neil.
- The Handbook of Bioinspired Algorithms and Applications
Edited by Stephan Olariu and Albert Zomaya.
- Theoretical and Experimental DNA Computation.
By Martyn Amos.
- Coding for Data and Computer Communications
by by David Salomon.
- Vol 40, No. 3, 2009.
40-3.pdf
- 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).
- Combinatorics and Graph Theory
by Harris, Hirst, Mossinghoff.
Review by Miklós Bóna.
- Algorithmic Combinatorics on Partial Words
by Francine Blanchet-Sadri.
Review by Miklós Bóna .
- An Introduction to Difference Equations, Third Edition
by Saber Elaydi.
Review by Adel El-Atawy.
- Random Graphs (Second Edition)
by Béla Bollobás.
Review by Miklós Bóna.
- Chases and Escapes
by Paul Nahin.
Review by Eowyn Cenek.
- Vol 40, No 2, 2009
40-2.pdf
- How to Think about Algorihtms
by Jeff Edmonds.
Review by Kryiakos Sgarbas.
- 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).
- Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms
by Juraj Hromkovic.
Review by Marious Mavronicolas.
- Theoretical Aspects of Local Search
by Michiels, Aarts, and Korst.
Review by Jakub Marecek.
- The Traveling Salesman Problem: A Computational Study
by Applegate, Bixby, Chvatal, and Cook.
Review by William Springer.
- Visibility Algorithms in the Plane
by Ghosh.
Review by Alice Dean.
- A Course on the Web Graph
by Anthony Bonato.
Review by Elisa Schaeffer.
- Higher Arithmetic
by Edwards.
Review by Brittany Terese Fasy and David Millman.
- Vol 40, No 1, 2009
40-1.pdf
- Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion
by Hal Abelson, Ken Ledeen, and Harry Lewis.
Review by William Gasarch.
- Solving polynomial equation systems II: Macaulay's paradigm and Gröbner technology
by Teo Mora.
Review by Severino Coutinho.
- How To Prove It: A Structured Approach
by Daniel Velleman.
Review by Brent Smith.
- Practical Optimization: Algorithms and Engineering Applications
by Andreas Antoniou and Wu-Sheng Lu.
Review by Brian Borchers.
- Rock, Paper, Scissors: Game Theory for Everyday Life
by Len Fisher.
Review by William Gasarch.
- Vol 39, No 4, 2008.
39-4.pdf
- Combinatorial Designs: Constructions and Analysis
by Douglas Stinson.
Review by Gregory Taylor.
- Combinatorics of Permutations by
Miklós Bóna.
Review by Gregory Taylor.
- Enumerative Combinatorics by
Charalambos Charalambides.
Review by Sergey Kitaev.
- Geometric Algebra for Computer Science by
Leo Dorst, Dorst Fontijne, and Stephen Mann.
- Privacy on the Line: The Politics of Wiretapping and Encryption
by Whitfield Diffie and Susan Landau.
Review by Richard Jankowski.
- Vol 39, No 3, 2008.
39-3.pdf
- Combinatorial Optimization: Packing and Covering
by Gérard Cornuéjols.
Review by Brian Borchers.
- 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).
- Applied Combinatorics on Words
by M. Lothaire.
Review by Maulik Dave.
(Note- M. Lothaire is a pseudonym of a group of mathematicians
who work on combinatorics on words and have some joint books.)
- Computation engineering: applied automata theory and logic
by Ganesh Lalitha Gopalakrishnan.
Review by Severino Coutinho.
- Vol 39, No 2, 2008.
39-2.pdf
- The Art of Computer Programming
Volume 4, Fascicles 2, 3, and 4
by Donald Knuth.
Review by John Rogers.
- A Course in Computational Algebraic Number Theory
By Henri Cohen.
Review by Timothy Kelley.
- Foundations of Computer Security
by David Salomon.
Review by Richard Jankowski.
- Derivation and Computation: taking the Curry-Howard correspondence seriously
by Harold Simmons.
Review by Robert Irwin.
- Theoretical and Experimental DNA Computation
By Martyn Amos.
Review by Maulik Dave.
- Vol 39, No 1, 2008
39-1.pdf
- Cryptography in C and C++
by Michael Welschenbach.
Review by S Terai.
- A Beginner's Guide to Discrete Mathematics
by Walter Wallis.
Review by James Rauff.
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
Edited by Henri Cohen and Gerhard Frey.
Review by Lawrence Washington.
- The Game's Afoot: Game Theory in Myth and Paradox
by Alexander Mehlmann.
Review by Danny Krizanc.
- Introducing Game Theory and Its Applications
by Eliott Mendelson, and
- Game Theory and Strategy
by Philip Straffin.
Joint Review by William Springer (two books).
- Semantic Integration of Heterogeneous Software Specifications
by Martin Grobe-Rhode.
Review by Maulik Dave.
- Vol 38, No 4, 2007
38-4.pdf
- The Access Principle
by John Willinsky.
Review by Scott Aaronson.
- A Century of Scientific Publishing: A collection of essays
Edited by Fredriksson.
Review by William Gasarch.
- Mathematics of Physics and Engineering
by
Edward Blum and Sergey Lototsky.
Review by Frederic Green.
- Research Problems in Discrete Geometry
by Brass, Moser, Pach.
Review by William Gasarch.
- Vol 38, No 3, 2007
38-3.pdf
- The Political Mapping of Cyberspace
by Jeremy Crampton.
Review by Rajesh Natarajan.
- Probability and Computing: Randomized Algorithms and Probabilitic Analysis
by Michael Mitzenmacher and Eli Upfal.
Review by Jonathan Katz
Review by Yannis Stamatiou.
- Computational Techniques of the Simplex Method
by István Maros.
Review by Brian Borchers.
- Vol 38, No 2, 2007
38-2.pdf
- Symbolic Asymptotics
by John Shackell.
Review by James Beaumont.
- Complexity and Cryptography. An Introduction
by John Talbot and Dominic Welsh.
Review by Jörg Rothe.
- Complexity Theory and Cryptology: An Introduction to Cryptocomplexity
by Jörg Rothe.
Review by Piotr Faliszewski.
- Three Blogs by Theorists.
The blogs are by Lance Fortnow, Scott Aaronson, and Luca Trevisan.
Review of these three blog by William Gasarch.
- Vol 38, No 1, 2007
38-1.pdf
- 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 Alexi Kitaev, Alexander Shen, and Mikhail Vyalyi.
Joint Review by Ronald de Wolf (three books).
- Introduction to Lattices and Order
by Brian Davey, Hilary Priestley.
Review by Jonathan Cohen.
- Computational Techniques for the Summation of Series
by Anthony Sofo.
Review by Vladik Kreinovich.
- Vol 37, No 4, 2006
37-4.pdf
- Types and Programming Languages by Benjamin Pierce.
Review by Mats Kindah.
- Information Theory, Inference, and Learning Algorithms
by David MacKay.
Review by Maulik Dave.
- Verification of Reactive Systems : Formal Methods and Algorithms
by Klaus Schneider.
Review by Maulik Dave.
- Algorithmic Learning in a Random World
by Vovk, Gammerman, and Shafer.
Review by James Law.
- The Random Projection Method
by Santosh Vempala.
Review by Aravind Srinivasan.
- 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 : 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.)
- 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.)
- Vol 37, No 2, 2006
37-2.pdf
- Fair Division and Collective Welfare
by Hervé Moulin.
Review by Varsha Dani.
- Algorithms: Sequential, Parallel, and Distributed
by Kenneth Berman and Jerome Paul.
Review by William Schmeister.
- Algebraic Complexity Theory
by Peter Burgisser, 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.)
- Vol 37, No 1, 2006
37-1.pdf
- 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.
- Introduction to Coding Theory
by Juerjen Bierbrauer.
Review by William Springer.
- Codes: The Guide to Secrecy from Ancient to Modern Times
by Richard Mollin.
Review by Adam Bender.
- Computational Complexity: a Quantitative Perspective
by Marius Zimand.
Review Carlos Oliveira.
- Secure Communicating Systems : Design, analysis, and implementation
by Michael R A Huth.
Review by Maulik Dave.
- Alfred Tarski: Life and Logic by
Anita Burdman Feferman and Solomon Feferman.
Review by Pierre Lescanne.
- Vol 36, No 4, 2005
36-4.pdf
- 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.
- Genomic Perl: From Bioinformatics Basics to Working Code
by Rex Dwyer.
Review by Raymond Wan.
- Graphs, Networks, and Algorithms
by Dieter Jungnickel.
Review by William Fahle.
- Immunocomputing: Principles and Applications
by Alexander Tarakanov, Victor Skormin, Svetlana Sokolova.
Review by Wenzhong Zhao.
- Term Rewriting Systems
by Terese.
Review by Frederic Loulergue.
- Vol 36, No 3, 2005
36-3.pdf
- Classical and Quantum Computing with C++ and Java Simulations
by Yorick Hardy and Willi-Hans Steeb.
Review by Nick Papanikolaou.
- Integer Programming
By Laurence Wolsey.
Review by E. Jonathan Chapin.
- Computational Line Geometry
by Helmut Pottmann and Johannes Wallner.
Review by Georg Essl.
- Logic for Computer Scientists
by Uwe Schoning.
Review by Riccardo Pucella.
- Teaching Statistics Using Baseball
by Jim Albert.
Review by James Glenn.
- Vol 36, No 2, 2005
36-2.pdf
- Cryptological Mathematics
by Robert Lewand.
Review by William Gasarch.
- Data Privacy and Security
by David Salomon.
Review by Nick Papanikolaou.
- Cryptography: An Introduction by V.V. Yaschenko,
- Cryptanalysis of Number Theoretic Ciphers by Samuel Wagstaff, Jr.,
- RSA and Public-Key Cryptography by Richard Mollin, and
- Foundations of Cryptography, Vol. 1: Basic Tools, by Oded Goldreich.
Joint Review by Jonathan Katz (four books).
- Vol 36, No 1, 2005
36-1.pdf
- Proofs that Really Count:
The Art of Combinatorial Proof
by Arthur Benjamin and Jennifer Quinn.
Review by William Gasarch.
- 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).
- Vol 35, No 4, 2004
35-4.pdf
- Boolean Functions and Computation Models
by Clote and Kranakis.
Review by R. Gregory Taylor.
- Selected Papers in Discrete Mathematics
by Donald Knuth.
Review by Carlos Oliveira.
- Linear Optimization and Extensions - Problems and Solutions
by Dimitris Alevas and Manfred Padberg.
Review by Carlos Oliveira.
- Introduction to the Design and Analysis of Algorithms
By Ananay Levitin.
Review by William Fahle.
- Vol 35, No 3, 2004
35-3.pdf
- Handbook of Graph Theory
Edited by Gross and Yellen.
Review by William Gasarch.
- Reasoning about Uncertainty
by Joseph 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 Smola.
Joint Review by Luc Wille (two books).
- Essentials of Constraint Programming
by Thom Fruhwirth and Slim Abdennadher
Review by Carlos Oliveira.
- Vol 35, No 2, 2004
35-2.pdf
- Concurrent and Real-time Systems: The CSP Approach
by Steve Schneider.
Review by Sabina Petride.
- Introduction to Languages, Machines and Logic: Computable Languages, Abstract Machines and Formal Logic
by Alan Parkes.
Review by Robert McNaughton.
- Algorithm Design: Foundations, Analysis and Internet Examples
by Michael Goodrich and Roberto Tamassia.
Review by Pavol Navrat.
- Theory of Semi-Feasible Algorithms
by Lane Hemaspaandra and Leen Torenvliet.
Review by Lance Fortnow.
- Vol 35, No 1, 2004
35-1.pdf
- The Classical Decision Problem
by Egon Börger, Erich Grädel and Yuri Gurevich.
Review by Dan Simovici.
- Automata theory and its applications
by Bakhadyr Khoussainov and Anil Nerode.
Review by Lawrence Moss and Hans-Jörg Tiede.
- Automata, Logics, and Infinite Games
edited by Erich Grädel, Wolfgang Thomas, and Thomas Wilke.
Review by Lawrence Moss and Hans-Jörg Tiede
- Automatic sequences: Theory, Applications, Generalizations
by Jean-Paul Allouche and Jeffrey Shallit.
Review by Jean Berstel.
- Vol 34, No 4, 2003
34-4.pdf
- Introduction to Cryptography
by Johannes Buchmann.
Review by Andrew Lee.
- Coding Theory and Cryptography: The Essentials, Second Edition
by Darrel Hankerson, Gary Hoffman, Douglas Leonard,
Charles Lindner, Kevin Phelps, Chris Rodger, James Wall.
Review by Robert Irwin.
- Cryptography: Theory and Practice
by Douglas Stinson.
Review by William Springer.
- Foundations of Cryptography: Basic Tools
by Oded Goldreich
Review by Riccardo Pucella.
- Modelling and Analysis of Security Protocols
by P. Ryan and S. Schneider
Review by Riccardo Pucella.
- Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Algorithms and Combinatorics, Vol 17)
by Oded Goldreich.
Review by Andrew Lee.
- Vol 34, No 3, 2003
34-3.pdf
- Set Theory For Computing: From Decision Procedures to Declarative Programming with Sets
by Domenico Cantone, Eugenio Omodeo and Alberto Policriti.
Review by Robert Irwin.
- Theory of Computational Complexity
by Ding-Zhu Du and Ker-I Ko.
Review by Eowyn Cenek.
- Computer Arithmetic Algorithms: A review
by Israel Koren.
Review by George Constantinides
- An Introduction to Quantum Computing Algorithms
by Arthur Pittenger.
Review by Andrea Marchini.
- Vol 34, No 2, 2003
34-2.pdf
- Algorithms Sequential & Parallel: A Unified Approach
by R. Miller & L. Boxer.
Review by Anthony Widjaja To.
- Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
by Juraj Hromkovic.
Review by Hassan Masum.
- Modal and Temporal Properties of Processes
by Colin Stirling.
Review by Vicky Weissman.
- Modal Logic
by Patrick Blackburn, Maarten de Rijke, and Yde Venema.
Review by P. Daniel Hestand.
- Vol 34, No 1, 2003
34-1.pdf
- Number Theory for Computing
by Song Yan.
Review by Prodromos Saridis.
- Type-Logical Semantics
by Bruce Carpenter.
Review by Riccardo Pucella and Stephen Chong.
- The -calculus: A Theory of Mobile Processes
by Davide Sangiorgi and D. Walker.
Review by Riccardo Pucella.
- Vol 33, No 4, 2002
33-4.pdf
- Bioinformatics: The Machine Learning Approach
by Pierre Baldi and Soren Brunak.
Review by Ivelin Ivanov.
- The Clausal Theory of Types
by David Wolfram (Not to be confused with Stephen Wolfram, whose
book is also reviewed in this column.)
Review by Maulik Dave.
- Discrete Mathematical Problems with Medical Applications (DIMACS Volume 55)
Edited by Ding-Zu Du, Panayote Pardalos, and J. Wang.
Review by Suresh Venkatasubramanian.
- Things a Computer Scientist Rarely Talks About
by Donald Knuth.
Review by Ian Parberry.
- A New Kind of Science
by Stephen Wolfram.
Review by Hassan Masum.
- Vol 33, No 3, 2002
33-3.pdf
- Modern Computer Algebra
by Joachim von zur Gathen and Jürgen Gerhard.
Review by R. Gregory Taylor.
- The Discrepancy Method --Randomness and Complexity
by Bernard Chazelle.
Review by Jin-Yi Cai.
- Computability and Complexity Theory by Steven Homer and Alan Selman, and
- The Complexity Theory Companion by Lane Hemaspaandra and Mitsunori Ogihara.
Joint Review by Eowyn Cenek (two books).
- Mathematical Theory of Domains by
Viggo Stoltenberg-Hansen, Ingrid Lindström, and Edward Griffor.
Review by P. Daniel Hestand.
- Vol 33, No 2, 2002
33-2.pdf
- Model Checking
by Edmund Clarke, Jr., Orna Grumberg, and Doron Peled.
Review by Vicky Weissman.
- Petri Net Algebra
by Eike Best, Raymond Devillers, Maciej Koutny.
Review by Ivelin Ivanov.
- Combinatorial Optimization - Theory and Algorithms
by Bernhard Korte and Jens Vygen
Review by Ivelin Ivanov.
- Calculated Bets by Steven Skiena.
Review by William Gasarch.
- Vol 33, No. 1, 2002
33-1.pdf
- Algorithmic Geometry
by Jean-Daniel Boissonat and Mariette Yvinec.
Review by Eowyn Cenek.
- Branching Programs and Binary Decision Diagrams: Theory and Applications
by Ingo Wegener.
Review by Lance Fortnow.
- Networks in Distributed Computing (DIMACS proceedings)
Edited by Marios Mavronicolas, Michael Merritt, and Nir Shavit.
Review by Ivelin Ivanov.
- Graph Theory and Its Applications
by Jonathan Gross and Jay Yellen.
Review by David Marcus.
- Graph Theory by William Tutte.
Review by Christopher Jennings.
- Data Refinement: Model-Oriented Proof Methods and Their Comparison
by Willem-Paul de Roever and Kai Engelhardt.
Review by Dan Hestand.
- 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.
- Vol 32, No. 4, 2001
32-4.pdf
- Proofs and Confirmations: the story of the alternating sign matrix conjecture ,
by David Bressoud.
Review by Jeremy Avigad.
- Proofs and Refutations by Imre Lakatos.
Review by William Gasarch.
- Dynamic Logic (Foundations of Computing)
by David Harel, Dexter Kozen and Jeryz Tiuryn.
Review by Riccardo Pucella.
- Analysis of Algorithms:An Active Learning Approach
by Jeffrey McConnell.
Review by Christopher Jennings
- Vol 32, No 3, 2001
32-3.pdf
- Automata and Languages: Theory and Applications
by Alexander Meduna.
Review by James Rauff.
- Control Flow Semantics ,
by J. de Bakker and E. de Vink.
Review by Riccardo Pucella.
- 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.
- - 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).
- Vol 32, No 2, 2001
32-2.pdf
- The Codebreakers: The story of secret writing ,
by David Kahn
Review by William Gasarch.
- The Code Book:
The Evolution of Secrecy from Mary Queen of Scots to Quantum Cryptography ,
by Simon Singh.
Review by Jim Reeds.
- Basic Proof Theory
by Anne Troelstra and Helmut Schwichtenberg.
Review by Jeremy Avigad.
- Complexity and Real Computation
by Lenore Blum, Felipe Cucker, Michael Shub, and Steven Smale.
Review by Tim McNicholl.
- Vol 32, No. 1, 2001
32-1.pdf
- Data Structures and Algorithms in Java (2nd ed)
by Michael T Goodrich and Roberto Tamassia.
Review by Hassan Masum.
- Selected Papers on Analysis of Algorithms by Donald Knuth.
Review by Timothy McNicholl.
- How to Solve It: Modern Heuristics
by Zbigniew Michalewicz and David B Fogel.
Review by Hassan Masum.
- Proof, Language, and Interaction: Essays in Honour of Robin Milner
Edited by Plotkin, Stirling and Tofte.
Review by Riccardo Pucella.
- 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).
- Computational Geometry: Algorithms and Applications (2nd Ed)
by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf.
Review by Hassan Masum.
- Parameterized Complexity ,
by Downey and Fellows.
Review by Gabriel Istrate.
- Modern Graph Theory
by Bollobás.
Review by Eowyn Cenek.
- AB
by Marko Petkovšek, Herbert Wilf, and Doron Zeilberger.
Review by Vladik Kreinovich.
- Communicating and mobile systems: the -calculus
by Robin Milner.
Review by Riccardo Pucella.
- 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).
- Theory of Computing: A Gentle Introduction
by Efim Kinber and Carl Smith.
Review by Judy Goldsmith.
- Microsurveys in Discrete Probability (Proceedings from a DIMACS workshop)
edited by David Aldous and James Propp.
Revie by Hassan Masum.
- Term Rewriting and all that
by Franz Baader and Tobias Nipkow.
Review by Paliath Narendran.
- Vol 31, No. 2, 2000
31-2.pdf
- Gems of Theoretical Computer Science
by Uwe Schonig and Randall Pruim.
Review by Danny Krizanc.
- Network Design: Connectivity and Facilities Location, DIMACS Workshop
edited by Pardalos and Du.
Review by Boris Goldengorin.
- The Optimal Implementation of Functional Programming Languages
by Andrea Asperti and Stefano Guerrini.
Review by Christopher League.
- 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.
- Vol 31, No. 1, 2000
31-1.pdf
- 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.
- Hilbert's Tenth Problem ,
by Yuri Matiyasevich.
Review by Randall Pruim.
- Lambda Calculi: A Guide for Computer Scientists by
Chris Hankin.
Review by Christopher League.
- Systems that Learn (second edition)
by Jain, Osherson, Royer, Sharma.
Review by Carl Smith.
- Vol 30, No. 4, 1999
30-4.pdf
- Mathematical Support for Molecular Biology
edited by
Martin Farach-Colton, Fred Roberts,
Martin Vingron, and Michael Waterman.
Review by Chrystopher Nehaniv.
- DNA Based Computers II,
edited by Lauara Landweber and Eric Baum.
Review by Mitsunori Ogihara and Animesh Ray.
- DNA Based Computers III
edited by Harvey Rubin and David Harlan Wood.
Review by Martyn Amos.
- Online Computation and Competitive Analysis by
Allan Borodin and Ran El-Yaniv.
Review by Neal Young.
- Vol 30, No. 3, 1999
30-3.pdf
- Computational geometry in C (Second Edition) ,
by Joseph O'Rourke.
Review by Michael Dekhtyar.
- Bounded Queries in Recursion Theory
by William Gasarch and Georgia Martin.
Review by Lance Fortnow.
- Logic For Applications (Second Edition) ,
By Anil Nerode and Richard Shore.
Review by Alexander Dekhtyar.
- Vol 30, No. 2, 1999
30-2.pdf
- Algorithms and Theory of Computation Handbook
edited by Atallah.
- Handbook of Combinatorics (in two Volumes)
edited by Graham, Grötschel, Lovász.
- Probabilistic Combinatorics and Its Applications,
ed. by Bollobás.
- Spectral Graph Theory
by Chung.
- Vol 30, No. 1, 1999
30-1.pdf
- Stable Marriage and its Relation to Other Combinatorial
Problems: An Introduction to Algorithm Analysis
by Donald Knuth.
Review by Tim McNichol.
- The Limits of Mathematics by
Gregory Chaitin.
Review by Vladimir Tasic.
- Privacy on the Line by
Whitfield Diffie and Susan Landau.
Review by Joseph Maklevitch.
- A Theory of Objects by
Authors: Marti n Abadi and Luca Cardelli.
Review by Brian Postow.
- Vol 29, No. 4, 1998.
29-4.pdf
- Cryptology and Computational Number Theory by Carl Pomerance.
Review by Andreas Stein.
- Theories of Computability
by Nick Pippenger.
Review by Sanjay Gupata.
- Vicious Circles by
Barwise and Moss.
Review by Alexander Dekhtyar.
- Vol 29, No 3, 1998.
29-3.pdf
- Algorithms on strings, trees, and sequences:
computer science and computational biology
by Dan Gusfield.
Review by Gary Benson.
- Verification of Sequential and Concurrent Programs
by Krzysztof Apt and Ernst-Rüdiger Olderog.
Review by Anish Arora.
- Algorithms and Programming: Problems and Solutions
by Alexander Shen.
Review by Jerry James.
- Vol 29, No. 2 1998.
29-2.pdf
- Approximation Algorithms for NP-hard Problems ,
Edited by Dorit Hochbaum.
Review by Randeep Bhatia and Yoram Sussmann.
- Selected Papers on Computer Science
by Donald Knuth.
Review by Samir Khuller.
- Communication Complexity
by Eyal Kushilevitz and Noam Nisan.
Review by William Gasarch.
- Vol 29 No. 1 1998
29-1.pdf
- Complexity Theory Retrospective II,
edited by Lane Hemaspaandra and Alan Selman.
Review by Eric Allender.
- Basic Simple Type Theory
by J. Roger Hindley.
Review by Brian Postow.
- Discrete Mathematics in the Schools,
Edited by Joseph Rosenstein, Deborah Franzblau, and
Fred Roberts.
Review by Neal Koblitz.
- Vol 28 No. 4 1997
28-4.pdf
- Metamathematics, Machines, and Godel's Proof
by N. Shankar.
Review by K. Purang.
- Reasoning About Knowledge
by Ronald Fagin, Joseph Halpern, Yoram Moses and Moshe Vardi.
Review by Alexander Dekhtyar.
- Isomorphisms of Types:
From -calculus to information retrieval and
language design
by Roberto Di Cosmo.
Review by Christopher League.
- Vol 28 No. 3, 1997
28-3.pdf
- An intro. to Kolg. Comp by Vitanyi, Li.
Review by William Gasarch
Next: About this document ...
Bill Gasarch
2015-06-03