Advanced Algorithms, Fall 2005
| Rating: | Not rated yet |
| Rate item | |
| Type: | Course Related Materials |
| Grade Level: | Post-secondary |
Author: Karger, David
Subject: Science and Technology
Institution Name:
M.I.T.
Collection Name: MIT OpenCourseWare
Abstract: This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. Domains include string algorithms, network optimization, parallel algorithms, computational geometry, online algorithms, external memory, cache, and streaming algorithms, and data structures.
Details
Course Type: Full Course
Material Types: Activities and Labs, Homework and Assignments, Lecture Notes, Syllabi
Media Formats: Text/HTML, Downloadable docs
Language: English
