| dc.contributor.author | Demaine, Erik D. | en_US |
| dc.contributor.author | Leiserson, Charles Eric | en_US |
| dc.contributor.author | Lee, Wee Sun | en_US |
| dc.coverage.temporal | Fall 2001 | en_US |
| dc.date.issued | 2001-12 | |
| dc.identifier | 6.046J-Fall2001 | |
| dc.identifier | local: 6.046J | |
| dc.identifier | local: 18.410J | |
| dc.identifier | local: IMSCP-MD5-ee70ee63c71e617e18a30203563ab607 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/36847 | |
| dc.description.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. | en_US |
| dc.language | en-US | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | efficient algorithms | en_US |
| dc.subject | sorting | en_US |
| dc.subject | search trees | en_US |
| dc.subject | heaps | en_US |
| dc.subject | hashing | en_US |
| dc.subject | divide-and-conquer | en_US |
| dc.subject | dynamic programming | en_US |
| dc.subject | amortized analysis | en_US |
| dc.subject | graph algorithms | en_US |
| dc.subject | shortest paths | en_US |
| dc.subject | network flow | en_US |
| dc.subject | computational geometry | en_US |
| dc.subject | number-theoretic algorithms | en_US |
| dc.subject | polynomial and matrix calculations | en_US |
| dc.subject | caching | en_US |
| dc.subject | parallel computing | en_US |
| dc.subject | 6.046J | en_US |
| dc.subject | 18.410J | en_US |
| dc.subject | 6.046 | en_US |
| dc.subject | 18.410 | en_US |
| dc.subject | Algorithms | en_US |
| dc.title | 6.046J / 18.410J Introduction to Algorithms, Fall 2001 | en_US |
| dc.title.alternative | Introduction to Algorithms | en_US |
