Algorithm Design and Analysis

By 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 algorit... more

4.2

1111 ratings

Download on the App Store

Download on the App Store

Get it on Google Play

FAQs about Algorithm Design and Analysis:

How many episodes does Algorithm Design and Analysis have?

The podcast currently has 30 episodes available.

Algorithm Design and Analysis episodes:

December 03, 2010 Coping with NP-completeness
Lecture 28: Gusfield recaps NP-completeness.
The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.
...more
40min
December 01, 2010 Major theorems of NP-completeness
Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.
...more
51min
November 29, 2010 Formal definition of P and NP
In Lecture 26, Gusfield gives correct, formal definitions of P and NP, ending with a brief definition of NP-complete problems (languages).
...more
46min
November 24, 2010 An intuitive view of NP
Lecture 25 deals with an intuitive view of NP - not the correct formal definition.
...more
49min
November 22, 2010 Introduction to P and NP
Lecture 24 gives an introduction to P and NP and polynomial-time reductions.
...more
51min
November 17, 2010 Introduction to approximation algorithms
Lecture 23 covers approximation algorithms - definition, factor of two approximation for the center cover problem.
...more
48min
November 15, 2010 Finish of linear-time pattern matching
Lecture 22 completes linear-time pattern matching using the Z-algorithm
...more
52min
November 12, 2010 Linear-time pattern matching. Z-values and Z-algorithm
In Lecture 21, Gusfield covers linear-time pattern matching. He also discusses Z-values and Z-algorithms.
...more
52min
November 10, 2010 Unique-Decipherability. Graph algorithm and proof of correctness
Lecture 20 deals with unique-decipherability: efficient graph-based algorithm and proof of correctness.
...more
52min
November 08, 2010 The unique-decipherability problem
Lecture 19 covers the unique-decipherability problem and gives definitions and the start of a graph-based solution.
...more
53min

FAQs about Algorithm Design and Analysis:

How many episodes does Algorithm Design and Analysis have?

The podcast currently has 30 episodes available.