Next: About this document ...
 Vol 44, No 4, 2013
444.pdf
 Vol 43, No 3, 2013
443.pdf
 Vol 44, No 2, 2013
442.pdf
 Joint review of
How to Solve It: A New Aspect of Mathematical Method by Polya and the new
StreetFighting Mathematics by Mahajan. Review by Mohsen Vakilian.
 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 V. 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 A. De Lorea, Jörg Rambau, and Francisco Santos. Review by Michael Murphy.
 Flows in Networks
by L. R. Ford Jr. and D. R. Fulkerson. Review by Yixin Cao.
 Quantum Computing  A Gentle Introduction
by Eleanor Rieffel and Wolfgang Polak. Review by Kyriakos N. Sgarbas.
 The Art of Computer Programming: Volume 4A by Donald E. Knuth. Review by John D. Rogers.
 Boolean Function Complexity: Advances and Frontiers by Stasys Jukna. Review by William Gasarch.
 Vol 44, No 1, 2013
441.pdf
 P, NP, and NPCompleteness by Oded Goldreich. Review by S.V.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 JeanFrançois Blanchette. Review by Harry Lewis.
 Boolean Models and Methods in Mathematics, Computer Science, and Engineering Edited by Yves Crama and Peter L. 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 C. Wilson.
 Applied Information Security by David Basin, Patrick Schaller, and Michael Schläpfer. Review by Jonathan Katz.
 Introduction to BioOntologies by Peter N. Robinson and Sebastian Bauer.
 The Dots and Boxes Game: Sophisticated Child's Play by Elwyn Berlekamp. Review by Omar Shehab.
 Vol 43, No 4, 2012
434.pdf
 Algorithmic Cryptanalysis. By Antoine Joux.
 Algorithmic Bioprocesses. Edited by Condon, Harel, Kok, Salomaa, Winfree.
 Vehicular Networks, from Theory to Practice. Edited by Stephan Olariu and Michele C. Weigle.
 Graph Theory and Interconnection Networks. By LihHsing Hsu and ChengKuan Lin.
 Transitions and Trees: An Introduction to Structural Operational Semantics. By Hans Hüttel.
 Origins and Foundations of Computing. By Friedrich L. Bauer. Review by Haim Kilov.
 Introduction to Scheduling. Edited by Yves Robert and Frederic Vivien.
 Semantic Techniques in Quantum Computation. Edited by Simon Gay and Ian Mackie.
 Modern Computer Arithmetic. By Richard Brent and Paul Zimmermann.
 Vol 43, No 3, 2012
433.pdf
 Combinatorial Games: TicTacToe Theory
by Jozsef Beck.
 Algorithmic Adventures: From Knowledge to Magic
by Juraj Hromkovic.
 Applied Algebra: Codes, Ciphers and Discrete Algorithms
by Darel W. Hardy, Fred Richman, and Carol L. Walker.
 Models of Computation  An Introduction to Computability Theory
by Maribel Fernández.
 Handbook of weighted Automata
Edited by Manfred Droste, Werner Kuich and Heiko Vogler.
 Matching Theory
by László Lovász and Michael D. Plummer.
 Introduction to Mathematics of Satisfiability
by Victor W. Marek.
 Elements of Automata Theory
by Jacques Sakarovitch.
 Combinatorial Pattern Matching Algorithms
in Computational Biology Using Perl and R
by Gabriel Valiente.
 In Pursuit of the Traveling Salesman by
William J. Cook.
 Permutation Patterns
Edited by Steve Linton, Nik Ruškuc, Vincent Vatter.
 Vol 43, No 2, 2012
432.pdf
 A Concise Introduction to Data Compression
by David Salomon.
 Parallel Algorithms
by Henri Casanova, Arnaud Legrand, and Yves Robert.
 Polynomia And Related Realms
by Dan Kalman.
 Biscuits of Number Theory
Edited by Arthur T. Benjamin and Ezra Brown.
 Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures
by János Pach and Micha Sharir.
 Handbook of LargeScale Random Networks
Edited by : Bela Bollobás, Robert Kozma and Deszo Miklós.
 Algorithms and Theory of Computation Handbook
Edited by : Mikhail J. Atallah and Marina Blanton.
 Primality testing and integer factorization in public key cryptography
by Song Y. Yan.
 Process Algebra: Equational Theories of Communicating Processes
by J. C. M. Baeten, T. Basten, and M. A. Reniers.
 Insider Threats in Cyber Security
Edited by Probst, Hunker, Gollman, and Bishop.
 Vol 43, No. 1, 2012
431.pdf
 The Cryptoclub: Using Mathematics to Make and Break Secret Codes
by Janet Beissinger and Vera Pless.
 Cryptanalytic Attacks on RSA
by Song Y. Yan.
 Cryptanalysis of RSA and its variants
by Jason Hinek.
 Understanding and Applying Cryptography and Data Security
by Adam J. Elbirt
 Efficient Secure TwoParty Protocols: Techniques and Constructions
by Carmit Hazay and Yehuda Lindell.
 Theory of Computation
by Dexter C. Kozen.
 Codes: an introduction to information communication and cryptography
by Normal L Biggs.
 Finite Fields and Applications
by Gary L. Mullen and Carl Mummert
 The Life and Times of the Central Limit Theorem
by William J. Adams.
 Pearls of Discrete Mathematics
by Martin Erickson.
 Design Theory
by C. C. Lindner and C. A. Rodger.
 An Introduction to the History of Algebra:
Solving Equations from Mesopotamian Times to the Renaissance
 Vol 42, No. 4, 2011
424.pdf
 Foundations of Logic and Mathematics:
Applications to Computer Science and Cryptography
by Yves Nievergelt.
 Rippling: MetaLevel Guidance For Mathematical Reasoning
by Alan Bundy, David Basin, Dieter Hutter, and Andrew Ireland.
 Handbook of NatureInspired and Innovative Computing
Edited by Albert Y. Zomaya.
 Algorithms and Data Structures: The Basic Toolbox
by Kurt Mehlhorn and Peter Sanders.
 The Algorithm Design Manual (Second Edition)
By Steven S. Skiena.
Reviewed by Neelakantan Kartha.
 Graph Theory: A Problem Oriented Approach
by Daniel Marcus.
 Proofs from THE BOOK (4th edition)
by Martin Aigner and Günter M. Ziegler.
 Handbook of Chemoinformatics Algorithms
Edited by Faulon, Bender.
 Dynamic Fuzzy Logic and its Applications
by Fanzhang.
 Vol 42, No 3, 2011
423.pdf
 Erdos on Graphs: His Legacy of Unsolved Problems
by Fan Chung and Ron Graham.
 Roots to Research
by Judith D. Sally and Paul J. Sally, Jr.
 Chromatic Graph Theory
by Gary Chartrand and Ping Zhang.
 Applied Combinatorics
by Fred S. Roberts and Barry Tesman.
 Combinatorics, A Guided Tour
by David R. Mazur.
 Famous Puzzles of Great Mathematicians
by Miodrag S. Petkovi.
 Combinatorics  A Problem Oriented Approach
by Daniel A. Marcus.
 Probability: Theory and Examples
by Rick Durrett.
 Games, Puzzles, & Computation
by Robert A. Hearn and Erik D. Demaine.
 Vol 42, No. 2, 2011
422.pdf
 From Zero to Infinity: What Makes Numbers Interesting
by Constance Reid.
 Mathematics for the Analysis of Algorithms
by Daniel H. Greene and Donald E. Knuth.
 Algebraic Cryptanalysis by Gregory V. Bard.
 Algebraic Function Fields and Codes
by Henning Stichtenoth.
 Those Fascinating Numbers by JeanMarie 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 Pre1940 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 A. Simovici and Chabane Djeraba.
 Vol 42, No. 1, 2011
421.pdf
 Proceedings from the Gatherings for Gardner Conference.
Edited by a variety of people.
 Comprehensive Mathematics for Computer Scientists 1
by Guerino B. Mazzola, Gerard Milmeister, Jody Weissmann.
 Creative Mathematics by H.S. Wall.
 Nonlinear Integer Programming
by Duan Li and Xiaoling Sun.
 Complex Social Networks by
Fernando VegaRedondo.
 The Calculus of Computation:Decision Procedures with Applications to Verification
by Aaron R. Bradley and Zohar Manna.
 Algorithms on Strings
by Crochemore, Hanchart and Lecroq.
Yiorgos Adamopoulos.
 A View from the Top:Analysis, Combinatorics and Number Theory
by Alex Iosevich.
 Geometric Folding Algorithms
by E.D. Demaine and J. O'Rourke.
 Geometric Algebra: An Algebraic System for Computer Games and Animation
by Author: J. Vince.
 Dude, Can You Count?
by Christian Constanda.
 Vol 41, No. 4, 2010
414.pdf
 Joint review of
Computational Complexity: A Conceptual Perspective
by Oded Goldreich and
Computational Complexity: A Modern Approach
by Sanjeev Arora and Boaz Barak.
 Algorithmic Game Theory
edited by Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani.
 The
Question and Godel's Lost Letter
by Richard J. Lipton.
 The Pea and the Sun: A Mathematical Paradox
by Leonard Wapner.
 Coding for Data and Computer Communications by
by David Salomon.
 Binary Quadratic Forms: An Algorithmic Approach by
by Johannes Buchmann and Ulrich Vollmer.
 Elliptic Curves by
Lawrence C. Washington.
 Concurrent ZeroKnowledge
by Alon Rosen.
 Introduction to Cryptography
by Hans Delfs and Helmut Knebl.
 Introduction to Modern Cryptography by
Jonathan Katz and Yehuda Lindell.
 An Introduction to Mathematical Cryptography
by Jeffrey Hoffstein, Jill Pipher, and Joseph Silverman.
 Software Abstractions: Logic, Language and Analysis
by Daniel Jackson.
 Vol 41, No. 3, 2010
413.pdf
 Random Curves: Journeys of a Mathematician
by Neal Koblitz.
 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.
 Mathematical Treks: From Surreal Numbers to Magic Circles
by Ivars Peterson.
 Decisions and Elections: Explaining the Unexpected.
by Donald G. Saari.
 The Mathematics of Voting and Elections: A HandsOn Approach
by Jonathan K. Hodge and Richard E. Klima.
 Branching Programs and Binary Decision Diagrams: Theory and Applications
by Ingo Wegener.
 Quantum Computer Science: An Introduction
by N. David Mermin.
Review of Eleanor Rieffel.
 Cryptographic Applications of Analytic Number Theory:
Lower Bounds and Pseudorandomness
by Igor Shparlinski.
 When Least is Best. How Mathematicians Discovered Many Clever
Ways to Make Things as Small (or as Large) as Possible
by Paul J. Nahin.
 The Space and Motion of Communicating Agents
by Robin Milner.
 Vol 41, No. 2, 2010
412.pdf
 Analytic Combinatorics
by
Philippe Flajolet and Robert Sedgewick.
Analytic Combinatorics and defines the term and the field.
 Combinatorics The Rota Way
by Joesph P.S. Kung, GianCarlo Rota and Catherine H. Yan.
 A Course in Enumeration by
Martin Aigner.
 A Combinatorial Approach to Matrix Theory And Its Applications
by Richard Brualdi and Dragos Cvetkovic.
 The Annotated Turing
by Charles Petzoid.
 Logicomix
Text by Apostolos Doxiadis and Christos Papadimitriou!
Art by Alecos Papadatos and Annie di Donna
(This is a Comic Book.)
 Proof and Other Dilemmas: Mathematics and Philosophy
Edited by Bonnie Gold & Roger A. Simons.
 Essays in Constructive Mathematics
by Harold Edwards.
 Is Mathematics Inevitable? A Miscellany
Edited by Underwood Dudley.
 A Concise Introduction To Languages and Machines
by Alan P. Parkes.
 A Second Course in Formal Languages and Automata Theory
by Jeffrey Shallit.
 Automata Theory with Modern Applications
by James A. Anderson.
 Change is Possible: Stories of Women and Minorities in Mathematics
by Patricia Clark Kenschaft.
 Joint review of
(1) Riot at the Calc Exam and other Mathematically Bent Stories
by Colin Adams;
(2) The Great /e Debate: Which is the Best Number?
by Colin Adams VS Thomas Garrity, Moderated by Edward Burger;
(3) The United States of Mathematics: Presidential Debate
by Colin Adams VS Thomas Garrity, moderated by Edward Burger
 Vol 41, No. 1, 2010
411.pdf
 Data Structures and Algorithms Using Python and C++.
by David M. Reed and John Zelle.
 An Introduction to Data Structures and Algorithms.
by James A. Storer.
 Advanced Data Structures by Peter Brass.
 The BurrowsWheeler Transform:
Data Compression, Suffix Arrays, and Pattern Matching
by Donald Adjeroh, Timothy Bell and Amar Mukherjee.
 Curve and Surface Reconstruction: Algorithms with Mathematical Analysis
by Tamal K. Dey.
 Concentration of Measure for the Analysis of Randomized Algorithms
by Devdatt P. Dubhashi and Alessandro Panconesi.
 The Modern Algebra of Information Retrieval
by Sandor Dominich.
 Multiagent Systems: Algorithmic, GameTheoretic, and Logical Foundations
by Y. Shoham and K. LeytonBrown.
 The Political Mapping of Cyberspace by
Jeremy W. Crampton.
 The Princeton Companion to Mathematics
by Timothy Gowers, June BarrowGreen and Imre Leader.
 Computer Viruses and Malware
by John Aycock.
 Formal Correctness of Security Protocols by
Giampaolo Bella.
 Computability of Julia Sets
by Mark Braverman and Michael Yampolsky.
Review:by Wesley Calvert.
 Vol 40, No. 4, 2009
404.pdf
 Quantum Computation and Quantum Communication: Theory and Experiments.
by Mladen Pavicic.
 Quantum Computing for Computer Scientists
by Noson S. Yanofsky and Mirco A. 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 Y. Zomaya.
 Theoretical and Experimental DNA Computation.
By by M. Amos.
 Coding for Data and Computer Communications
by by David Salomon.
 Vol 40, No. 3, 2009.
403.ps,
403.pdf
 The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators
by Alexander Soifer.
 A Joint review of the following six books:
(1) Professor Stewart's Cabinet of Mathematical Curiosities
by Ian Stewart,
(2) Five Minute Mathematics by
Ehrhard Behrends,
(3) Aha Gotcha! Aha Insight!
by Martin Gardner,
(4) Origami, Eleusis, and the Soma Cube
by Martin Gardner,
(5) Hexaflexagons, Probability Paradoxes, and The Tower of Hanoi
by Martin Gardner,
(6) Group Theory in the Bedroom and Other Mathematical Diversions
by Brian Hayes.
 Combinatorics and Graph Theory
by Harris, Hirst, Mossinghoff.
 Algorithmic Combinatorics on Partial Words
by Francine BlanchetSadri.
 An Introduction to Difference Equations, Third Edition
by Saber Elaydi.
 Random Graphs (Second Edition)
by Béla Bollobás.
 Chases and Escapes
by Paul J. Nahin.
 Vol 40, No 2, 2009
402.pdf
 How to Think about Algorihtms
by Jeff Edmonds.
 A Programmer's Companion to Algorithm
Analysis
by Ernst Leiss.
 Joint review of
Algorithms
by Johnonbaugh and Schaefer
and
Algorithms
by Dasgupta, Papadimitriou,
and U. Vazirani.
 Design and Analysis of Randomized
Algorithms:
Introduction to Design
Paradigms.
by Juraj Hromkovic.
 Theoretical Aspects of Local Search
by Michiels, Aarts, and Korst.
 The Traveling Salesman Problem: A Computational Study
by Applegate, Bixby, Chvátal, and Cook.
 Visibility Algorithms in the Plane
by Ghosh.
 A Course on the Web Graph
by Anthony Bonato.
 Higher Arithmetic
by Edwards.
and
David L. Millman.
 Vol 40, No 1, 2009
401.pdf
 Blown to Bits: Your Life, Liberty, and Happiness after the digital explosion
by Hal Abelson, Ken Ledeen, and Harry Lewis.

Solving polynomial equation systems II:Macaulay
's paradigm and Gröbner technology
by Teo Mora.
 How To Prove It: A Structured Approach
by Daniel J. Velleman.
 Practical Optimization: Algorithms and Engineering Applications
by Andreas Antoniou and WuSheng Lu.
 Rock, Paper, Scissors: Game Theory for Everyday Life
by Len Fisher.
 Vol 39, No 4, 2008.
394.pdf
 Combinatorial Designs: Constructions and Analysis
by Douglas R. Stinson.
 Combinatorics of Permutations by
Miklós Bóna.
 Enumerative Combinatorics by
Charalambos A. Charalambides.
 Geometric Algebra for Computer Science by
L. Dorst, D. Fontijne, and S. Mann.
 Privacy on the Line: The Politics of Wiretapping and Encryption
by Whitfield Diffie and Susan Landau.
 Vol 39, No 3, 2008.
393.pdf
 Combinatorial Optimization: Packing and Covering
by Gérard Cornuéjols.
 Ordered Sets: An Introduction
by Bernd S. W. Schröder.
 A Joint review of
 General Lattice Theory (Second Edition)
by George Grätzer.
 The congruences of a finite lattice: a proofby picture approach
Also by George Grätzer.
 Applied Combinatorics on Words
by M. Lothaire.
 Computation engineering: applied automata theory and logic
by Ganesh Lalitha Gopalakrishnan.
 Vol 39, No 2, 2008.
392.pdf
 The Art of Computer Programming
Volume 4, Fascicles 2, 3, and 4
by Donald Knuth.
 A Course in Computational Algebraic Number Theory
By Henri Cohen.
 Foundations of Computer Security
by David Salomon.
 Derivation and Computation: taking the CurryHoward correspondence seriously
by
Harold Simmons.
 Theoretical and Experimental DNA Computation.
by M. Amos.
 Vol 39, No 1, 2008
391.ps,
391.pdf
 Cryptography in C and C++
by Michael Welschenbach.
 A Beginner's Guide to Discrete Mathematics
by W.D. Wallis.
 Handbook of Elliptic and Hyperelliptic Curve Cryptography
Edited by
H. Cohen and G. Frey.
 The Game's Afoot: Game Theory in Myth and Paradox
by Alexander Mehlmann.
 A joint reivew of
 Introducing Game Theory and Its Applications
by Eliott Mendelson, and
 Game Theory and Strategy
by by Philip D. Straffin.
 Semantic Integration of Heterogeneous Software Specifications
by Martin GrobeRhode.
 Vol 38, No 4, 2007
384.pdf
 The Access Principle
by John Willinsky.
 A Century of Scientific Publishing: A collection of essays
Edited by Fredriksson.
 Mathematics of Physics and Engineering
by
Edward K. Blum and Sergey V. Lototsky.
 Research Problems in Discrete Geometry
by Brass, Moser, Pach.
 Vol 38, No 3, 2007
383.pdf
 The Political Mapping of Cyberspace
by Jeremy W. Crampton.
 Probability and Computing: Randomized Algorithms and Probabilitic Analysis
by Michael Mitzenmacher and Eli Upfal.
 Computational Techniques of the Simplex Method
by István Maros.
 Vol 38, No 2, 2007
382.pdf
 Symbolic Asymptotics
by John R. Shackell.
 Complexity and Crypotgraphy. An Introduction
by John Talbot and Dominic Welsh.
 Complexity Theory and Cryptology: An Introduction to Cryptocomplexity
by Jörg Rothe.
 Three Complexity Blogs.
Three Complexity Blogs are reviewed.
The blogs are by Lance Fortnow, Scott Aaronson, and Luca Trevisan.
 Vol 38, No1, 2007
381.pdf
 Excellence Without a Soul: How a Great University Forgot Education
by Harry Lewis.
 Joint review of the following books on Quantum computing.
 An Introduction to Quantum Computing Algorithms
by Arthur O. Pittenger.
 Quantum Computing
by Mika Hirvensalo.
 Classical and Quantum Computation
by A. Yu. Kitaev, A. Shen, and M. N. Vyalyi.
 Introduction to Lattices and Order
by B.A. Davey, H.A. Priestley.
 Computational Techniques for the Summation of Series
by Anthony Sofo.
 Vol 37, No 4, 2006
374.pdf
 Types and Programming Languages by Benjamin C. Pierce.
 Information Theory, Inference, and Learning Algorithms
by David J. C. MacKay.
 Verification of Reactive Systems : Formal Methods and Algorithms
by Klaus Schneider.
 Algorithmic Learning in a Random World
by Vovk, Gammerman, and Shafer.
 The Random Projection Method
by Santosh Vempala.
 Vol 37, No 3, 2006
373.pdf
 A joint review of the following math fiction.
 Reality Conditions: Short Mathematical Fiction
by Alex Kasman.
 Numb3rs TV show.
 Mathematical Apocrphia: Stories and
Annecdotes of Mathematicians and
the Mathematical by Steven Kranz
 Mathematical Apocrphia Redux: Stories and
Annecdotes of Mathematicians and
the Mathematical by Steven Kranz
 A joint review of the following books on particular numbers.
 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.
 The Square Root of 2: A Dialouge Concerning
a Number and a Sequence by
David Flannery.
Reviewed by Gasarch, Kruskal, Kruskal, and Kruskal.
 Vol 37, No 2, 2006
372.pdf
 Fair Division and Collective Welfare
by Hervé Moulin. Reviewed by Varsha Dani.
 Algorithms: Sequential, Parallel, and Distributed
by Kenneth A. Berman and Jerome L. Paul.
Reviewed by William Schmeister.
 Algebraic Complexity Theory
by Peter Bürgisser, Michael Clausen, and M. Amiu Shokrollahi.
Reviewed by Anthony Widjaja.
 Vol 37, No 1, 2006
371.ps,
371.pdf
 A Computational Introduction to Number Theory and Algebra
by Victor Shoup.
 Primality Testing in Polynomial Time
by Martin Dietzfelbinger.
 Introduction to Coding Theory
by Juerjen Bierbrauer.
 Codes: The Guide to Secrecy from Ancient to Modern Times
by Richard A. Mollin.
 Computational Complexity: a Quantitative Perspective
by Marius Zimand.
 Secure Communicating Systems : Design, analysis, and implementation
by Michael R A Huth.
 Alfred Tarski: Life and Logic by
Anita Burdman Feferman and Solomon Feferman.
 Vol 36, No 4, 2005
364.ps,
364.pdf
 Data Structures, Near Neighbor Searches, and Methodology:
Fifth and Sixth DIMACS Implementation Challenge
Edited by Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch.
 Genomic Perl: From Bioinformatics Basics to Working Code
by Rex A. Dwyer.
 Graphs, Networks, and Algorithms
by Dieter Jungnickel.
 Immunocomputing: Principles and Applications
by Alexander O. Tarakanov, Victor A. Skormin, Svetlana P. Sokolova.
 Term Rewriting Systems by Terese. Reviewed by Frederic Loulergue.
 Vol 36, No 3, 2005
363.pdf
 Classical and Quantum Computing with C++ and Java Simulations
by Hardy and Steeb.
 Integer Programming
by Wolsey.
 Computational Line Geometry
by Pottmann and Wallner.
 Logic for Computer Scientists
by Schoning.
 Teaching Statistics using Baseball
by Glenn.
 362.ps,
362.pdf

Cryptological Mathematics
by Robert Lewand.
 Data Privacy and Security
by David Salomon.
 Cryptography: An Introduction
by V.V. Yaschenko.
 Cryptanalysis of Number Theoretic Ciphers
by Samuel Wagstaff.
 RSA and PublicKey Cryptography
by R.A. Mollin.
 Foundations of Cryptography, Vol 1: Basic Tools
by Oded Goldreich.
 Vol 36, No 1, 2005
361.ps,
361.pdf
 Proofs that really count:
The Art of Combinatorial Proof
by J. Arthur Benjamin and Jennifer Quinn.
 Types and Programming Languages
by
Benjamin C. Pierce.
 Introduction To Natural Computation
by
Dana H. Ballard
 Mathematical Methods in Artificial Intelligence
by
Edward A. Bender.
 Vol 35, No 4, 2004
354.pdf
 Boolean Functions and Computation Models
by Clote and Kranakis.
 Selected Papers in Discrete Mathematics
by D. Knuth.
 Linear Optimization and Extensions  Problems and Solutions
by Dimitris Alevas and Manfred Padberg.
 Introduction to the Design and Analysis of Algorithms
By Ananay Levitin.
 Vol 35, No 3, 2004
353.pdf
 Handbook of Graph Theory
Edited by Gross and Yellen.
 Reasoning about Uncertainty
by Joseph Y. Halpern.
 Learning Kernel Classifiers: Theory and Algorithms
by
Ralf Herbrich, and
Learning with Kernels: Support Vector Machines, Regularization Optimization and Beyond
by Bernhard Schölkopf and Alexander J. Smola.
 Essentials of Constraint Programming
by T. Frühwirth and S. Abdennadher
 Vol 35, No 2, 2004
352.pdf
 Concurrent and Realtime Systems: The CSP Approach
by Steve Schneider.
 Introduction to Languages, Machines and Logic:
Computable Languages, Abstract Machines and Formal Logic
by Alan P. Parkes.
 Algorithm Design: Foundations, Analysis and Internet Examples
by Michael T. Goodrich and Roberto Tamassia.
 Theory of SemiFeasible Algorithms
by Lane Hemaspaandra and Leen Torenvliet.
 Vol 35, No 1, 2004
351.pdf
 The Classical Decision Problem
by Egon Börger, Erich Grädel and Yuri Gurevich.
item
Automata theory and its applications
by Bakhadyr Khoussainov and Anil Nerode.
 Automata, Logics, and Infinite Games
edited by Erich Grädel, Wolfgang Thomas, and Thomas Wilke.
 Automatic sequences: Theory, Applications, Generalizations
by JeanPaul Allouche and Jeffrey Shallit.
 Vol 34, No 4, 2003
344.pdf
 Introduction to Cryptography
by Johannes A. Buchmann.
 Coding Theory and Cryptography: The Essentials, Second Edition
by Hankerson, Hoffman, Leonard, Lindner, Phelps, Rodger, Wall.
 Cryptography: Theory and Practice
by Douglas R. Stinson.
 Foundations of Cryptography: Basic Tools
by O. Goldreich
 Modelling and Analysis of Security Protocols
by P. Ryan and S. Schneider
 Modern Cryptography, Probabilistic proofs and Pseudorandomness
(Algorithms and Combinatorics, Vol 17)
by Oded Goldreich.
 Vol 34, No 3, 2003
343.pdf
 Set Theory For Computing: From Decision Procedures to Declarative Programming with Sets
by Domenico Cantone, Eugenio Omodeo and Alberto Policriti.
 Theory of Computational Complexity
by DingZhu Du and KerI Ko.
 Computer Arithmetic Algorithms: A Review
by Israel Koren.
 An Introduction to Quantum Computing Algorithms
by Arthur O. Pittenger.
 Vol 34, No 2, 2003
342.pdf
 Algorithms Sequential & Parallel: A Unified Approach
by R. Miller & L. Boxer.
 Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approxim
ation, and Heuristics
by Juraj Hromkovic.
 Modal and Temporal Properties of Processes
by Colin Stirling.
 Modal Logic
by Patrick Blackburn, Maarten de Rijke, and Yde Venema.
 Vol 34, No 1, 2003
341.pdf
 Number Theory for Computing
by Song Y. Yan.
 TypeLogical Semantics
by B. Carpenter.
 The calculus: A Theory of Mobile Processes
by D. Sangiorgi and D. Walker.
 Vol 33, No 4, 2002
334.pdf
 Bioinformatics: The Machine Learning Approach
by
Pierre Baldi and Soren Brunak.
 The Clausal Theory of Types
by D. A. Wolfram (Not to be confused
with Stephen Wolfram.)
 Discrete Math Problems with Med. Apps. (DIMACS Vol. 55)
Ed by Du, Pardalos, Wang.
 Things a Computer Scientist Rarely Talks About
by Donald E. Knuth.
 A New Kind of Science
by Stephen Wolfram.
 Vol 33, No 3, 2002
333.pdf
 Modern Computer Algebra
by Joachim von zur Gathen and Jürgen Gerhard.
 The Discrepancy Method Randomness and Complexity
by Bernard Chazelle.
 Computability and Complexity Theory
by Steven Homer and Alan L. Selman.
 The Complexity Theory Companion
by Lane A. Hemaspaandra and Mitsunori Ogihara.
 Mathematical Theory of Domains
by StoltenbergHansen, Lindström, Griffor.
 Vol 33, No 2, 2002
332.pdf
 Model Checking by Clarke, Grumberg, and Peled.
 Petri Net Algebra by Best, Devillers, Koutny.
 Combinatorial Optimization  Theory and Algorithms by
Korte and Vygen.
 Introduction to Distributed Algorithms by Tel.
 Calculated Bets by Skiena.
 Vol 33, No. 1, 2002
331.pdf
 Algorithmic Geometry
by Boissonat and Yvinec.
 Branching Programs and Binary Decision Diagrams: Theory and App
by Wegener.
 Networks in Distributed Computing (DIMACS).
ed. by Mavronicolas, Merritt, Shavit.
 Graph Theory and Its Applications
by Gross, Yellen.
 Graph Theory
by Tutte.
 Data Refinement: ModelOriented Proof Methods and Their Comparison
by de Roever, Engelhardt.
 Response to book review of
Proofs and Refutations by Lakatos.
 Vol 32, No. 4, 2001
324.pdf
 Proofs and Confirmations
by David Bressoud
 Proofs and Refutations
by Imre Lakatos
 Dynamic Logic
by Harel, Kozen, Tiuryn.
 Analysis of Algorithms:An Active Learning Approach
by McConnell.
 Vol 32, No 3, 2001
323.pdf
 Automata and Languages: Theory and Applications
by Meduna.
 External Memory Algorithms (DIMACS)
ed. by Abello, Vitter.
 Control flow semantics
by de Bakker, de Vink.
 Pi Unleashed
by Arndt and Haenel.
 Chaotic elections
by Saari
 Math and politics
by Taylor
 Vol 32, No 2, 2001
322.pdf
 The Codebreakers: The story of secret writing
by Kahn
 The Code Book:
The Evolution of Secrecy from Mary Queen of Scots to Quantum Cryptography
by Singh
 DNA Based Computers V (DIMACS)
ed. by Gifford.
 Basic Proof Theory
by Troelstra, Schwichtenberg,
 Complexity and Real Computation
by L. Blum, Cucker, Shub, Smale,
 Vol 32, No. 1, 2001
321.pdf
 Data Structures and Algorithms in Java (2nd ed)
by Goodrich, Tamassia.
 Selected Papers on Analysis of Algorithms
by Knuth.
 How to Solve It: Modern Heuristics
by Michalewicz, B Fogel.
 Proof, Language, and Interaction: Essays in Honour of Robin Milner
ed. by Plotkin, Stirling and Tofte
 Vol 31, No. 4, 2000
314.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 WinWin solution
by Brams and Taylor,
 Fair Allocation (Proc. of Sym in App. Math, Vol 33)
edited by Young.
 Comp Geom: Algorithms & Applications (2nd Ed)
by de Berg, van Kreveld, Overmars, Schwarzkopf.
 Parameterized Complexity
by Downey and Fellows.
 Modern Graph Theory
by Bollobás.
 A=B
by Petkovšek, Wilf, Zeilberger.
 Communicating and mobile systems: the calculus
by Milnor.
 Vol 31, No. 3, 2000
313.pdf
 Descriptive Complexity Theory
by Immerman,
 Finite Model Theory
by Ebbinhaus, Flum,
 Descriptive Complexity and Finite Models (DIMACS)
ed. by Immerman, Kolaitis.
 Theory of Computing: A Gentle Introduction
by Kinber, Smith.
 Microsurveys in Discrete Probability (DIMACS)
ed. by Aldous, Propp.
 Term Rewriting and all that
by Baader, Nipkow.
 Vol 31, No. 2, 2000
312.pdf
 Gems of Theoretical Computer Science
by Schönig, Pruim.
 Network Design: Connectivity and Facilities Location (DIMACS)
ed. by Pardalos, Du.
 The Opt. Implementation of Functional Programming Languages
by Asperti, Guerrini.
 Indiscrete Thoughts
by Rota.
 Vol 31, No. 1, 2000
311.pdf
 Distributed Computing by Attiya and Welch,
 Hilbert's Tenth Problem , by Matiyasevich.
 Lambda Calculi: A Guide for Computer Scientists by Hankin.
 Systems that Learn (second edition) by Jain, Osherson, Royer, Sharma.
 Vol 30, No. 4, 1999
304.pdf
 Mathematical Support for Molecular Biology (DIMACS)
edited by FarachColton, Roberts
 DNA Based Computers II (DIMACS)
ed. by Landweber, Baum.
 DNA Based Computers III (DIMACS)
ed. by Rubin, Wood
 Online Computation and Competitive Analysis
by Borodin, ElYaniv
 Vol 30, No. 3, 1999
303.pdf
 Computational geometry in C (Second Edition)
by O'Rourke.
 Bounded Queries in Recursion Theory
by Gasarch, Martin.
 Logic For Applications
by Nerode and Shore
 Vol 30, No. 2, 1999
302.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, 2000
301.pdf
 Stable Marriage and its Relation to Other Comb
Problems: An Intro to Algorithm Anal
by Knuth.
 The Limits of Mathematics by Chaitin.
 Privacy on the Line by Diffie and Landau.
 A Theory of Objects
by
Authors: Abadi, Cardelli.
 Vol 29, No. 4, 1998.
294.pdf
 Cryptology and Computational Number Theory
by Carl Pomerance
 Theories of Computability
by Pippenger
 Vicious Circles
by Barwise, Moss.
 Vol 29, No 3, 1998.
293.pdf
 Algs on strings, trees, and sequences: comp sci and comp bio
by Gusfield
 Verification of Seq. and Conc. Programs
by Apt, Olderog
 Algorithms and Programming: Problems and Solutions
by Shen.
 Vol 29, No. 2 1998.
292.pdf
 Approximation Algorithms for NPhard Problems
ed. by Hochbaum
 Selected papers in computer science
by Knuth.
 Communication Complexity
by Kushilevitz and Nisan
 Vol 29 No. 1 1998
291.pdf
 Complexity Theory Retrospective II
ed. by Hemaspaandra, Selman.
 Basic Simple Type Theory
by Hindley
 Discrete Mathematics in the Schools
ed. by Rosenstein, Frazblau, Roberts.
 Vol 28 No. 4 1997
284.pdf
 Metamathematics, Machines, and Godel's Proof
by Shankar.
 Reasoning About Knowledge
by Fagin, Halpern, Moses, Moshe
 Isoms. of Types: from calc. to info. ret. & lang. design
by Di Cosmo
 Vol 28 No. 3, 1997
283.pdf
An intro. to Kolg. Comp
by Vitanyi, Li.
Next: About this document ...
William Gasarch
20131029