Sign In | Not yet a member? | Submit your article
 
Home   Technical   Study   Novel   Nonfiction   Health   Tutorial   Entertainment   Business   Magazine   Arts & Design   Audiobooks & Video Training   Cultures & Languages   Family & Home   Law & Politics   Lyrics & Music   Software Related   eBook Torrents   Uncategorized  

Introduction to Algorithms - by MIT 2009
Introduction to Algorithms - by MIT 2009
Date: 24 May 2011, 07:49

Free Download Now     Free register and download UseNet downloader, then you can FREE Download from UseNet.

    Download without Limit " Introduction to Algorithms - by MIT 2009 " from UseNet for FREE!
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
01 _ Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort
02 _ Asymptotic Notation/Recurrences/Substitution, Master Method
03 _ Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
04 _ Quicksort, Randomized Algorithms
05 _ Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
06 _ Order Statistics, Median
07 _ Hashing, Hash Functions
08 _ Universal Hashing, Perfect Hashing
09 _ Relation of BSTs to Quicksort/Analysis of Random BST
10 _ Red-black Trees, Rotations, Insertions, Deletions
11 _ Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
12 _ Skip Lists
13 _ Amortized Algorithms, Table Doubling, Potential Method
14 _ Competitive Analysis: Self-organizing Lists
15 _ Dynamic Programming, Longest Common Subsequence
16 _ Greedy Algorithms, Minimum Spanning Trees
17 _ Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
18 _ Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
19 _ Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
20 _ Advanced Topics
21 _ Advanced Topics (cont.)
22 _ Advanced Topics (cont.)
23 _ Advanced Topics (cont.)

DISCLAIMER:

This site does not store Introduction to Algorithms - by MIT 2009 on its server. We only index and link to Introduction to Algorithms - by MIT 2009 provided by other sites. Please contact the content providers to delete Introduction to Algorithms - by MIT 2009 if any and email us, we'll remove relevant links or contents immediately.



Comments

Comments (0) All

Verify: Verify

    Sign In   Not yet a member?


Popular searches