Fall 98, instructor Daniel Panario
Current announcements
This space will be used for announcements. Check it regularly.
- The course is over. Many thanks to the students that took this course!
General Information
- Get here the general information handout for the course in
text or ps format.
- You can check a list of sites
of interest for the course. It includes homepages of analysis of
algorithms and data structures courses, applets, homepages of
researchers, etc.
Lecture notes
The course consisted of 13 lectures of 2 hours each. The lecture
notes below were prepared
by the students of the course, and checked by the lecturer.
They are in postcript format.
Please e-mail the lecturer
any typos or comments you may have.
These lecture notes do not substitute the reading of
the textbooks that we strongly encourage.
At the beginning of each lecture or section we indicate
from which text or paper the material is taken.
- 1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13
The introductory first five weeks of the course are
mostly taken from
An Introduction to the Analysis of Algorithms by
Robert Sedgewick and
Philippe
Flajolet. We also use several books by
Don Knuth,
most notably the bibles
The Art of Computer Programming,
but also
Concrete Mathematics, and
Mathematics for the Analysis of Algorithms.
The remainder of the course is taken from several papers and books.
Our main reference is the future book ``Analytic Combinatorics''
(in preparation) by
Philippe
Flajolet and Robert
Sedgewick. Some chapters of this book are available as technical
reports from
INRIA:
In this course, we extensively use the first two technical reports
and ocassionally the others.
Summary of the lectures per month
Assignments and projects
Contact Information:
Office Hours: drop by SF3302C or fix a time by mail.
e-mail: daniel@cs.toronto.edu