GS/EECS 6111 (3.00)

Advanced Algorithm Design and Analysis

Description

This is an advanced theoretical computer science course directed at non-theory students with the standard undergraduate background. The goal is to survey the key theory topics that every computer science graduate student should know. In about two weeks for each selected topic, we will gain insights into the basics and study one or two example in depth. These might include: a deepening of student's knowledge of key algorithmic techniques, randomized algorithms, NP-completeness, approximation algorithms, linear programming, distributed systems, computability, concurrency theory, cryptography, structural complexity, data structures, and quantum algorithms. Students will be expected to give a presentation on some topic new to them and solve some difficult problems in homework assignments. Prerequisites: LE/EECS 3101 3.00 and any fourth-year theory course.

Tips: you can drag and drop the boxes to clone them to different sections or groups within a prerequisite equation.

Thank you for your edit suggestion!
Our staff will review and approve it soon.
You can close this page now.

There might have been an error with the server or your input. Please check your entry and/or try again later.