Dec 3, 2010
Podcast · Inglés
Algorithm Design and Analysis
Dan Gusfield
The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.
Episodes
Ordered by publication date.
Dec 1, 2010
Major theorems of NP-completeness
Nov 29, 2010
Formal definition of P and NP
Nov 24, 2010
An intuitive view of NP
Nov 22, 2010
Introduction to P and NP
Nov 17, 2010
Introduction to approximation algorithms
Nov 15, 2010
Finish of linear-time pattern matching
Nov 12, 2010
Linear-time pattern matching. Z-values and Z-algorithm
Nov 10, 2010
Unique-Decipherability. Graph algorithm and proof of correctness
Nov 8, 2010
The unique-decipherability problem
Nov 5, 2010
Floyd-Warshall algorithm for all-pairs shortest path
Nov 3, 2010
Dynamic programming for shortest path problem
Nov 1, 2010
Dynamic programming for RNA folding.
Oct 29, 2010
Intro to the RNA folding problem and recurrences
Oct 27, 2010
Intro to dynamic programming, weighted interval problems
More related podcasts
Other podcasts in Technology.