CMPS290A - Topics in Algorithms
Course Basics
Class: Tu/Th, 1:30-3
Location: Crown 201
Instructor: C. (Sesh) Seshadhri (sesh@)
Office: E2-347A
Course Description
This is an advanced theoretical computer science seminar course. The main topic
is sublinear algorithms for graphs. There has been much progress on this subject
over the past decade, with some deep theorems on the existence of sublinear algorithms
for a broad class of graph properties. The aim will be to present complete proofs of these theorems,
and discuss related open problems.
All students are expected to scribe lecture notes. A template for notes is here.
Material
We will start by using Oded Goldreich's book on property testing, but will mostly cover papers. I will try to put most material
on the schedule page.
Other announcements