Search
Compare Prices
|
 (4.5 / 5.0) ....The most comprehensive guide to designing practical and efficient algorithms!....<P><STRONG>The Algorithm Design Manual, Second Edition<P>"...the book is an algorithm-implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations [and] extensive bibliography make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews "It has all the right ingredients: rich contents, friendly, personal language, subtle humor, the right references, and a plethora of pointers to resources." -- P. Takis Metaxas, Wellesley College<P>"This is the most approachable book on algorithms I have." <STRONG>-- Megan Squire, Elon University, USA This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.<P>The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, <EM>Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.<P><P><STRONG>NEW to the second edition: • Doubles the tutorial material and exercises over the first edition<P>• Provides <STRONG>full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video • Contains a<STRONG> unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them • Includes several <STRONG>NEW "war stories" relating experiences from <STRONG>real-world applications<P><STRONG>• Provides up-to-date links leading to the very best algorithm <EM><STRONG>implementations available in C, C++, and Java<P><STRONG>ADDITIONAL Learning Tools: • Exercises include "job interview problems" from major software companies • Highlighted take-home lesson boxes emphasize essential concepts<P>• Provides comprehensive references to both survey articles and the primary literature • Exercises points to relevant programming contest challenge problems • Many algorithms presented with actual code (written in C) as well as pseudo-code • A full set of lecture slides and additional material available at www.algorist.com Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, <EM><STRONG>Programming Challenges: The Programming Contest Training Manual. 
|
$52.51 |
|
|
(4.5 / 5.0) Many students have trouble the first time they take a mathematics course in which proofs play a significant role. This new edition of Velleman’s successful text will prepare students to make the transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. The author shows how complex proofs are built up from these smaller steps, using detailed ‘scratch work’ sections to expose the machinery of proofs about the natural numbers, relations, functions, and infinite sets. To give students the opportunity to construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. This book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and of course mathematicians.
|
$21.59 |
|
|
 (3.5 / 5.0) Updated with new material, this Fifth Edition of the most widely used book in combinatorial problems explains how to reason and model combinatorically. It also stresses the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity. Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This book seeks to develop proficiency in basic discrete math problem solving in the way that a calculus text develops proficiency in basic analysis problem solving.
|
$55.63 |
|
|
 (4.0 / 5.0) Intended for a 2-semester sequence of <B>Introductory and <B>Intermediate Algebra where students get a solid foundation in algebra with early and frequent exposure to functions and an empasis on modeling with full integration of the graphing calculator. The goal is to prepare them for success in College Algebra or their next math course.
|
$95.00 |
|
|
 (3.0 / 5.0) <P style="MARGIN: 0px">This trusted best-seller emphasizes combinatorial ideas–including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition clarifies the exposition throughout and adds a wealth of new exercises. <B>Appropriate for one- or two-semester, junior- to senior-level combinatorics courses.
|
$86.66 |
|
|
 (2.0 / 5.0) <B> Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout. Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write proofs. Offers two sections on probability (2.4 and 2.5). Moves material on depth-first search, which previously comprised an entire (very short) chapter, to an earlier chapter where it fits more naturally. Rewrites section on RNA chains to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest. Provides true/false questions (with all answers in the back of the book) in every section. Features an appendix on matrices. A useful reference for mathematics enthusiasts who want to learn how to write proofs.
|
$94.80 |
|
|
 (5.0 / 5.0) Cryptography plays a key role in ensuring the privacy and integrity of data and the security of computer networks. Introduction to Modern Cryptography provides a rigorous yet accessible treatment of modern cryptography, with a focus on formal definitions, precise assumptions, and rigorous proofs.<BR><BR>The authors introduce the core principles of modern cryptography, including the modern, computational approach to security that overcomes the limitations of perfect secrecy. An extensive treatment of private-key encryption and message authentication follows. The authors also illustrate design principles for block ciphers, such as the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES), and present provably secure constructions of block ciphers from lower-level primitives. The second half of the book focuses on public-key cryptography, beginning with a self-contained introduction to the number theory needed to understand the RSA, Diffie-Hellman, El Gamal, and other cryptosystems. After exploring public-key encryption and digital signatures, the book concludes with a discussion of the random oracle model and its applications.<BR><BR>Serving as a textbook, a reference, or for self-study, Introduction to Modern Cryptography presents the necessary tools to fully understand this fascinating subject.
|
$63.15 |
|
|
 (1.0 / 5.0) The authors help students "see the math" through their focus on functions; visual emphasis; side-by-side algebraic and graphical solutions; real-data applications; and examples and exercises. By remaining focused on today's students and their needs, the authors lead students to mathematical understanding and, ultimately, success in class.
|
$63.27 |
|
|
 (2.5 / 5.0) <P style="MARGIN: 0px"><B>Key Message: Discrete Mathematical Structures, Sixth Edition, offers a clear and concise presentation of the fundamental concepts of discrete mathematics. This introductory book contains more genuine computer science applications than any other text in the field, and will be especially helpful for readers interested in computer science. This book is written at an appropriate level for a wide variety of readers, and assumes a college algebra course as the only prerequisite.
<B>Key Topics: Fundamentals; Logic; Counting; Relations and Digraphs; Functions; Order Relations and Structures; Trees; Topics in Graph Theory; Semigroups and Groups; Languages and Finite-State Machines; Groups and Coding <P style="MARGIN: 0px">Market: For all readers interested in discrete mathematics.<P style="MARGIN: 0px">
|
$94.80 |
|
|
(4.5 / 5.0) This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."—American Mathematical Monthly. 1982 ed.
|
$12.57 |