SIGACT Book Review Columns, beginning with SIGACT Vol. 46

(Vol. 46 No. 1 edited by Bill Gasarch; all others edited by Fred Green)

1. Vol. 53, No. 4 53-4.pdf
   •  Feasible Computations and Provable Complexity Properties, by Juris Hartmanis. Review by Frederic Green.

2. Vol. 53, No. 3 53-3.pdf
   • The Engines of Cognition: Essays by the Less Wrong Community, by Less Wrong. Review by William Gasarch.
     
   • Mathematical Muffin Morsels - Nobody wants a small piece, by William Gasarch, Erik Metz, Jacob Prinz, and Daniel Smolyak. Review by Frederic Green.
     
   • The Algorithm Design Manual, 3 ed., by Steven S. Skiena. Review by Nicholas Tran.
     

3. Vol. 53, No. 2 53-2.pdf
   • Complexity Dichotomies for Counting Problems - Volume 1: Boolean Domain, by Jin-Yi Cai and Xi Chen. Review by Frederic Green.
   • The Geometry of Uncertainty, by Fabio Cuzzolin. Review by Erick Galinkin.

4. Vol. 53, No. 1 53-1.pdf
   • Tales of Impossibility: The 2000-Year quest to Solve the Mathematical Problems of Antiquity, by David Richeson. Review by Bill Gasarch.
   • A Map that Reflects the Territory: Essays by the Less Wrong Community. Review by Bill Gasarch.

5. Vol. 52, No. 4 52-4.pdf
   • Three Lectures on Complexity and Black Holes, by Leonard Susskind. Review by Frederic Green.
   • A Short Course in Computational Geometry and Topology, by Herbert Edelsbrunner. Review by Abdulai Gassama and Frederic Green.
   • The Age of Algorithms, by Serge Abiteboul and Gilles Dowek. Review by S. V. Nagaraj.

6. Vol. 52, No. 3 52-3.pdf
   • Mathematics and Computation, by Avi Wigderson. A sweeping look at computational complexity and adjacent fields, especially how they interact with mathematics. Review by Frederic Green.
   • Communication Complexity and Applications, by Anup Rao and Amir Yehudayoff. A textbook on this important topic. Review by Michaël Cadilhac.

7. Vol. 52, No. 2 52-2.pdf
   • The Foundations of Computability Theory (Second Edition), by Borut Robic. Reviewed by Erick Galinkin.
   • Ideas that Created the Future: Classic Papers of Computer Science, Edited by Harry Lewis. Reviewed by William Gasarch.
   • Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion, by Hal Abelson, Ken Ledeen, Harry Lewis, and Wendy Seltzer. Reviewed by William Gasarch.

8. Vol. 52, No. 1 52-1.pdf
   • Algorithmic Aspects of Machine Learning, by Ankur Moitra. Review by Sarvagya Upadhyay.
   • Network Flow Algorithms, by David Williamson. Review by S.V. Nagaraj.
   • The Theory of Quantum Information, by John Watrous. Review by Steve Fenner.

9. Vol. 51, No. 4 51-4.pdf
   • Introduction to Property Testing, by Oded Goldreich. Review by Sarvagya Upadhyay.
   • Kernelization: Theory of Parameterized Preprocessing, by Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Review by Tim Jackman and Steve Homer.
   • Forbidden Configurations in Discrete Geometry, by David Eppstein. Review by Frederic Green.

10. Vol. 51, No. 3 51-3.pdf
    • The Problem With Software: Why Smart Engineers Write Bad Code, by Adam Barr. Review by Shoshana Marcus.
    • Elements of Parallel Computing, by Eric Aubanel. Review by Michele Amoretti.
    • Theorems of the 21st Century: Volume I, by Bogdan Grechuk. Review by William Gasarch.

11. Vol. 51, No. 2 51-2.pdf
    • Essential Discrete Mathematics for Computer Science, by Harry Lewis and Rachel Zax. Review by Bill Gasarch.
    • Applied Number Theory, by Harald Niederreiter and Arne Winterhof. Review by Song Y Yan.
    • Market Design: A Linear Programming Approach to Auctions and Matching, by Martin Bichler. Review by S.V. Nagaraj.

12. Vol. 51, No. 1 51-1.pdf
    • What Can be Computed? A Practical Guide to the Theory of Computation, by John MacCormick. Review by William Gasarch.
    • Problems With a Point, by William Gasarch and Clyde Kruskal. Review by John MacCormick.

13. Vol. 50, No. 4 50-4.pdf
    • Factor Man, by Matt Ginsberg. Review by William Gasarch.
    • Kolmogorov Complexity and Algorithmic Randomness, by A. Shen, V. A. Uspensky, and N. Vereshchagin. Review by Hadi Shafei.

14. Vol. 50, No. 3 50-3.pdf
    • Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, edited by KT Thulasiraman (Editor-in-Chief), Subramanian Arumugam, Andreas Brandstädt, and Takao Nishizeki. Review by Frederic Green.

15. Vol. 50, No. 2 50-2.pdf
    1. Q is for Quantum, by Terry Rudolph. Review by Bill Gasarch.
    2. An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics, by Matthew Katz and Jan Reimann. Review by Bill Gasarch.
    3. Modern Cryptography and Elliptic Curves, A Beginner's Guide, by Thomas R. Shemanske. Review by Frederic Green (third installment in my series on number theory).

16. Vol. 50, No. 1 50-1.pdf
    1. Number Theory: An Introduction via the Density of Primes, Second Edition, by Benjamin Fine and Gerhard Rosenberger. Review by Frederic Green.
    2. Codes, Cryptology and Curves with Computer Algebra by Ruud Pellikaan, Xin-Wen Wu, Stanislav Bulygin and Relinde Jurrius. Review by S.V. Nagaraj.

17. Vol 49, No. 4 49-4.pdf
    1. The Power of Networks: Six Principles that Connect our Lives, by Christopher G. Brinton and Mung Chiang; and Algorithms and Models for Network Data and Link Analysis, by François Fouss, Marco Saerens, and Masashi Shimbo. Joint review by Panos Louridas.
    2. Game Theory, Alive, by Anna R. Karlin and Yuval Peres. Review by Amir Babak Aazami.

    3. Modern Data Science with R, by Benjamin Baumer, Daniel T. Kaplan, and Nicholas J. Horton. Review by Allan M. Miller.

18. Vol 49, No. 3 49-3.pdf
    1. Compact Data Structures - A Practical Approach, by Gonzalo Navarro. Review by László Kozma.
    2. Power Up: Unlocking the Hidden Mathematics in Video Games, by Matthew Lane. Review by S. V. Nagaraj.
    3. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis (Second Edition), by Michael Mitzenmacher and Eli Upfal. Review by Aravind Srinivasan.

19. Vol 49, No. 2 49-2.pdf
    1. Words and Graphs, by Sergey Kitaev and Vadim Lozin. Review by James V. Rauff.
    2. Network Science, by Albert-László Barabási. Review by Panos Louridas.
    3. Trends in Computational Social Choice, edited by Ulle Endriss. Review by S.V. Nagaraj.

20. Vol 49, No. 1 49-1.pdf
    1. The Art of Computer Programming, Fascicle 6: “Satisfiability,” by Donald E. Knuth. Review by John Rogers.
    2. Real-World Algorithms: A Beginner's Guide, by Panos Louridas. Review by Ramon de Vera Jr.
    3. Quadratic Residues and Non-Residues, by Steve Wright, and The Quadratic Reciprocity Law by Oswald Baumgart, translated by Franz Lemmermeyer. Joint review by Frederic Green.

21. Vol 48, No. 4 48-4.pdf
    1. Communication Networks: An Optimization, Control, and Stochastic Networks Perspective, by R. Srikant and L. Ying. Reviewed by Vincenzo Liberatore.
    2. Handbook of Computational Social Choice, edited by Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia. Reviewed by S.V. Nagaraj.
    3. Ramsey Theory for Discrete Structures, by Hans Jürgen Prömel. Review by Bill Gasarch.

22. Vol 48, No. 3 48-3.pdf
    1. Set Theory: A First Course, by Daniel W. Cunningham. Reviewed by Frederic Green.
    2. CryptoSchool, by Joachim von zur Gathen. Reviewed by Steve Homer.
    3. R for Data Science: Import, Tidy, Transform, Visualize, and Model Data, by Hadley Wickham and Garrett Grolemund. Review by Allan M. Miller.

23. Vol 48, No. 2 48-2.pdf
    1. The Structure and Stability of Persistence Modules, by Frédéric Chazal, Vin de Silva, Marc Glisse, Steve Oudot. Review by Robin Belton and Brittany Terese Fasy.
    2. Quantum Walks and Search Algorithms, by Renato Portugal. Review by Frederic Green.
    3. The Magic of Math, by Arthur Benjamin, and How to Bake $\pi$, by Eugenia Cheng. Joint review by Frederic Green

24. Vol 48, No. 1 48-1.pdf
    1. Art in the Life of Mathematicians, edited by Anna Kepes Szemerédi. Reviewed by Frederic Green.
    2. Practical Data Science with R, by Nina Zumel and John Mount. Reviewed by Allan M. Miller.
    3. Algebraic Coding Theory, Revised Edition, by Elwyn Berlekamp. Reviewed by S.V. Nagaraj.

25. Vol 47, No. 4 47-4.pdf
    1. Turing Computability: Theory and Applications, by Robert Soare. Reviewed by Bill Gasarch.
    2. Analysis of Boolean Functions, by Ryan O'Donnell. Reviewed by Daniel Apon.
    3. Distributed Systems: An Algorithmic Approach (2nd Edition), by Sukumar Ghosh. Reviewed by Ramon de Vera Jr.
    4. The Golden Ratio and Fibonacci Numbers, by Richard A. Dunlap. Reviewed by Michaël Cadilhac.
    5. The Fascinating World of Graph Theory, by Arthur Benjamin, Gary Chartrand and Ping Zhang. Reviewed by Frederic Green.

26. Vol 47, No. 3 47-3.pdf
    1. Quantum Algorithms via Linear Algebra, by Richard J. Lipton and Kenneth W. Regan. Reviewed by Frederic Green.
    2. Quantum Information Theory, by Mark M. Wilde. Reviewed by Subhayan Roy Moulick.
    3. Genome-Scale Algorithm Design (Biological sequence analysis in the era of high-throughput sequencing) by Veli Mäkinen, Djamal Belazzougui, Fabio Cunial and Alexandru I. Tomescu. Reviewed by Steven Kelk.
    4. The Mathematics of Encryption: An Elementary Introduction, by Margaret Cozzens and Steven J. Miller. Reviewed by George Ledin Jr.
    5. Mathematics Everywhere by Martin Aigner and Ehrhard Behrends (Eds.). Reviewed by S. V. Nagaraj.

27. Vol 47, No. 2 47-2.pdf
    1. Primality Testing for Beginners, by Lasse Rempe-Gillen and Rebecca Waldecker. Reviewed by Frederic Green.
    2. The Joy of Factoring, by Samuel Wagstaff. Reviewed by William Gasarch.
    3. Asymptopia, by Joel Spencer and Laura Florescu. Reviewed by William Gasarch.
    4. Ramsey Theory over the Integers (Second Edition), by Bruce M. Landman and Aaron Robertson. Reviewed by William Gasarch.
    5. Distributed Computing Through Combinatorial Topology, by Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum. Reviewed by Jalaj Upadhyay.

28. Vol 47, No. 1 47-1.pdf
    1. The Nature of Computation, Cristopher Moore and Stephan Mertens. Reviewed by Haris Aziz and separately by Frederic Green.
    2. ReCombinatorics: The algorithmics of ancestral recombination graphs and explicit phylogenetic networks, by Dan Gusfield. Review by Steven Kelk.
    3. What is College For? The Public Purpose of Higher Education, Ellen Condliffe Lagemann and Harry Lewis, editors. Reviewed by William Gasarch.
    4. Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles, by Denis Hirschfeldt. Reviewed by William Gasarch.
    5. The Scholar and the State: In Search of Van der Waerden, by Alexander Soifer. Reviewed by William Gasarch.

29. Vol 46, No. 4 46-4.pdf
    1. Incredible Numbers, by Ian Stewart. Reviewed by Frederic Green.
    2. Mathematics Galore, by James Tanton. Reviewed by William Gasarch.
    3. Math Bytes, by Tim Chartier. Reviewed by John Tucker Bane.
    4. Algorithms Unplugged, by B. Vöcking et al., Eds., and The Power of Algorithms, by Giorgio Ausiello and Rossella Petreschi, Eds. Joint review by Shiva Kintali.
    5. Handbook of Finite Fields, by Gary L. Mullen and Daniel Panario. Reviewed by S. V. Nagaraj.

30. Vol 46, No. 3 46-3.pdf
    1. Games and Mathematics: Subtle Connections, by David Wells. Reviewed by S. C. Coutinho.
    2. Jewels of Stringology, by Maxime Crochemore and Wojciech Rytter. Reviewed by Shoshana Marcus.
    3. Algorithms on Strings, by Maxime Crochemore, Christophe Hancart and Thierry Lecroq. Reviewed by Matthias Gallé.
    4. Polyhedral and Algebraic Methods in Computational Geometry, by Michael Joswig and Thorsten Theobald. Reviewed by Brittany Terese Fasy and David L. Millman.
    5. A Mathematical Orchard - Problems and Solutions, by Mark Krusemeyer, George Gilbert, and Loren Larson. Reviewed by S.V. Nagaraj.

31. Vol 46, No 2 46-2.pdf
    1. The Cult of Pythagoras: Math and Myths by Alberto A. Martinez. Review by Bill Gasarch.
    2. Infinitesimal: How a dangerous mathematical theory shaped the modern world, by Amir Alexander. Review by Bill Gasarch.
    3. Martin Gardner in the Twenty-First Century, edited by Michael Henle and Brian Hopkins. Review by Bill Gasarch.
    4. Algorithmic Barriers Falling: P=NP?, and The Essential Knuth, both by by Edgar Daylight. Review by Bill Gasarch.
    5. Love and Math: The Heart of Hidden Reality by Edward Frenkel. Review by Bill Gasarch.
    6. Structure and Randomness: Pages from Year One of a Mathematical Blog by Terence Tao. Review by Bill Gasarch.

32. Vol 46, No 1 46-1.pdf
    1. Digital Signatures by Jonathan Katz. Reviewed by Subhayan Roy Moulick.
    2. A Walk Through Combinatorics by Miklós Bóna. Review by Bill Gasarch.
    3. A Wealth of Numbers: An Anthology of 500 Years of Popular Mathematics writing by Benjamin Wardhaugh. Review by Omar Shehab.
    4. A Guide to Experimental Algorithms by Catherine McGeoch. Review by Shoshana Marcus.
    5. Fundamentals of Parameterized Complexity (second edition). by Rodney Downey and Michael Fellows. Review by Rajesh Chitnis.
    6. The King of Infinite Space: Euclid and his Elements by David Berlinski. Review by Eownyn Cenek.