6.046J / 18.410J Introduction to Algorithms, Fall 2001

Demaine, Erik D.; Leiserson, Charles Eric; Lee, Wee Sun

Author(s)

Demaine, Erik D.; Leiserson, Charles Eric; Lee, Wee Sun

Download6-046JFall-2001/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JIntroduction-to-AlgorithmsFall2001/CourseHome/index.htm (15.54Kb)

Alternative title

Introduction to Algorithms

Terms of use

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.

Metadata

Show full item record

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.

Date issued

2001-12

URI

http://hdl.handle.net/1721.1/36847

Department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics

Other identifiers

6.046J-Fall2001

local: 6.046J

local: 18.410J

local: 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

Collections

MIT OCW Archived Courses