Algorithms Illuminated: Omnibus Edition - Hardcover

Roughgarden, Tim

Hardcover

ISBN 10: 0999282980 ISBN 13: 9780999282984

Publisher: SOUNDLIKEYOURSELF PUBLISHING, 2022

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 this title

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).

Edition details

• Publisher: SOUNDLIKEYOURSELF PUBLISHING
• Publication date: 2022
• Language: English
• ISBN 10: 0999282980
• ISBN 13: 9780999282984
• Binding: Hardcover
• Edition number: 1
• Number of pages: 690