This course will focus on the design of algorithms that are restricted
to run in sublinear time, and thus can view only a very
small portion of the data. The study of sublinear time
algorithms has been applied to problems from a wide range
of areas, including algebra, graph theory, geometry, string
and set operations, optimization and probability theory.
This course will introduce many of the various techniques
that have been applied to analyzing such algorithms.
Will be based on the solutions to homework exercises
and class participation. Undergraduates will also have a final exam.
Algorithms. Exposure to computational complexity is helpful but not
Time and location
The course will take place on Mondays, 13:00-16:00, in
Course Information Handout
More details on syllabus, grading, etc. (pdf)
(see also "useful pointers" below)
Jan 4: I am cancelling problem 2 of HW 3, but try to
do it anyhow.
Jan 2: Homework 4 is posted!
Dec 27: Homework 3 is posted! There are only two
problems. The due date is two weeks
from tomorrow's lecture, but I will hand out more problems in
each of the next lectures.
On December 14, we will start a few minutes late
by Laszlo Lovasz.