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,
a class project
and class participation.
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)
Turn in HW 6 to box 370 in Schreiber
to sign up for PROJECT PRESENTATIONS. Prepare at most 5 minutes --
slides are fine. I'd also like a short writeup (about a paragraph)
containing what you did, what you found, and possibly
what you would have liked to have
done, some good open questions,... If your project involved
code or a proof, include the code/proof as an appendix.
January 5 lecture cancelled! Instead, lectures will be moved
back a week, and project presentations
will be done at a different time. Stay tuned for a sign up sheet
for project presentations.