Analysis of Algorithms | Cornell University CS 4820

Explore the design and analysis of algorithms with a focus on real-world computing applications in systems, networks, AI, computer vision, data mining, and computational biology.

Introduction

This course develops techniques used in the design and analysis of algorithms, with an emphasis on problems arising in computing applications. Example applications are drawn from systems and networks, artificial intelligence, computer vision, data mining, and computational biology.

Highlights

• Covers four major algorithm design techniques: greedy algorithms, divide and conquer, dynamic programming, and network flow
• Explores computability theory focusing on undecidability and computational complexity focusing on NP-completeness
• Introduces algorithmic techniques for intractable problems, including identification of structured special cases, approximation algorithms, and local search heuristics

Recommendation

This course is recommended for students interested in algorithm design and analysis, as well as those working on computing applications in areas such as systems, networks, artificial intelligence, computer vision, data mining, and computational biology.