"Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course. This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented. In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course. Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures. Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included. Proofs of correctness of algorithms are included when appropriate. The book presents a suitable amount of mathematical rigor. After reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers"--

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Computers & Technology

Stinson, Douglas R.

Computer Science

Routledge

Combinatorial Algorithms (Discrete Mathematics and Its Applications)

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: <ul> <li>Combinations </li> <li>Permutations </li> <li>Graphs </li> <li>Designs </li> <li> Many classical areas are covered as well as new research topics not included in most existing texts, such as: </li> <li>Group algorithms </li> <li>Graph isomorphism </li> <li>Hill-climbing </li> <li>Heuristic search algorithms </li> <li> This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.</li> </ul>

Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)

Kreher, Donald L.

Operating Systems

CRC-Press

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: 
<li>Combinations 
</li>
<li>Permutations 
</li>
<li>Graphs 
</li>
<li>Designs 
</li>
<li>
 Many classical areas are covered as well as new research topics not included in most existing texts, such as: 
</li>
<li>Group algorithms 
</li>
<li>Graph isomorphism 
</li>
<li>Hill-climbing 
</li>
<li>Heuristic search algorithms 
</li>
<li>
 This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.</li>

Chapman and Hall/CRC

The Advanced Encryption Standard (AES), elliptic curve DSA, the secure hash algorithm…these and other major advances made in recent years precipitated this comprehensive revision of the standard-setting text and reference, Cryptography: Theory and Practice. Now more tightly focused on the core areas, it contains many additional topics as well as thoroughly updated treatments of topics presented in the first edition. There is increased emphasis on general concepts, but the outstanding features that first made this a bestseller all remain, including its mathematical rigor, numerous examples, pseudocode descriptions of algorithms, and clear, precise explanations. Highlights of the Second Edition: 
<li>Explains the latest Federal Information Processing Standards, including the Advanced Encryption Standard (AES), the Secure Hash Algorithm (SHA-1), and the Elliptic Curve Digital Signature Algorithm (ECDSA) 
</li>
<li>Uses substitution-permutation networks to introduce block cipher design and analysis concepts 
</li>
<li>Explains both linear and differential cryptanalysis 
</li>
<li>Presents the Random Oracle model for hash functions 
</li>
<li>Addresses semantic security of RSA and Optional Asymmetric Encryption Padding 
</li>
<li>Discusses Wiener's attack on low decryption exponent RSA Overwhelmingly popular and relied upon in its first edition, now, more than ever, Cryptography: Theory and Practice provides an introduction to the field ideal for upper-level students in both mathematics and computer science. More highlights of the Second Edition: 
</li>
<li>Provably secure signature schemes: Full Domain Hash 
</li>
<li>Universal hash families 
</li>
<li>Expanded treatment of message authentication codes 
</li>
<li>More discussions on elliptic curves 
</li>
<li>Lower bounds for the complexity of generic algorithms for the discrete logarithm problem 
</li>
<li>Expanded treatment of factoring algorithms 
</li>
<li>Security definitions for signature schemes</li>

Cryptography : Theory and Practice

Chapman & Hall/CRC

THE LEGACY… First introduced in 1995, Cryptography: Theory and Practice garnered enormous praise and popularity, and soon became the standard textbook for cryptography courses around the world. The second edition was equally embraced, and enjoys status as a perennial bestseller. Now in its third edition, this authoritative text continues to provide a solid foundation for future breakthroughs in cryptography. WHY A THIRD EDITION? The art and science of cryptography has been evolving for thousands of years. Now, with unprecedented amounts of information circling the globe, we must be prepared to face new threats and employ new encryption schemes on an ongoing basis. This edition updates relevant chapters with the latest advances and includes seven additional chapters covering: 
<li>Pseudorandom bit generation in cryptography 
</li>
<li>Entity authentication, including schemes built from primitives and special purpose "zero-knowledge" schemes 
</li>
<li>Key establishment including key distribution and protocols for key agreement, both with a greater emphasis on security models and proofs 
</li>
<li>Public key infrastructure, including identity-based cryptography 
</li>
<li>Secret sharing schemes 
</li>
<li>Multicast security, including broadcast encryption and copyright protection THE RESULT… Providing mathematical background in a "just-in-time" fashion, informal descriptions of cryptosystems along with more precise pseudocode, and a host of numerical examples and exercises, Cryptography: Theory and Practice, Third Edition offers comprehensive, in-depth treatment of the methods and protocols that are vital to safeguarding the mind-boggling amount of information circulating around the world.</li>

Cryptography: Theory and Practice, Third Edition (Discrete Mathematics and Its Applications)

Cryptography: Theory and Practice, Third Edition - Solutions Manual

Science & Math

Mathematics

COMBINATORIAL DESIGNS

Reference

Springer India

See the best price to sell, buy, or rent books by Stinson, Douglas R.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Stinson, Douglas R.