6.046J Introduction to Algorithms (SMA 5503), Fall 2004

Thumbnail Image
Download
Name

6-046JFall-2004/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2004/CourseHome/index.htm

Size

14.74 KB

Format

HTML

Checksum (MD5)

f8dc82c260bea1c8920b5c13433be16c

Author(s)
Leiserson, Charles Eric
•
Indyk, Piotr
Alternative Title
Introduction to Algorithms (SMA 5503)
Date Issued
December 2004
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.
Subjects
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.