Cantitate/Preț
Produs
Total produse
Vezi coșul
Techniques for Designing and Analyzing Algorithms de Douglas R. Stinson

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

Autor Douglas R. Stinson
en Limba Engleză Paperback – 26 aug 2024
Techniques for Designing and Analyzing Algorithms
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 37976 lei  3-5 săpt. +3120 lei  6-12 zile
  CRC Press – 26 aug 2024 37976 lei  3-5 săpt. +3120 lei  6-12 zile
Hardback (1) 56324 lei  3-5 săpt. +4081 lei  6-12 zile
  CRC Press – 6 aug 2021 56324 lei  3-5 săpt. +4081 lei  6-12 zile

Din seria Chapman & Hall/CRC Cryptography and Network Security Series

  • 20% Introduction to Modern Cryptography
    Preț: 72480 lei
  • Practical Mathematical Cryptography
    Preț: 36247 lei
  • 8% Secret History: The Story of Cryptology
    Preț: 41141 lei
  • Cryptology: Classical and Modern
    Preț: 34501 lei
  • 18% Communication System Security
    Preț: 135139 lei
  • 9% Introduction to Modern Cryptography, Second Edition: Visual and Programmable Approaches
    Preț: 73421 lei
  • 31% Guide to Pairing-Based Cryptography
    Preț: 26529 lei
  • 9% Discrete Encounters
    Preț: 32183 lei
  • 23% Group Theoretic Cryptography
    Preț: 41069 lei
  • 30% Access Control, Security, and Trust: A Logical Approach
    Preț: 32934 lei
  • 20% Introduction to Network Security
    Preț: 75537 lei
  • 18% Cryptanalysis of RSA and Its Variants
    Preț: 78877 lei
  • 20% Algorithmic Cryptanalysis
    Preț: 100319 lei
  • 25% Handbook of Financial Cryptography and Security
    Preț: 27256 lei
  • 26% Handbook on Soft Computing for Video Surveillance
    Preț: 85017 lei

Preț: 37976 lei

Preț vechi: 47471 lei
-20% Nou

Puncte Express: 570
Preț estimativ în valută:
7270€ • 7586$ • 6094£

Carte disponibilă

Livrare economică 20 februarie-06 martie
Livrare express 05-11 februarie pentru 4119 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781032024103
ISBN-10: 1032024100
Pagini: 444
Ilustrații: 132
Dimensiuni: 178 x 254 x 23 mm
Greutate: 0.82 kg
Ediția:1
Editura: CRC Press
Colecția Chapman and Hall/CRC
Seria Chapman & Hall/CRC Cryptography and Network Security Series

Locul publicării:Boca Raton, United States

Public țintă

Undergraduate Advanced

Notă biografică

Douglas R. Stinson obtained his PhD in Combinatorics and Optimization from the University of Waterloo in 1981. He held academic positions at the University of Manitoba and the University of Nebraska-Lincoln before returning to Waterloo in 1998. In 2019, Dr. Stinson retired from the David R. Cheriton School of Computer Science at the University of Waterloo and he now holds the title Professor Emeritus. His research interests include cryptography and computer security, combinatorics and coding theory, and applications of discrete mathematics in computer science. He was elected as a Fellow of the Royal Society of Canada in 2011. He has published almost 400 papers and several books, including Cryptography: Theory and Practice, Fourth Edition, also published by CRC Press.

Cuprins

1. Introduction and Mathematical Background. 1.1. Algorithms and Programs. 1.2. Definitions and Terminology. 1.3. Order Notation. 1.4. Mathematical Formulae. 1.5. Probability Theory and Random Variables. 1.6. Notes and References. Exercises. 2. Algorithm Analysis and Reductions. 2.1. Loop Analysis Techniques. 2.2. Algorithms for the 3SUM Problem. 2.3. Reductions. 2.4. Exact Analysis. 2.5. Notes and References. Exercises. 3. Data Structures. 3.1. Abstract Data Types and Data Structures. 3.2. Arrays, Linked Lists and Sets. 3.3. Stacks and Queues. 3.4. Priority Queues and Heaps. 3.6. Hash Tables. 3.7. Notes and References. Exercises. 4. Divide-and-Conquer Algorithms. 4.1. Recurrence Relations. 4.2. The Master Theorem. 4.3. Divide-and-Conquer Design Strategy. 4.4. Divide-and-Conquer Recurrence Relations. 4.5. Binary Search. 4.6. Non-dominated Points. 4.7. Stock Profits. 4.8. Closest Pair. 4.9. Multiprecision Multiplication. 4.10. Modular Exponentiation. 4.11. Matrix Multiplication. 4.12. QuickSort. 4.13. Selection and Median. 4.14. Notes and References. Exercises. 5. Greedy Algorithms. 5.1. Optimization Problems. 5.2. Greedy Design Strategy. 5.3. Interval Selection. 5.4. Interval Coloring. 5.5. Wireless Access Points. 5.6. A House Construction Problem. 5.7. Knapsack. 5.8. Coin Changing. 5.9. Multiprocessor Scheduling. 5.10. Stable Matching. 5.11. Notes and References. Exercises. 6 Dynamic Programming Algorithms. 6.1. Fibonacci Numbers. 6.2. Design Strategy. 6.3. Treasure Hunt. 6.4. 0-1 Knapsack. 6.5. Rod Cutting. 6.6. Coin Changing. 6.7. Longest Common Subsequence. 6.8. Minimum Length Triangulation. 6.9. Memoization. 6.10. Notes and References. Exercises. 7. Graph Algorithms. 7.1. Graphs. 7.2. Breadth-first Search. 7.3. Directed Graphs. 7.4. Depth-first Search. 7.5. Strongly Connected Components. 7.6. Eulerian Circuits. 7.7. Minimum Spanning Trees. 7.8. Single Source Shortest Paths. 7.9. All-Pairs Shortest Paths. 7.10. Notes and References. Exercises. 8. Backtracking Algorithms. 8.1. Introduction. 8.2. Generating all Cliques. 8.3. Sudoku. 8.4. Pruning and Bounding Functions. 8.5. 0-1 Knapsack Problem. 8.6. Traveling Salesperson Problem. 8.7. Branch-and-bound. 8.8. Notes and References. Exercises. 9. Intractability and Undecidability. 9.1. Decision Problems and the Complexity Class P. 9.2. Polynomial-time Turing Reductions. 9.3. The Complexity Class NP. 9.4. Polynomial Transformations. 9.5. NP-completeness. 9.6. Proving Problems NP-complete. 9.7. NP-hard Problems. 9.8. Approximation Algorithms. 9.9. Undecidability. 9.10. The Complexity Class EXPTIME. 9.11. Notes and References. Exercises. Bibliography. Index.

Descriere

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.