6.046J Introduction to Algorithms (SMA 5503), Fall 2004
Citable URI:
http://hdl.handle.net/1721.1/37150
| Title: | 6.046J Introduction to Algorithms (SMA 5503), Fall 2004 |
| Author: | Leiserson, Charles Eric; Indyk, Piotr |
| Issue Date: | 2004-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/37150 |
| Other Identifiers: | 6.046J-Fall2004 |
| Other Identifiers: | 6.046J IMSCP-MD5-63596d090b7ab5fbb880892c52ce6745 |
| 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, SMA 5503, 6.046J, 6.046, 270303, Computational Mathematics, 110103, Information Technology |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| 6-046JFall-2004 ... -2004/CourseHome/index.htm | 15.08Kb | HTML |
View/ |
The following license files are associated with this item:
This item appears in the following Collection(s)
-
Electrical Engineering and Computer Science (6) -
Electrical Engineering and Computer Science (6)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|