Publication:
Introduction To Algorithms (SMA 5503)
Introduction To Algorithms (SMA 5503)
No Thumbnail Available
Files
Date
2005
Authors
Charles Leiserson, Erik Demaine
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Abstract
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: 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
Description
Courses: Cấu trúc dữ liệu và giải thuật ; Included Materials: Syllabus, Video Lectures, Readings, Assignments, Exams ; Source: https://ocw.mit.edu/courses/6-046j-introduction-to-algorithms-sma-5503-fall-2005/ ; Language: Eng ; Publisher: MIT Open Courseware