Update 23 martie - COVID-19 - Informații privind activitatea Books Express

Design and Analysis of Algorithms: A Contemporary Perspective

De (autor) ,
Notă GoodReads:
en Limba Engleză Paperback – 31 Aug 2019
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.
Citește tot Restrânge
Toate formatele și edițiile
Toate formatele și edițiile Preț Express
Paperback (1) 26065 lei  Economic 17-29 zile
  Cambridge University Press – 31 Aug 2019 26065 lei  Economic 17-29 zile
Hardback (1) 24734 lei  Economic 16-28 zile +976 lei  7-10 zile
  Cambridge University Press – 23 May 2019 24734 lei  Economic 16-28 zile +976 lei  7-10 zile

Preț: 26065 lei

Preț vechi: 32582 lei

Puncte Express: 391

Preț estimativ în valută:
5094 6022$ 4607£

Carte disponibilă

Livrare economică 13-25 noiembrie

Preluare comenzi: 021 569.72.76


ISBN-13: 9781108721998
ISBN-10: 1108721990
Pagini: 350
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării: Cambridge, United Kingdom


Preface; Acknowledgement; 1. Model and analysis; 2. Basics of probability and tail inequalities; 3. Warm up problems; 4. Optimization I: brute force and greedy strategy; 5. Optimization II: dynamic programming; 6. Searching; 7. Multidimensional searching and geometric algorithms; 8. String matching and finger printing; 9. Fast Fourier transform and applications; 10. Graph algorithms; 11. NP completeness and approximation algorithms; 12. Dimensionality reduction; 13. Parallel algorithms; 14. Memory hierarchy and caching; 15. Streaming data model; Appendix A. Recurrences and generating functions; Index.