• Week 1: Introduction
  • Beyond Worst-Case Algorithm Analysis (Lecture slides)
    • Amortized analysis
    • Randomized algorithm
    • Insertion sort
    • The inequality of arithmetic and geometric means
    • Quicksort
    • NP-completeness
    • Vertex cover
    • Parameterized complexity
    • Learning-augmented algorithm
• Week 2: Amortized analysis
  • No class, Monday, January 12, due to instructor travels.
  • Amortized Data Structures (Lecture slides)
    • Notes on static-to-dynamic transformations
    • Goodrich-Kloss paper on tiered vectors
    • Bender-Hu paper on packed memory arrays
• Week 3: Randomized algorithms
  • No class, Monday, January 19, MLK Jr. Day
  • Concentration bounds (Lecture slides)
    • Chernoff bound
    • Paper by Dillencourt et al. on Chernoff bounds
• Week 4: Randomized algorithms
  • The Birthday paradox and Coupon collector problem (Lecture slides)
    • Birthday paradox
    • Coupon collector problem
    • Harmonic number.
    • Goodrich paper on IP traceback
    • Goodrich paper on spin-the-bottle sort
  • String pattern matching (Lecture slides)
    • Rabin-Karp algorithm
• Week 5: Randomized algorithms
  • Randomized Graph Algorithms (Lecture slides)
    • Graph representations
    • Karger's algorithm
  • Combinatorial Group Testing (Lecture slides)
    • Group testing
• Week 6: Instance-sensitive algorithms
  • Monday, February 9, Midterm Exam 1
  • Entropy-Sensitive Sorting (Lecture slides)
    • Stirling's Approximation
    • Merge-sort
    • Huffman coding
    • Powersort
    • Munro and Wild's paper on Peeksort and Powersort
• Week 7: Instance-sensitive algorithms
  • No class, Monday, February 16, Presidents' Day
  • More Instance-Sensitive Algorithms (Lecture slides)
    • Maxima of a point set
    • Entropy-bounded algorithms paper by Eppstein, Goodrich, Illickan, and To
    • Cartesian tree
    • Heapsort paper by Levcopoulos and Petersson
• Week 8: Parallel algorithms
  • Introduction to Parallel Algorithms (Lecture slides)
    • Gordon Moore
    • Moore's Law
    • Grace Hopper
    • PRAM Model
    • Fork-join model
    • Analysis of parallel algorithms
    • Compare-and-swap
    • Prefix sum
  • Techniques for Parallel Algorithms (Lecture slides)
    • Convex hull
• Week 9: Parallel algorithm design
  • Monday, March 2, Midterm Exam 2
  • Parallel Algorithm Design (Lecture slides)
    • Euler tour technique
    • Tree contraction
    • Parallel algorithms for minimum spanning trees
• Week 10: Algorithms with predictions
  • Online Algorithms (Lecture slides)
    • Learning augmented algorithm
    • Ski rental problem
    • List update problem
  • Learned index structures (Lecture slides)
    • The PGM-Index
    • O'Rourke's paper on piecewise-linear approximation