Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shorte...More
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: 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. Enrollment may be limited.
This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization,...
ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-S<br/>cience/6-854JFall-2005/CourseHome/
-
Get Site Info
The MIT Press online catalog contains descriptions of in-print and out-of-print books, current and past journals, online ordering/subscription options, contact and customer service information, news, events, and other materials relating to...