MPCS 55005: Advanced Algorithms
Spring 2021


announcements | general information | organization


Announcements

Homework 8 due Tuesday May 25 at 1:00 am CDT (Chicago time): submit to GitHub

Textbook: Introduction to Algorithms (Third Edition) by Cormen et al. (ISBN: 0-262-03384-4) = CLRS

Grading scheme:

Schedule of lectures

March 30
Meeting 1
Complexity of sorting: lower bound for comparison sorting
Linear time sorting: Counting sort, Radix sort, Bucket sort, MSD sort
5:30–7:30 pm
Readings: CLRS chapter 8; Radix sort; MSD Radix Sort
April 6
Meeting 2
Hashing: Bloom filters and Cuckoo hashing
5:30–7:30 pm
Readings: CLRS chapter 11; Bloom filters; Cuckoo hashing
April 13
Meeting 3
Balanced binary search trees: Red-Black trees
5:30–7:30 pm
Readings: CLRS chapter 13
April 20
Meeting 4
NP-completeness and reductions
5:30–7:30 pm
Readings: CLRS chapter 34; Dasgupta et al. Algorithms, Chapter 8
Recommended reading: Erickson Algorithms, Chapter 12, sections 12.1–12.3; 12.4–12.11; 12.14
April 27
Meeting 5
Approximation algorithms
5:30–7:30 pm
Readings: CLRS chapter 35, sections 35.1–35.3
May 4
Meeting 6
Randomized algorithms
5:30–7:30 pm
Readings: CLRS chapter 5; Probability and Computing, chapter 7, section 7.1.2; Randomized Algorithms, chapter 1, Introduction & sections 1.1–1.3; Chapter 8, section 8.3.
May 11
Meeting 7
Local search
5:30–7:30 pm
Readings: Algorithm Design, chapter 12, sections 12.1–12.5.
May 18
Meeting 8
Computational geometry
5:30–7:30 pm
Readings: CLRS chapter 33, sections 33.1–33.3.
May 25
Meeting 9
Linear programming
5:30–7:30 pm
Readings: Dasgupta et al. Algorithms, Chapter 7; CLRS chapter 29

Topics subject to change based on class progress and student interest.


Organization

Staff

Lectures

Class meetings


brady at cs dot uchicago dot edu