6.046J / 18.410J Introduction to Algorithms, Fall 2001

Title:	6.046J / 18.410J Introduction to Algorithms, Fall 2001
Author:	Demaine, Erik D.; Leiserson, Charles Eric; Lee, Wee Sun
Issue Date:	2001-12
Abstract:	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.
URI:	http://hdl.handle.net/1721.1/36847
Other Identifiers:	6.046J-Fall2001
Other Identifiers:	6.046J 18.410J IMSCP-MD5-ee70ee63c71e617e18a30203563ab607
Keywords:	algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing, 6.046J, 18.410J, 6.046, 18.410, Algorithms, 110201, Computer Programming/Programmer, General

Files in this item

Files	Size	Format	View
6-046JFall-2001 ... l2001/CourseHome/index.htm	15.91Kb	HTML	View/Open

The following license files are associated with this item: