In Stock
Algorithms illuminated
Hardback
€69.60
Collect 208 Reward Points
- Free Delivery from
- This Book Is Available Online Only
- Book Synopsis
- In Algorithms Illuminated, Tim Roughgarden teaches the basics of algorithms in the most accessible way imaginable. This Omnibus Edition contains the complete text of Parts 1-4, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems. Hundreds of worked examples, quizzes, and exercises, plus comprehensive online videos, help readers become better programmers; sharpen their analytical skills; learn to think algorithmically; acquire literacy with computer science's greatest hits; and ace their technical interviews.
- About The Author
- 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).
- Product Details
-
- ISBN
- 9780999282984
- Format
- Hardback
- Publisher
- Soundlikeyourself Publishing, (15 September 2022)
- Number of Pages
- 690
- Weight
- 1630 grams
- Language
- English
- Dimensions
- 262 x 183 x 48 mm
- Categories: