Algorithms, April 2021 at CIS

Instructor:
David Woodruff

Lectures:
810pm ET on Saturday for first 6 weeks, then 811pm ET Saturday

Office Hours:
Talk with Liu or Tianrui

TAs:
Liu Liu and
Tianrui Liu
Course Description
Design and Analyze Algorithms!
Topics: multiplicative weights, Strassen and Karatsuba, polynomials, convexity, gradient descent
Grading
Grading is based on 4 homeworks each worth 8%, an exam worth 18%, a final project worth 40%, and class participation worth 10%
Latex
We encourage homework solutions, scribe notes, and final projects to be typeset in LaTeX. If you are not familiar with LaTeX, see this introduction.
Lectures
Problem Sets
Homework 1
Homework 2
Homework 3
Homework 4
References
Materials from the following course might be useful in various parts of this course:
Undergraduate Algorithms Class at Carnegie Mellon University
Maintained by David Woodruff