Introduction to Algorithms (2005) - Prof. Erik Demaine Prof. Charles Leiserson - TopPodcast.com

*/ ?>

View Top 200 Chart

Back to Rankings Page

Introduction to Algorithms (2005) – Prof. Erik Demaine Prof. Charles Leiserson — Technology
Introduction to Algorithms (2005) – Prof. Erik Demaine Prof. Charles Leiserson

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.

Copyright: © http://ocw.mit.edu; Creative Commons Attribution-NonCommercial-ShareAlike 3.0; http://ocw.mit.edu/terms

Latest Episodes:

Related Podcasts