Tim Roughgarden: Algorithms Illuminated

Cover: 9780999282984 | Algorithms Illuminated | Omnibus Edition | Tim Roughgarden | Buch

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

55,55 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

auf Lager, Lieferzeit 1-2 Werktage

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

A unified and accessible introduction for graduate courses in computational fluid dynamics and heat transfer. This unique approach covers all necessary mathematical preliminaries before walking the student through the most common heat transfer and fluid dynamics problems, then testing their understanding further with ample end-of-chapter problems.

Über den Autor

Tim Roughgarden is a Professor of Computer Science at Columbia University. His research, teaching, and expository writings have been recognized by a Presidential Early Career Award for Scientists and Engineers, the ACM Grace Murray Hopper Award, the EATCS-SIGACT Gödel Prize, a Guggenheim Fellowship, the INFORMS Lancaster Prize, and a Tau Beta Pi Teaching Award. His other books include Twenty Lectures on Algorithmic Game Theory (2016) and Beyond the Worst-Case Analysis of Algorithms (2021).

Inhaltsverzeichnis

Part I. The Basics: 1. Introduction; 2. Asymptotic notation; 3. Divide-and-Conquer algorithms; 4. The master method; 5. QuickSort; 6. Linear-time selection; Part II. Graph Algorithms and Data Structures: 7. Graphs: the Basics; 8. Graph search and its applications; 9. Dijkstra's shortest-path algorithm; 10. The heap data structure; 11. Search trees; 12. Hash tables and Bloom filters; Part III. Greedy Algorithms and Dynamic Programming; 13. Introduction to greedy algorithms; 14. Huffman codes; 15. Minimum spanning trees; 16. Introduction to dynamic programming; 17. Advanced dynamic programming; 18. Shortest paths revisited; Part IV. Algorithms for NP-Hard Problems; 19. What is NP-Hardness?; 20. Compromising on correctness: efficient inexact algorithms; 21. Compromising on speed: exact inefficient algorithms; 22. Proving problems NP-hard; 23. P, NP, and all that; 24. Case study: the FCC incentive auction; Appendix A. Quick review of proofs By induction; Appendix B. Quick review of discrete probability; Epilogue. A field guide to algorithm design; Hints and solutions.

Erscheinungsjahr:	2022
Genre:	Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Inhalt:	Gebunden
ISBN-13:	9780999282984
ISBN-10:	0999282980
Sprache:	Englisch
Einband:	Gebunden
Autor:	Roughgarden, Tim
Hersteller:	Cambridge University Pr.
Abbildungen:	Worked examples or Exercises; 60 Tables, black and white; 350 Line drawings, black and white
Maße:	261 x 186 x 48 mm
Von/Mit:	Tim Roughgarden
Erscheinungsdatum:	15.12.2022
Gewicht:	1,622 kg

Ähnliche Produkte