Advanced Algorithms

Adaptive mesh refinement algorithm technique.

The adaptive mesh refinement algorithm technique, shown above, is used to break complex computing problems into smaller pieces. (Image courtesy of Ernest Orlando Lawrence Berkeley National Laboratory.)

Instructor(s)

MIT Course Number

6.854J / 18.415J

As Taught In

Fall 2005

Level

Graduate

Translated Versions

简体字

Cite This Course

Course Description

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.

Other OCW Versions

OCW has published multiple versions of this subject. Question_OVT logo

Karger, David. 6.854J Advanced Algorithms, Fall 2005. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005 (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close