Browse our 2019 Computer Science Catalog

Our new Computer Science catalog includes an introduction to computational complexity theory and its connections and interactions with mathematics; a book about the genesis of the digital idea and why it transformed civilization; and an intuitive approach to the mathematical foundation of computer science.

If you’re attending the Information Theory and Applications workshop in San Diego this week, you can stop by the PUP table to check out our computer science titles!


Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. Avi Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field that has shaped and will further shape science, technology, and society. 


Steiglitz Discrete Charm of the Machine book cover

A few short decades ago, we were informed by the smooth signals of analog television and radio; we communicated using our analog telephones; and we even computed with analog computers. Today our world is digital, built with zeros and ones. Why did this revolution occur? The Discrete Charm of the Machine explains, in an engaging and accessible manner, the varied physical and logical reasons behind this radical transformation, and challenges us to think about where its future trajectory may lead.

Lewis Zax Essential Discrete Mathematics for Computer Science

Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, Essential Discrete Mathematics for Computer Science can be tailored to fit the syllabi for a variety of courses. Fully illustrated in color, it aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof.

Browse our 2018 Computer Science & Information Science Catalog

Our new Computer Science & Information Science catalog includes an accessible and rigorous textbook for introducing undergraduates to computer science theory, a fascinating account of the breakthrough ideas that transformed probability and statistics, and an amazing tour of many of history’s greatest unsolved ciphers.

If you’re attending the ITA Workshop-Information Theory and Its Application conference this week, please stop by our table to browse our full range of titles.

What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference.

Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book’s examples and other content allow readers to view demonstrations of–and to experiment with—a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation.

In the sixteenth and seventeenth centuries, gamblers and mathematicians transformed the idea of chance from a mystery into the discipline of probability, setting the stage for a series of breakthroughs that enabled or transformed innumerable fields, from gambling, mathematics, statistics, economics, and finance to physics and computer science. This book tells the story of ten great ideas about chance and the thinkers who developed them, tracing the philosophical implications of these ideas as well as their mathematical impact.

Complete with a brief probability refresher, Ten Great Ideas about Chance is certain to be a hit with anyone who wants to understand the secrets of probability and how they were discovered.

Unsolved! begins by explaining the basics of cryptology, and then explores the history behind an array of unsolved ciphers. It looks at ancient ciphers, ciphers created by artists and composers, ciphers left by killers and victims, Cold War ciphers, and many others. Some are infamous, like the ciphers in the Zodiac letters, while others were created purely as intellectual challenges by figures such as Nobel Prize–winning physicist Richard P. Feynman. Bauer lays out the evidence surrounding each cipher, describes the efforts of geniuses and eccentrics—in some cases both—to decipher it, and invites readers to try their hand at puzzles that have stymied so many others.