ICS 261 Fall 2002
Data Structures

Instructor: George Lueker.

Office Hours During Finals Week:

Some tips for the final exam

Midterm 1 answers and comments on the grading

Midterm 2 answers and comments on the grading

Some pointers to the literature:

M. Farach. Optimal suffix tree construction with large alphabets. In Proceedings 38th Annual Symposium on Foundations of Computer Science, pages 137-143, Los Alamitos, CA, 1997.

N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29:7 (July 1986), pp. 669-679.

There is a newsgroup for this course named ics.261.