Douglas R. Stinson (University of Waterloo, Ontario, Canada)

Gebundenes Buch

Techniques for Designing and Analyzing Algorithms

Beschreibung

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.

Autor

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.

Produktdetails

• Chapman & Hall/CRC Cryptography and Network Security Series
• Verlag: Taylor & Francis Ltd
• Seitenzahl: 446
• Erscheinungstermin: 6. August 2021
• Englisch
• Abmessung: 260mm x 183mm x 28mm
• Gewicht: 1084g
• ISBN-13: 9780367228897
• ISBN-10: 0367228890
• Artikelnr.: 62234081