Algorithms Illuminated (Part 3)
Title | Algorithms Illuminated (Part 3) PDF eBook |
Author | Tim Roughgarden |
Publisher | |
Pages | 230 |
Release | 2019-05-09 |
Genre | Computers |
ISBN | 9780999282946 |
Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).
Algorithms Illuminated, Part 1
Title | Algorithms Illuminated, Part 1 PDF eBook |
Author | Tim Roughgarden |
Publisher | |
Pages | 218 |
Release | 2017-09-27 |
Genre | Computer algorithms |
ISBN | 9780999282908 |
Algorithms Illuminated is an accessible introduction to algorithms for anyone with at least a little programming experience, based on a sequence of popular online courses. Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms, randomized algorithms, and several famous algorithms for sorting and selection.
Algorithms Illuminated
Title | Algorithms Illuminated PDF eBook |
Author | Tim Roughgarden |
Publisher | |
Pages | 209 |
Release | 2018 |
Genre | |
ISBN | 9780999282939 |
Algorithms Illuminated
Title | Algorithms Illuminated PDF eBook |
Author | Tim Roughgarden |
Publisher | |
Pages | 217 |
Release | 2019 |
Genre | |
ISBN | 9780999282953 |
Beyond the Worst-Case Analysis of Algorithms
Title | Beyond the Worst-Case Analysis of Algorithms PDF eBook |
Author | Tim Roughgarden |
Publisher | Cambridge University Press |
Pages | 705 |
Release | 2021-01-14 |
Genre | Computers |
ISBN | 1108494315 |
Introduces exciting new methods for assessing algorithms for problems ranging from clustering to linear programming to neural networks.
Algorithms
Title | Algorithms PDF eBook |
Author | Sanjoy Dasgupta |
Publisher | McGraw-Hill Higher Education |
Pages | 338 |
Release | 2006 |
Genre | Computer algorithms |
ISBN | 0077388496 |
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text DasGupta also offers a Solutions Manual which is available on the Online Learning Center."Algorithms is an outstanding undergraduate text equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel it is a joy to read." Tim Roughgarden Stanford University
Twenty Lectures on Algorithmic Game Theory
Title | Twenty Lectures on Algorithmic Game Theory PDF eBook |
Author | Tim Roughgarden |
Publisher | Cambridge University Press |
Pages | 356 |
Release | 2016-08-30 |
Genre | Computers |
ISBN | 1316781178 |
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.