E0 203 Spectral Algorithms   (Jan-April 2018)

Instructor: Prof. Ambedkar Dukkipati, Prof. Anand Louis
Venue: CSA 117
Time: Monday and Wednesday (3:30-5:00 pm)

Course Description

Spectral graph algorithms are very popular in theoretical computer science and machine learning, as they provide polynomial time approximations to several hard computational problems. This course will cover some basic topics in spectral graph theory and algorithms with some application to network analysis. This course emphasises rigorous analysis of algorithms.

References

Course Registration

To join the course, please register on Piazza.
If prompted, enter this activation code: 40cdiobdr87

Assignments

Lectures