Design and analysis of algorithms: a contemporary perspective

The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and g...

Full description

Saved in:
Bibliographic Details
Main Author: Sen, Sandeep (Author)
Format: Electronic eBook
Language:English
Published: Cambridge ; New York ; Port Melbourne ; New Delhi ; Singapore Cambridge University Press 2019
Subjects:
Online Access:BSB01
FHN01
UBA01
UER01
UPA01
Volltext
Summary:The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods
Physical Description:1 Online-Ressource
ISBN:9781108654937
DOI:10.1017/9781108654937

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text