Design and Analysis of Algorithms: A Contemporary Perspective

by Amit Kumar (Author), Amit Kumar (Author), Sandeep Sen (Author)

New
Hardcover
2019
$69.60

The text covers important algorithm design techniques, like greedy algorithms, dynamic programming, 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 emphasis 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 emphasises the role of randomization in algorithm design, and gives numerous applications ranging from data-structures like skip-lists to dimensionality reduction methods.

Synopsis

The text covers important algorithm design techniques, like greedy algorithms, dynamic programming, 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 emphasis 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 emphasises the role of randomization in algorithm design, and gives numerous applications ranging from data-structures like skip-lists to dimensionality reduction methods.

$69.60

Quantity

20+ in stock

More Information

Format: Hardcover
Pages: 350
Publisher: Cambridge University Press
Published: 23 May 2019
ISBN 10: 1108496822
ISBN 13: 9781108496827
Book Overview: Focusses on the interplay between algorithm design and the underlying computational models.

Author Bio

Sandeep Sen is Professor in department of computer science and engineering, Indian Institute of Technology (IIT), Delhi. He received his PhD from Duke University and M.S. from University of California at Santa Barabara. Prior to joining IIT Delhi, he served as a post-doctoral researcher at Bell Laboratories, Murray Hill, New Jersey and at Duke University. He served as visiting researcher positions at many reputed institutes including Max Planck Institute (Germany), IBM Research Lab., Microsoft Research Lab, University of Newcastle (Australia), University of North Carolina at Chapel Hill, University of Connecticut and Simon Fraser University. With more than 25 years of teaching experience, his areas of interest include randomized algorithms, computational geometry and graph algorithms. Amit Kumar is Professor in department of computer science and engineering, Indian Institute of Technology (IIT) Delhi. He received his PhD from Cornell University. Prior to joining IIT Delhi, he worked as member of technical staff at Bell Laboratories, New Jersey and has held several visiting professor positions at Microsoft Research India, IBM Research India and Max-Planck Institute, Germany. He has published over 80 research articles and holds 5 patents. His areas of interest include design of algorithms, approximation algorithms, computer networks and network management and routing.