Randomized Algorithms

CSCI-UA.0480.73

Shortcuts | Notes

Course information

  • Instructor: Richard Cole.

  • Semester: Spring 2023.

  • Outline: General techniques for analyzing randomized algorithms and specific algorithms; Parallel versions of quicksort, hashing, bloom filters, string matching; Primality testing, stable matching with random preferences, symmetry breaking; The RSA cryptographic scheme, routing in sparse networks; Random graphs, models of the Internet.

Gradebook

Overall grade: A (4.00/4.00)

Item Grade Letter
Assignments A
Midterm 42.5/50 A
Final 38.5/60 A