3 dic 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.
Episodios
Ordenados por fecha de publicación.
1 dic 2010
Major theorems of NP-completeness
29 nov 2010
Formal definition of P and NP
24 nov 2010
An intuitive view of NP
22 nov 2010
Introduction to P and NP
17 nov 2010
Introduction to approximation algorithms
15 nov 2010
Finish of linear-time pattern matching
12 nov 2010
Linear-time pattern matching. Z-values and Z-algorithm
10 nov 2010
Unique-Decipherability. Graph algorithm and proof of correctness
8 nov 2010
The unique-decipherability problem
5 nov 2010
Floyd-Warshall algorithm for all-pairs shortest path
3 nov 2010
Dynamic programming for shortest path problem
1 nov 2010
Dynamic programming for RNA folding.
29 oct 2010
Intro to the RNA folding problem and recurrences
27 oct 2010
Intro to dynamic programming, weighted interval problems
Más podcasts relacionados
Otros podcasts de Technology.