Techniques for Designing and Analyzing Algorithms

Stinson, Douglas R.

  • 出版商: CRC
  • 出版日期: 2021-08-06
  • 售價: $3,680
  • 貴賓價: 9.5$3,496
  • 語言: 英文
  • 頁數: 430
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 0367228890
  • ISBN-13: 9780367228897
  • 相關分類: Algorithms-data-structures 資料結構與演算法
  • 下單後立即進貨 (約1週~2週)

相關主題

商品描述

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.

Table of Contents

Preface
1. Introduction and Mathematical Background
2. Algorithm Analysis and Reductions
3. Data Structures
4. Divide-and-Conquer Algorithms
5. Greedy Algorithms
6. Dynamic Programming Algorithms
7. Graph Algorithms
8. Backtracking Algorithms
9. Intractability and Undecidability
Bibliography
Index

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.

作者簡介

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.