Description

Overview:

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.

Subject:

Computer Science, Engineering

Level:

Graduate / Professional

Material Type:

Full Course

Author:

Karger, David

Provider:

MIT

Provider Set:

MIT OpenCourseWare

Date Added:

09/01/2005