Classes

CS120: Intro to Algorithms and their Limitations

Semester: 

Fall

Offered: 

2021

An introductory course in theoretical computer science, aimed at giving students the power of using mathematical abstraction and rigorous proof to understand computation. Thus equipped, students will be able to design and use algorithms that apply to a wide variety of computational problems, with confidence about their correctness and efficiency, as well as recognize when a problem may have no algorithmic solution. At the same time, they will gain an appreciation for the beautiful mathematical theory of computation that is independent of (indeed, predates) the technology on which it is...

Read more about CS120: Intro to Algorithms and their Limitations

CS229r: Spectral Graph Theory in Computer Science

Semester: 

Fall

Offered: 

2020

The (temporary) webpage for the Spring 2023 offering is on Canvas.

Spectral graph theory is about how eigenvalues, eigenvectors, and other linear-algebraic quantities give us useful information about a graph, for example about how well-connected it is, how well we can cluster or color the nodes, and how quickly random walks converge to a limiting distribution.  Spectral graph theory has turned out to be extremely useful in theoretical...

Read more about CS229r: Spectral Graph Theory in Computer Science