Introduction to Algorithms

Username:
Password:
Remember me.
Forgot your login?
Sign up a new account!

most popular | topics | recently added

Introduction to Algorithms

ID:

[collection:1802]

Title:

Introduction to Algorithms

Summary:

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.

Category:

Computer Science

Organisation:

Massachusetts Institute of Technology

Period:

Fall 2005

Inserted by:

ID:

[collection:1802]

Title*:
(iTunes title)

Subtitle:
(iTunes subtitle)

Summary:
(iTunes summary)

Description:
(iTunes description)

Language:
(iTunes language)

Keywords:
(iTunes keywords)

Topic:

Scientific field:

Organisation*:

Period:

Owner:

save | cancel | delete this lecture

10 Videos

Introduction to Algorithms - 01 (Leiserson)
Introduction to Algorithms - 02 (Leiserson)
Introduction to Algorithms - 03 (Leiserson)
Introduction to Algorithms - 04 (Leiserson)
Introduction to Algorithms - 05 (Leiserson)
Introduction to Algorithms - 06 (Leiserson)
Introduction to Algorithms - 07 (Leiserson)
Introduction to Algorithms - 08 (Leiserson)
Introduction to Algorithms - 09 (Leiserson)
Introduction to Algorithms - 10 (Leiserson)

Wiki

RSS

RSS - Lecture Updates

Meet us:

Bookmarks

yovisto on Facebook

Twitter Updates

Follow yovisto on Twitter

New Tags:

uboot enigma computing lovelace navy ai inventions artificial handelsschiff machine history merchant charles beginning

Supporting

Books