- General
- Research
- Education
- Admissions
Books by Faculty
The Craft of System Security
Sean Smith and John Marchesini
Available from Addison Wesley Professional | ISBN-10: 0-321-43483-8
Whether you're a security practitioner, developer, manager, or administrator, this book will give you the deep understanding necessary to meet today's security challenges--and anticipate tomorrow's. Unlike most books, The Craft of System Security doesn't just review the modern security practitioner's toolkit: It explains why each tool exists, and discusses how to use it to solve real problems.
Mathematical Mind-Benders
Available from A K Peters, Ltd. | ISBN: 1-56881-336-8
Peter Winkler's at it again. Following the enthusiastic reaction to Mathematical Puzzles: A Connoisseur's Collection, Peter has compiled a new collection of elegant mathematical puzzles to challenge and entertain the reader. The original puzzle connoisseur shares these puzzles, old and new, so that you can add them to your own library.
This book is for lovers of mathematics, lovers of puzzles, lovers of a challenge. Most of all it's for those who think that the world of mathematics is orderly, logical, and intuitive – and are ready to learn otherwise!
Discrete Mathematics for Computer Science
Kenneth P. Bogart, Clifford Stein, Robert L. Drysdale
Available from Key College Publishing | ISBN: 1-930190-86-7
Discrete Mathematics for Computer Science covers most of the mathematical topics needed by computer scientists: basic combinatorics and graph theory, probability, logic and proof techniques (including proof by induction), recurrence relationships and their solution, and the number theory needed to understand the RSA encryption scheme. The examples are drawn from Computer Science. Probability is used to analyze hashing and the average run times for algorithms. Recurrence relations arise from the analysis of recursive algorithms. Trees (including binary search trees) are a focus of the graph theory, and their properties are often proved using induction.
Stalking the Riemann Hypothesis: The Quest to Find the Hidden Law of Prime Numbers
Available from Random House | ISBN: 978-0-375-42136-5
A non-technical account of the history of the Riemann Hypothesis, a 150 year-old unsolved math problem, whose solution gets to the heart of out understanding of the way in the which the prime numbers are distributed among the integers.
Trusted Computing Platforms: Design and Applications
Available from Springer | ISBN: 0387239162
How can one trust computation taking place at a remote site, particularly if a party at that site might have motivation to subvert this trust? In recent years, industrial efforts have advanced the notion of a "trusted computing platform" as a building block. Through a conspiracy of hardware and software magic, these platforms attempt to solve this remote trust problem, to preserve various critical properties against various types of adversaries. However, these current efforts are just points on a larger continuum, which ranges from earlier work on secure coprocessor design and applications, through TCPA/TCG, to recent academic developments. Without wading through stacks of theses and research literature, the general computer science reader cannot see this big picture.
Trusted Computing Platforms: Design and Applications fills this gap. Starting with early prototypes and proposed applications, this book surveys the longer history of amplifying small amounts of hardware security into broader system security---and reports real case study experience with security architecture and applications on multiple types of platforms. The author examines the theory, design, implementation of the IBM 4758 secure coprocessor platform and discusses real case study applications that exploit the unique capabilities of this platform. The author discusses how these foundations grow into newer industrial designs, and discusses alternate architectures and case studies of applications that this newer hardware can enable. The author closes with an examination of more recent cutting-edge experimental work in this area.
Topology for Computing
Available from Cambridge University Press | ISBN: 0521836662
Written by a computer scientist for computer scientists, this book teaches topology from a computational point of view, and shows how to solve real problems that have topological aspects involving computers. Such problems arise in many areas, such as computer graphics, robotics, structural biology, and chemistry. The author starts from the basics of topology, assuming no prior exposure to the subject, and moves rapidly up to recent advances in the area, including topological persistence and hierarchical Morse complexes. Algorithms and data structures are presented when appropriate.
Mixed Models: Theory and Applications
Available from Wiley | ISBN: 978-0-471-60161-6
This timely and state-of-the-art topic is covered comprehensively in this book. Providing a complete and in-depth mathematical coverage of the topic - linear, generalized linear, and nonlinear mixed models, along with diagnostics - the book has dual appeal as both a graduate-level text and a reference. Special attention is given to algorithms and their implementations and several appendices make the text self-contained.
Introduction to Algorithms
Tom Cormen, Charles Leiserson, Ronald Rivest, and Cliff Stein
Available from MIT Press | ISBN: 0262032937
The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
Agent Systems, Mobile Agents, and Applications
Friedemann Mattern and David Kotz, Editors
Available from Springer | Online Version | ISBN 978-3-540-41052-2
This book constitues the refereed proceedings of the Second International Symposium on Agent Systems and Applications and the Fourth International Symposium on Mobile Agents, ASA/MA 2000 held in Zürich, Switzerland in September 2000. The 20 revised full papers presented were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on migration, security issues, systems and applications, mobile agent applications, applications of multi-agent systems, communication and mobility control, cooperation and interaction.
Voronoi Diagrams and Proximity Problems
Matthew Dickerson and Scot Drysdale
Available from COMAP
This book is part of COMAP's Geometry and its Applications series. Books in this series are designed to give high-school students a richer understanding of mathematical concepts at the heart of geometry and the ways that applications of geometry affect their lives. It introduces the Voronoi diagram and uses it to solve a series of proximity problems that arise in running a chain of pizza parlors (deciding which parlor is closest to the location where a pizza is to be delivered, deciding where to locate a new parlor that is farthest away from existing parlors, finding for each parlor which other parlor is nearest to it).