Design and Analysis of Algorithms

Design and Analysis of Algorithms

A Contemporary Perspective

Sen, Sandeep (Indian Institute of Technology Delhi); Kumar, Amit (Indian Institute of Technology Delhi)

Cambridge University Press

02/2019

350

Mole

Inglês

9781108721998

15 a 20 dias

A valuable text in the field of computer science and engineering, covering fundamental concepts and recent advancements. To help the reader to design/redesign algorithms for their requirements rather than be overawed by the challenges of a new framework.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.