CSCI 5454: Design and Analysis of Algorithms

Fall 2019

University of Colorado, Boulder

Instructor: Bo Waggoner
TA: Charlie Carlson

Time: Tues/Thurs 11:00am - 12:15pm
Room: ECCR 150 (and recorded/streamed)

Course information and syllabus


This graduate-level course will survey a variety of approaches to designing and rigorously analyzing efficient algorithms. Topics include: combinatorial and graph algorithms; randomized, online, and approximation algorithms; and continuous convex or linear-algebra based methods.

Resources and Links

The course does not have a required textbook. Readings will be posted or linked. We will start out with some readings from Algorithms by Dasgupta, Papadimitriou, and Vazirani (DPV), which can be found online for free.

Prof. Bo's office hours: TBA

TA Charlie's office hours: TBA


1 Tue, Aug 27

Intro: word RAM model, big-O, stable matching problem

HW1 posted
Resources TBA
Module 1: Combinatorial and Graph Algorithms
2 Thu, Aug 29

Depth-first search, directed acyclic graphs, topological sort, components


Course syllabus; Dasgupta, Papadimitriou, Vazirani (DPV) Chapter 3

3 Tue, Sep 3

HW1 due; HW2 posted