We will study the design and analysis of algorithms from a modern perspective with a particular focus on techniques that find use in many subfields of computer science. The modern perspective means that there will be extensive use of randomization, linear algebra, and optimization. Topics will include randomized algorithms, streaming, advanced data structures, dimensionality reduction, clustering, low rank approximation, markov decision processes, linear programming, etc. Administrative Information
Instructor: Shayan Oveis Gharan
Discussion Board Assignments
Class Mailing list: cse521a_au21 Final ProjectSuggestions
Common KnowledgeRelated MaterialsSimilar courses at other schools


Inclass Notes in Scribble.
Tentative Schedule:
