0

(

ratings

)

1

students

Created by:

Profile Photo

Last updated:

September 7, 2022

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

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.

Course Curriculum

  • Course Introduction Fibonacci Heaps Unlimited
  • MST Persistent Data Structures Unlimited
  • Splay Trees Unlimited
  • Splay Trees (cont.) Suffix Trees Tries Unlimited
  • Dijkstra’s Algorithm Van Emde Boas Queues Unlimited
  • Van Emde Boas Queues (cont.) Hashing Unlimited
  • 2-Level Hashing Network Flows Unlimited
  • Min-Cost Flows Unlimited
  • Min-Cost Flows (cont.) Unlimited
  • Linear Programming (cont.) Unlimited
  • Linear Programming (cont.) Strong Duality Unlimited
  • Complementary Slackness Unlimited
  • Approximation Unlimited
  • Randomized Unlimited
  • Online Algorithms Unlimited
  • Randomized Online Algorithms Unlimited
  • Sweep Algorithms Unlimited
  • External Memory Algorithms Unlimited
  • Parallel Algorithms Unlimited
    • Course Introduction Fibonacci Heaps Unlimited
    • Persistent Data Structures Suffix Trees Unlimited
    • Suffix Trees (cont.) Unlimited
    • Splay Trees Unlimited
    • Fingerprinting (cont.) Max Flows Unlimited
    • Min Cost Flow Algorithms Unlimited
    • Linear Programming (cont.) Unlimited
    • LP: Interior Points Algorithm Unlimited
    • Approximation Algorithm: Rounding, Relaxation Unlimited
    • Approximation Algorithm: LP Relaxation, Randomized Rounding Unlimited
    • Fixed Parameter Tractability Unlimited
    • Lower Bounds for Randomized Unlimited

About the instructor

5 5

Instructor Rating

1

Reviews

1520

Courses

1915

Students

Profile Photo
Massachusetts Institute of Technology