The SIGACT Book Review column list of books it wants reviewed
Computational Complexity 2023-03-26
I am posting this for Nick Tran who is the current SIGACT Book Review Editor (before him it was Fred Green for about 6 years, and before him it was me (Bill Gasarch) for 18 years. Nobody should have the job for more than 6 years. No TV show should to on more than 6 years. The 6-year rule probably has other applications.)
Nick asked me to post the list of books that need reviewing. It is most of this post.
If you spot one you want to review then email him (email address later) the name of the book you want to review and your postal address so he can send it to you or have it sent to you. Here are his specs:
Reviews of recently published or bucket-list books of interest to the TCS community are welcome. Manuscripts (NOTE FROM BILL `manuscripts'? Really? Sounds like the kind of thing you would FAX or postal mail) should be between 3 and 6 pages and include a brief introduction, a detailed content summary, an assessment of the work, and a recommendation to the book's targeted audience.
Nick's email is ntran@scu.edu
The books are:
ALGORITHMS
Knebl, H. (2020). Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis. Springer.
Roughgarden, T. (2022). Algorithms Illuminated: Omnibus Edition. Cambridge University Press.
MISCELLANEOUS COMPUTER SCIENCE
Amaral Turkman, M., Paulino, C., & Müller, P. (2019). Computational Bayesian Statistics: An Introduction (Institute of Mathematical Statistics Textbooks). Cambridge University Press.
Nakajima, S., Watanabe, K., & Sugiyama, M. (2019). Variational Bayesian Learning Theory. Cambridge University Press.
Hidary, J. D. (2021). Quantum Computing: An Applied Approach (2nd ed.). Springer.
Apt, K. R., & Hoare, T. (Eds.). (2022). Edsger Wybe Dijkstra: His Life, Work, and Legacy (ACM Books). Morgan & Claypool.
Burton, E., Goldsmith, J., Mattei, N., Siler, C., & Swiatek, S. (2023). Computing and Technology Ethics: Engaging through Science Fiction. The MIT Press.
DISCRETE MATHEMATICS AND COMPUTING
O’Regan, G. (2020). Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts. Springer Publishing.
Rosenberg, A. L., & Trystram, D. (2020). Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know. Springer Publishing.
Liben-Nowell, D. (2022). Connecting Discrete Mathematics and Computer Science (2nd ed.). Cambridge University Press.
CRYPTOGRAPHY AND SECURITY
Oorschot, P. . C. (2020). Computer Security and the Internet: Tools and Jewels (Information Security and Cryptography). Springer.
COMBINATORICS AND GRAPH THEORY
Golumbic, M. C., & Sainte-Laguë, A. (2021). The Zeroth Book of Graph Theory: An Annotated Translation of Les Réseaux (ou Graphes)—André Sainte-Laguë (1926) (Lecture Notes in Mathematics). Springer.
Beineke, L., Golumbic, M., & Wilson, R. (Eds.). (2021). Topics in Algorithmic Graph Theory (Encyclopedia of Mathematics and its Applications). Cambridge University Press.
PROGRAMMING ETC.
Nielson, F., & Nielson, R. H. (2019). Formal Methods: An Appetizer. Springer.
Sanders, P., Mehlhorn, K., Dietzfelbinger, M., & Dementiev, R. (2019). Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox. Springer.
MISCELLANEOUS MATHEMATICS
Kurgalin, S., & Borzunov, S. (2022). Algebra and Geometry with Python. Springer.